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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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-c016-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716533058943

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-c016
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 06:44:20] [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 06:44:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:44:20] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2024-05-24 06:44:20] [INFO ] Transformed 2826 places.
[2024-05-24 06:44:20] [INFO ] Transformed 8960 transitions.
[2024-05-24 06:44:20] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 588 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 29 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3768
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3768
Ensure Unique test removed 410 transitions
Reduce isomorphic transitions removed 410 transitions.
Iterating post reduction 1 with 410 rules applied. Total rules applied 1013 place count 1318 transition count 3358
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1165 place count 1166 transition count 3054
Iterating global reduction 2 with 152 rules applied. Total rules applied 1317 place count 1166 transition count 3054
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1405 place count 1166 transition count 2966
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1418 place count 1153 transition count 2940
Iterating global reduction 3 with 13 rules applied. Total rules applied 1431 place count 1153 transition count 2940
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1444 place count 1140 transition count 2914
Iterating global reduction 3 with 13 rules applied. Total rules applied 1457 place count 1140 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1470 place count 1127 transition count 2888
Iterating global reduction 3 with 13 rules applied. Total rules applied 1483 place count 1127 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1496 place count 1114 transition count 2862
Iterating global reduction 3 with 13 rules applied. Total rules applied 1509 place count 1114 transition count 2862
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1522 place count 1101 transition count 2836
Iterating global reduction 3 with 13 rules applied. Total rules applied 1535 place count 1101 transition count 2836
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1547 place count 1089 transition count 2812
Iterating global reduction 3 with 12 rules applied. Total rules applied 1559 place count 1089 transition count 2812
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1571 place count 1077 transition count 2788
Iterating global reduction 3 with 12 rules applied. Total rules applied 1583 place count 1077 transition count 2788
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1632 place count 1028 transition count 2604
Iterating global reduction 3 with 49 rules applied. Total rules applied 1681 place count 1028 transition count 2604
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1734 place count 975 transition count 2392
Iterating global reduction 3 with 53 rules applied. Total rules applied 1787 place count 975 transition count 2392
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1840 place count 922 transition count 2264
Iterating global reduction 3 with 53 rules applied. Total rules applied 1893 place count 922 transition count 2264
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1945 place count 870 transition count 2160
Iterating global reduction 3 with 52 rules applied. Total rules applied 1997 place count 870 transition count 2160
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2048 place count 819 transition count 2058
Iterating global reduction 3 with 51 rules applied. Total rules applied 2099 place count 819 transition count 2058
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2150 place count 768 transition count 1956
Iterating global reduction 3 with 51 rules applied. Total rules applied 2201 place count 768 transition count 1956
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2250 place count 719 transition count 1858
Iterating global reduction 3 with 49 rules applied. Total rules applied 2299 place count 719 transition count 1858
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2309 place count 709 transition count 1838
Iterating global reduction 3 with 10 rules applied. Total rules applied 2319 place count 709 transition count 1838
Applied a total of 2319 rules in 1120 ms. Remains 709 /1628 variables (removed 919) and now considering 1838/5962 (removed 4124) transitions.
[2024-05-24 06:44:22] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
// Phase 1: matrix 1236 rows 709 cols
[2024-05-24 06:44:22] [INFO ] Computed 2 invariants in 40 ms
[2024-05-24 06:44:22] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-24 06:44:22] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-24 06:44:22] [INFO ] Invariant cache hit.
[2024-05-24 06:44:23] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-24 06:44:24] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
[2024-05-24 06:44:24] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-24 06:44:24] [INFO ] Invariant cache hit.
[2024-05-24 06:44:25] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 709/1628 places, 1838/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4139 ms. Remains : 709/1628 places, 1838/5962 transitions.
Support contains 23 out of 709 places after structural reductions.
[2024-05-24 06:44:25] [INFO ] Flatten gal took : 141 ms
[2024-05-24 06:44:25] [INFO ] Flatten gal took : 94 ms
[2024-05-24 06:44:25] [INFO ] Input system was already deterministic with 1838 transitions.
Support contains 22 out of 709 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) 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 12 ms. (steps per millisecond=83 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) 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 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 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 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 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 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 173265 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{8=1, 11=1, 14=1}
Probabilistic random walk after 173265 steps, saw 112710 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :3
Running SMT prover for 16 properties.
[2024-05-24 06:44:29] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-24 06:44:29] [INFO ] Invariant cache hit.
[2024-05-24 06:44:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:44:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:44:32] [INFO ] After 2862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-24 06:44:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:44:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:44:34] [INFO ] After 1863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-24 06:44:34] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-24 06:44:36] [INFO ] After 1666ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-05-24 06:44:37] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 3 ms to minimize.
[2024-05-24 06:44:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-24 06:44:38] [INFO ] After 3345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 988 ms.
[2024-05-24 06:44:39] [INFO ] After 6653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 256 ms.
Support contains 19 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 706 transition count 1832
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 706 transition count 1832
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 706 transition count 1830
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 704 transition count 1826
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 704 transition count 1826
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 702 transition count 1820
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 702 transition count 1820
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 700 transition count 1814
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 700 transition count 1814
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 698 transition count 1810
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 698 transition count 1810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 696 transition count 1806
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 696 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 694 transition count 1802
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 694 transition count 1802
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 692 transition count 1798
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 692 transition count 1798
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 689 transition count 1788
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 689 transition count 1788
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 687 transition count 1780
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 687 transition count 1780
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 685 transition count 1776
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 685 transition count 1776
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 683 transition count 1772
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 683 transition count 1772
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 681 transition count 1768
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 681 transition count 1768
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 679 transition count 1764
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 679 transition count 1764
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 677 transition count 1760
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 677 transition count 1760
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 677 transition count 1744
Applied a total of 82 rules in 650 ms. Remains 677 /709 variables (removed 32) and now considering 1744/1838 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 677/709 places, 1744/1838 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 178979 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178979 steps, saw 116188 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 16 properties.
[2024-05-24 06:44:43] [INFO ] Flow matrix only has 1175 transitions (discarded 569 similar events)
// Phase 1: matrix 1175 rows 677 cols
[2024-05-24 06:44:43] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 06:44:43] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:44:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:44:45] [INFO ] After 2672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-24 06:44:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:44:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:44:47] [INFO ] After 1706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-24 06:44:47] [INFO ] State equation strengthened by 293 read => feed constraints.
[2024-05-24 06:44:49] [INFO ] After 1581ms SMT Verify possible using 293 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-05-24 06:44:51] [INFO ] After 3058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1138 ms.
[2024-05-24 06:44:52] [INFO ] After 6273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 88 ms.
Support contains 19 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1744/1744 transitions.
Applied a total of 0 rules in 87 ms. Remains 677 /677 variables (removed 0) and now considering 1744/1744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 677/677 places, 1744/1744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1744/1744 transitions.
Applied a total of 0 rules in 89 ms. Remains 677 /677 variables (removed 0) and now considering 1744/1744 (removed 0) transitions.
[2024-05-24 06:44:52] [INFO ] Flow matrix only has 1175 transitions (discarded 569 similar events)
[2024-05-24 06:44:52] [INFO ] Invariant cache hit.
[2024-05-24 06:44:52] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-24 06:44:52] [INFO ] Flow matrix only has 1175 transitions (discarded 569 similar events)
[2024-05-24 06:44:52] [INFO ] Invariant cache hit.
[2024-05-24 06:44:53] [INFO ] State equation strengthened by 293 read => feed constraints.
[2024-05-24 06:44:54] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2024-05-24 06:44:54] [INFO ] Redundant transitions in 105 ms returned []
[2024-05-24 06:44:54] [INFO ] Flow matrix only has 1175 transitions (discarded 569 similar events)
[2024-05-24 06:44:54] [INFO ] Invariant cache hit.
[2024-05-24 06:44:54] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2604 ms. Remains : 677/677 places, 1744/1744 transitions.
Graph (trivial) has 1013 edges and 677 vertex of which 186 / 677 are part of one of the 62 SCC in 4 ms
Free SCC test removed 124 places
Drop transitions removed 310 transitions
Ensure Unique test removed 445 transitions
Reduce isomorphic transitions removed 755 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 553 transition count 974
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 538 transition count 974
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 31 place count 538 transition count 886
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 207 place count 450 transition count 886
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 268 place count 389 transition count 825
Iterating global reduction 2 with 61 rules applied. Total rules applied 329 place count 389 transition count 825
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 451 place count 389 transition count 703
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 719 place count 255 transition count 569
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 781 place count 193 transition count 445
Iterating global reduction 3 with 62 rules applied. Total rules applied 843 place count 193 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 844 place count 193 transition count 444
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 905 place count 132 transition count 322
Iterating global reduction 4 with 61 rules applied. Total rules applied 966 place count 132 transition count 322
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 1027 place count 71 transition count 200
Iterating global reduction 4 with 61 rules applied. Total rules applied 1088 place count 71 transition count 200
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1149 place count 71 transition count 139
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 1151 place count 70 transition count 138
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1165 place count 63 transition count 141
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 1171 place count 63 transition count 135
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1172 place count 63 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1173 place count 62 transition count 134
Applied a total of 1173 rules in 82 ms. Remains 62 /677 variables (removed 615) and now considering 134/1744 (removed 1610) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 134 rows 62 cols
[2024-05-24 06:44:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:44:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:44:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:44:55] [INFO ] After 114ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:14
[2024-05-24 06:44:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:44:55] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-24 06:44:55] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-24 06:44:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:44:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:44:55] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-24 06:44:55] [INFO ] After 87ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-05-24 06:44:55] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-05-24 06:44:55] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
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' '!(X(X(G((X(p1)||p0)))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1716
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1676
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1626
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 614 transition count 1608
Applied a total of 196 rules in 231 ms. Remains 614 /709 variables (removed 95) and now considering 1608/1838 (removed 230) transitions.
[2024-05-24 06:44:56] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 06:44:56] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 06:44:56] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-24 06:44:56] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:44:56] [INFO ] Invariant cache hit.
[2024-05-24 06:44:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:44:57] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2024-05-24 06:44:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:44:57] [INFO ] Invariant cache hit.
[2024-05-24 06:44:58] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/709 places, 1608/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. Remains : 614/709 places, 1608/1838 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 262 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s0 1) (LT s542 1)), p0:(OR (LT s0 1) (LT s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 566 ms.
Product exploration explored 100000 steps with 0 reset in 537 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 p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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 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 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 238249 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238249 steps, saw 154655 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 06:45:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:45:03] [INFO ] Invariant cache hit.
[2024-05-24 06:45:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:45:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:45:03] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-24 06:45:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:45:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-24 06:45:04] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 06:45:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:45:04] [INFO ] After 280ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 06:45:04] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 1 ms to minimize.
[2024-05-24 06:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-05-24 06:45:05] [INFO ] After 728ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-24 06:45:05] [INFO ] After 1436ms 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 56 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 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 614 transition count 1604
Applied a total of 4 rules in 151 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 193715 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193715 steps, saw 125752 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:45:08] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:45:08] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 06:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:45:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:45:09] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:45:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:45:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:45:09] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:45:09] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:45:10] [INFO ] After 314ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:45:10] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2024-05-24 06:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-05-24 06:45:10] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-24 06:45:10] [INFO ] After 1467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
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.
Applied a total of 0 rules in 74 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 71 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:45:10] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:45:10] [INFO ] Invariant cache hit.
[2024-05-24 06:45:11] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-24 06:45:11] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:45:11] [INFO ] Invariant cache hit.
[2024-05-24 06:45:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:45:12] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
[2024-05-24 06:45:12] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-24 06:45:12] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:45:12] [INFO ] Invariant cache hit.
[2024-05-24 06:45:13] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2471 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 2 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 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 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
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 476 transition count 796
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 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 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 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
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 1119 place count 22 transition count 35
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 1121 place count 21 transition count 34
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 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 46 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-24 06:45:13] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 06:45:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:45:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:45:13] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-24 06:45:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:45:13] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:45:13] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:45:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:45:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:45:13] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:45:13] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:45:13] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 06:45:13] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 11 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 06:45:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 06:45:13] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 06:45:14] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-24 06:45:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:45:14] [INFO ] Invariant cache hit.
[2024-05-24 06:45:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:45:15] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2024-05-24 06:45:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:45:15] [INFO ] Invariant cache hit.
[2024-05-24 06:45:16] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2299 ms. Remains : 614/614 places, 1608/1608 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 332764 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 332764 steps, saw 215996 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:45:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:45:19] [INFO ] Invariant cache hit.
[2024-05-24 06:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:45:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:45:20] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:45:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:45:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:45:20] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:45:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:45:20] [INFO ] After 191ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:45:20] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-24 06:45:21] [INFO ] After 1017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 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 614 transition count 1604
Applied a total of 4 rules in 155 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 322429 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322429 steps, saw 209288 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:45:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:45:24] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 06:45:24] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:45:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:45:24] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:45:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:45:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:45:25] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:45:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:45:25] [INFO ] After 205ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:45:25] [INFO ] After 442ms 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 06:45:25] [INFO ] After 1110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 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.
Applied a total of 0 rules in 71 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 74 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:45:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:45:26] [INFO ] Invariant cache hit.
[2024-05-24 06:45:26] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-24 06:45:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:45:26] [INFO ] Invariant cache hit.
[2024-05-24 06:45:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:45:28] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 1976 ms to find 0 implicit places.
[2024-05-24 06:45:28] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 06:45:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:45:28] [INFO ] Invariant cache hit.
[2024-05-24 06:45:28] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2560 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 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 405 transitions
Reduce isomorphic transitions removed 725 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 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
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 476 transition count 796
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 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
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 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 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 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
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 1119 place count 22 transition count 35
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 1121 place count 21 transition count 34
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 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 28 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-24 06:45:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:45:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:45:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:45:28] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 06:45:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:45:28] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:45:28] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:45:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:45:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:45:28] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:45:28] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:45:28] [INFO ] After 9ms 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 06:45:28] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 411 ms.
Product exploration explored 100000 steps with 1 reset in 501 ms.
Built C files in :
/tmp/ltsmin630363851076850387
[2024-05-24 06:45:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin630363851076850387
Running compilation step : cd /tmp/ltsmin630363851076850387;'/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 2852 ms.
Running link step : cd /tmp/ltsmin630363851076850387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin630363851076850387;'/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/stateBased14847655944427164306.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 LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 17 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 06:45:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 06:45:45] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 06:45:45] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-24 06:45:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:45:45] [INFO ] Invariant cache hit.
[2024-05-24 06:45:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:45:47] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2024-05-24 06:45:47] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:45:47] [INFO ] Invariant cache hit.
[2024-05-24 06:45:47] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2379 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin16627628148555077604
[2024-05-24 06:45:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16627628148555077604
Running compilation step : cd /tmp/ltsmin16627628148555077604;'/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 2764 ms.
Running link step : cd /tmp/ltsmin16627628148555077604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16627628148555077604;'/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/stateBased13747668838040144259.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:46:03] [INFO ] Flatten gal took : 58 ms
[2024-05-24 06:46:03] [INFO ] Flatten gal took : 59 ms
[2024-05-24 06:46:03] [INFO ] Time to serialize gal into /tmp/LTL14087063015327684630.gal : 15 ms
[2024-05-24 06:46:03] [INFO ] Time to serialize properties into /tmp/LTL4390842712966805788.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/LTL14087063015327684630.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10010902047920186284.hoa' '-atoms' '/tmp/LTL4390842712966805788.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/LTL4390842712966805788.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10010902047920186284.hoa
Detected timeout of ITS tools.
[2024-05-24 06:46:18] [INFO ] Flatten gal took : 50 ms
[2024-05-24 06:46:18] [INFO ] Flatten gal took : 46 ms
[2024-05-24 06:46:18] [INFO ] Time to serialize gal into /tmp/LTL10599404080700187811.gal : 7 ms
[2024-05-24 06:46:18] [INFO ] Time to serialize properties into /tmp/LTL1867900134850761970.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10599404080700187811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1867900134850761970.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 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
Detected timeout of ITS tools.
[2024-05-24 06:46:33] [INFO ] Flatten gal took : 45 ms
[2024-05-24 06:46:33] [INFO ] Applying decomposition
[2024-05-24 06:46:33] [INFO ] Flatten gal took : 44 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/graph5507983360262349627.txt' '-o' '/tmp/graph5507983360262349627.bin' '-w' '/tmp/graph5507983360262349627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5507983360262349627.bin' '-l' '-1' '-v' '-w' '/tmp/graph5507983360262349627.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:46:33] [INFO ] Decomposing Gal with order
[2024-05-24 06:46:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:46:33] [INFO ] Removed a total of 2669 redundant transitions.
[2024-05-24 06:46:33] [INFO ] Flatten gal took : 142 ms
[2024-05-24 06:46:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1136 labels/synchronizations in 76 ms.
[2024-05-24 06:46:34] [INFO ] Time to serialize gal into /tmp/LTL13645497889113347768.gal : 13 ms
[2024-05-24 06:46:34] [INFO ] Time to serialize properties into /tmp/LTL16255953710436112670.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/LTL13645497889113347768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16255953710436112670.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 : !((X(X(G(("((i0.u0.s0<1)||(i22.i2.u149.l2051<1))")||(X("((i0.u0.s0<1)||(i22.i2.u149.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i0.u0.s0<1)||(i22.i2.u149.l2051<1))" & X!"((i0.u0.s0<1)||(i22.i2.u149.l2051<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10140033582034896233
[2024-05-24 06:46:49] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10140033582034896233
Running compilation step : cd /tmp/ltsmin10140033582034896233;'/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 2683 ms.
Running link step : cd /tmp/ltsmin10140033582034896233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10140033582034896233;'/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(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 128452 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)||F(p1)))'
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 697 transition count 1812
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 697 transition count 1812
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 697 transition count 1806
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 687 transition count 1786
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 687 transition count 1786
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 678 transition count 1758
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 678 transition count 1758
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 668 transition count 1724
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 668 transition count 1724
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 659 transition count 1702
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 659 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 115 place count 650 transition count 1684
Iterating global reduction 1 with 9 rules applied. Total rules applied 124 place count 650 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 132 place count 642 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 140 place count 642 transition count 1668
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 148 place count 634 transition count 1652
Iterating global reduction 1 with 8 rules applied. Total rules applied 156 place count 634 transition count 1652
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 164 place count 626 transition count 1634
Iterating global reduction 1 with 8 rules applied. Total rules applied 172 place count 626 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 175 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 178 place count 623 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 622 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 621 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 183 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 184 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 185 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 618 transition count 1616
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 192 place count 618 transition count 1612
Applied a total of 192 rules in 486 ms. Remains 618 /709 variables (removed 91) and now considering 1612/1838 (removed 226) transitions.
[2024-05-24 06:47:04] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-24 06:47:04] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 06:47:05] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-24 06:47:05] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:47:05] [INFO ] Invariant cache hit.
[2024-05-24 06:47:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 06:47:06] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
[2024-05-24 06:47:06] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 06:47:06] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:47:06] [INFO ] Invariant cache hit.
[2024-05-24 06:47:07] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/709 places, 1612/1838 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2867 ms. Remains : 618/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s528 1)), p0:(AND (GEQ s0 1) (GEQ s539 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 472 ms.
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-04 finished in 3439 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)))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1750
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1750
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1712
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1712
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 106 place count 654 transition count 1688
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 654 transition count 1688
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 126 place count 644 transition count 1668
Iterating global reduction 1 with 10 rules applied. Total rules applied 136 place count 644 transition count 1668
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 145 place count 635 transition count 1650
Iterating global reduction 1 with 9 rules applied. Total rules applied 154 place count 635 transition count 1650
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 163 place count 626 transition count 1632
Iterating global reduction 1 with 9 rules applied. Total rules applied 172 place count 626 transition count 1632
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 617 transition count 1612
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 617 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 614 transition count 1604
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 614 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 613 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 612 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 611 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Applied a total of 206 rules in 215 ms. Remains 609 /709 variables (removed 100) and now considering 1594/1838 (removed 244) transitions.
[2024-05-24 06:47:07] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
// Phase 1: matrix 1065 rows 609 cols
[2024-05-24 06:47:07] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 06:47:08] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-24 06:47:08] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
[2024-05-24 06:47:08] [INFO ] Invariant cache hit.
[2024-05-24 06:47:08] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:47:10] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 2493 ms to find 0 implicit places.
[2024-05-24 06:47:10] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
[2024-05-24 06:47:10] [INFO ] Invariant cache hit.
[2024-05-24 06:47:10] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 609/709 places, 1594/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3197 ms. Remains : 609/709 places, 1594/1838 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s5 1) (GEQ s525 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-07 finished in 3367 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((F(p0)&&(p1||F(G(p2))))))))'
Support contains 5 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 697 transition count 1814
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 697 transition count 1814
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 697 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 687 transition count 1788
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 678 transition count 1760
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 678 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 668 transition count 1726
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 668 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 660 transition count 1706
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 660 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 652 transition count 1690
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 652 transition count 1690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 644 transition count 1674
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 644 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 144 place count 636 transition count 1658
Iterating global reduction 1 with 8 rules applied. Total rules applied 152 place count 636 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 628 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 625 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 625 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 624 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 624 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 623 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 622 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 621 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 621 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 183 place count 620 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 184 place count 620 transition count 1622
Applied a total of 184 rules in 211 ms. Remains 620 /709 variables (removed 89) and now considering 1622/1838 (removed 216) transitions.
[2024-05-24 06:47:11] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 620 cols
[2024-05-24 06:47:11] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 06:47:11] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-24 06:47:11] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 06:47:11] [INFO ] Invariant cache hit.
[2024-05-24 06:47:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 06:47:13] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
[2024-05-24 06:47:13] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 06:47:13] [INFO ] Invariant cache hit.
[2024-05-24 06:47:13] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 620/709 places, 1622/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2533 ms. Remains : 620/709 places, 1622/1838 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-08 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=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s548 1)), p1:(AND (GEQ s1 1) (GEQ s535 1)), p2:(AND (GEQ s3 1) (GEQ s484 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-08 finished in 2823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 695 transition count 1808
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 695 transition count 1808
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 695 transition count 1802
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 683 transition count 1778
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 683 transition count 1778
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 672 transition count 1744
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 672 transition count 1744
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 92 place count 660 transition count 1704
Iterating global reduction 1 with 12 rules applied. Total rules applied 104 place count 660 transition count 1704
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 650 transition count 1680
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 650 transition count 1680
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 134 place count 640 transition count 1660
Iterating global reduction 1 with 10 rules applied. Total rules applied 144 place count 640 transition count 1660
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 153 place count 631 transition count 1642
Iterating global reduction 1 with 9 rules applied. Total rules applied 162 place count 631 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 622 transition count 1624
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 189 place count 613 transition count 1604
Iterating global reduction 1 with 9 rules applied. Total rules applied 198 place count 613 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 201 place count 610 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 605 transition count 1586
Applied a total of 214 rules in 211 ms. Remains 605 /709 variables (removed 104) and now considering 1586/1838 (removed 252) transitions.
[2024-05-24 06:47:14] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-24 06:47:14] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 06:47:14] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-24 06:47:14] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 06:47:14] [INFO ] Invariant cache hit.
[2024-05-24 06:47:14] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 06:47:15] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
[2024-05-24 06:47:15] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 06:47:15] [INFO ] Invariant cache hit.
[2024-05-24 06:47:16] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/709 places, 1586/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2442 ms. Remains : 605/709 places, 1586/1838 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s452 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 471 ms.
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-09 finished in 2991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p0)&&G(p1))||X(G(p0)))))'
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 684 transition count 1780
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 684 transition count 1780
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 673 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 673 transition count 1746
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 661 transition count 1706
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 661 transition count 1706
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 112 place count 651 transition count 1682
Iterating global reduction 1 with 10 rules applied. Total rules applied 122 place count 651 transition count 1682
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 132 place count 641 transition count 1662
Iterating global reduction 1 with 10 rules applied. Total rules applied 142 place count 641 transition count 1662
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 151 place count 632 transition count 1644
Iterating global reduction 1 with 9 rules applied. Total rules applied 160 place count 632 transition count 1644
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 169 place count 623 transition count 1626
Iterating global reduction 1 with 9 rules applied. Total rules applied 178 place count 623 transition count 1626
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 187 place count 614 transition count 1606
Iterating global reduction 1 with 9 rules applied. Total rules applied 196 place count 614 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 199 place count 611 transition count 1598
Iterating global reduction 1 with 3 rules applied. Total rules applied 202 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 606 transition count 1588
Applied a total of 212 rules in 202 ms. Remains 606 /709 variables (removed 103) and now considering 1588/1838 (removed 250) transitions.
[2024-05-24 06:47:17] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2024-05-24 06:47:17] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 06:47:17] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-24 06:47:17] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-24 06:47:17] [INFO ] Invariant cache hit.
[2024-05-24 06:47:17] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-24 06:47:18] [INFO ] Implicit Places using invariants and state equation in 1519 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2024-05-24 06:47:18] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-24 06:47:18] [INFO ] Invariant cache hit.
[2024-05-24 06:47:19] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 606/709 places, 1588/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2472 ms. Remains : 606/709 places, 1588/1838 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s519 1)), p0:(AND (GEQ s0 1) (GEQ s219 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-10 finished in 2694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1750
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1750
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1712
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1672
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1640
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 620 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 620 transition count 1620
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 188 place count 620 transition count 1616
Applied a total of 188 rules in 305 ms. Remains 620 /709 variables (removed 89) and now considering 1616/1838 (removed 222) transitions.
[2024-05-24 06:47:19] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
// Phase 1: matrix 1079 rows 620 cols
[2024-05-24 06:47:19] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 06:47:20] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-24 06:47:20] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:20] [INFO ] Invariant cache hit.
[2024-05-24 06:47:20] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 06:47:21] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2024-05-24 06:47:21] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 06:47:21] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:21] [INFO ] Invariant cache hit.
[2024-05-24 06:47:22] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 620/709 places, 1616/1838 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2692 ms. Remains : 620/709 places, 1616/1838 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-11 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 s553 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 25 reset in 481 ms.
Product exploration explored 100000 steps with 14 reset in 483 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 66 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 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 507085 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 507085 steps, saw 329130 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:47:26] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:26] [INFO ] Invariant cache hit.
[2024-05-24 06:47:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:47:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:47:26] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:47:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:47:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:47:27] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:47:27] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 06:47:27] [INFO ] After 167ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:47:27] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-24 06:47:27] [INFO ] After 777ms 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 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2701 edges and 620 vertex of which 428 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 428 transition count 1232
Applied a total of 385 rules in 46 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 428/620 places, 1232/1616 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
Finished Best-First random walk after 1963 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=981 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 78 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-24 06:47:28] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:28] [INFO ] Invariant cache hit.
[2024-05-24 06:47:28] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-24 06:47:28] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:28] [INFO ] Invariant cache hit.
[2024-05-24 06:47:28] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 06:47:29] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
[2024-05-24 06:47:29] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 06:47:29] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:29] [INFO ] Invariant cache hit.
[2024-05-24 06:47:30] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2426 ms. Remains : 620/620 places, 1616/1616 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 80 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7530 steps, including 2 resets, run visited all 1 properties in 21 ms. (steps per millisecond=358 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 51 reset in 451 ms.
Product exploration explored 100000 steps with 9 reset in 488 ms.
Built C files in :
/tmp/ltsmin4104706289292948497
[2024-05-24 06:47:31] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:47:31] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4104706289292948497
Running compilation step : cd /tmp/ltsmin4104706289292948497;'/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 2793 ms.
Running link step : cd /tmp/ltsmin4104706289292948497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4104706289292948497;'/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/stateBased10955042597430062440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 87 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-24 06:47:47] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:47] [INFO ] Invariant cache hit.
[2024-05-24 06:47:47] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-24 06:47:47] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:47] [INFO ] Invariant cache hit.
[2024-05-24 06:47:47] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 06:47:48] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2024-05-24 06:47:48] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 06:47:49] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-24 06:47:49] [INFO ] Invariant cache hit.
[2024-05-24 06:47:49] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2515 ms. Remains : 620/620 places, 1616/1616 transitions.
Built C files in :
/tmp/ltsmin6887569199153705367
[2024-05-24 06:47:49] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:47:49] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6887569199153705367
Running compilation step : cd /tmp/ltsmin6887569199153705367;'/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 2724 ms.
Running link step : cd /tmp/ltsmin6887569199153705367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6887569199153705367;'/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/stateBased2729003510273652757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:48:04] [INFO ] Flatten gal took : 40 ms
[2024-05-24 06:48:04] [INFO ] Flatten gal took : 39 ms
[2024-05-24 06:48:04] [INFO ] Time to serialize gal into /tmp/LTL13054533015557068157.gal : 6 ms
[2024-05-24 06:48:04] [INFO ] Time to serialize properties into /tmp/LTL17397747371256978208.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/LTL13054533015557068157.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2373890857015528697.hoa' '-atoms' '/tmp/LTL17397747371256978208.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/LTL17397747371256978208.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2373890857015528697.hoa
Detected timeout of ITS tools.
[2024-05-24 06:48:19] [INFO ] Flatten gal took : 41 ms
[2024-05-24 06:48:19] [INFO ] Flatten gal took : 37 ms
[2024-05-24 06:48:19] [INFO ] Time to serialize gal into /tmp/LTL13359586900351038187.gal : 6 ms
[2024-05-24 06:48:19] [INFO ] Time to serialize properties into /tmp/LTL4326209397210718982.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/LTL13359586900351038187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4326209397210718982.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)||(p2439<1))"))))
Formula 0 simplified : FG!"((s1<1)||(p2439<1))"
Detected timeout of ITS tools.
[2024-05-24 06:48:34] [INFO ] Flatten gal took : 39 ms
[2024-05-24 06:48:34] [INFO ] Applying decomposition
[2024-05-24 06:48:34] [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/graph3482872925769222750.txt' '-o' '/tmp/graph3482872925769222750.bin' '-w' '/tmp/graph3482872925769222750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3482872925769222750.bin' '-l' '-1' '-v' '-w' '/tmp/graph3482872925769222750.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:48:35] [INFO ] Decomposing Gal with order
[2024-05-24 06:48:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:48:35] [INFO ] Removed a total of 2696 redundant transitions.
[2024-05-24 06:48:35] [INFO ] Flatten gal took : 95 ms
[2024-05-24 06:48:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1123 labels/synchronizations in 46 ms.
[2024-05-24 06:48:35] [INFO ] Time to serialize gal into /tmp/LTL10140781052532334717.gal : 8 ms
[2024-05-24 06:48:35] [INFO ] Time to serialize properties into /tmp/LTL14239841071483793410.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/LTL10140781052532334717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14239841071483793410.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("((i22.i0.u1.s1<1)||(i25.i2.u162.p2439<1))"))))
Formula 0 simplified : FG!"((i22.i0.u1.s1<1)||(i25.i2.u162.p2439<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17351527429601046968
[2024-05-24 06:48:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17351527429601046968
Running compilation step : cd /tmp/ltsmin17351527429601046968;'/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 2800 ms.
Running link step : cd /tmp/ltsmin17351527429601046968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17351527429601046968;'/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-c016-LTLFireability-11 finished in 105798 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((G(p0)||p1))))))'
Support contains 3 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 685 transition count 1784
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 685 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 675 transition count 1752
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 665 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 665 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 642 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 642 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 145 place count 635 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 152 place count 635 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 627 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 170 place count 625 transition count 1632
Iterating global reduction 1 with 2 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 174 place count 623 transition count 1628
Iterating global reduction 1 with 2 rules applied. Total rules applied 176 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 178 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 186 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 221 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-24 06:49:05] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 06:49:05] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 06:49:05] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-24 06:49:05] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:49:05] [INFO ] Invariant cache hit.
[2024-05-24 06:49:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:07] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1832 ms to find 0 implicit places.
[2024-05-24 06:49:07] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:49:07] [INFO ] Invariant cache hit.
[2024-05-24 06:49:07] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2567 ms. Remains : 615/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s375 1)), p1:(OR (LT s0 1) (LT 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 33195 reset in 660 ms.
Product exploration explored 100000 steps with 33255 reset in 664 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 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) 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 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 250145 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250145 steps, saw 162376 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:49:12] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:49:12] [INFO ] Invariant cache hit.
[2024-05-24 06:49:12] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:49:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:49:13] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:49:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:49:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:49:14] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:14] [INFO ] After 258ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:14] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-05-24 06:49:14] [INFO ] After 1352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 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 615 transition count 1608
Applied a total of 4 rules in 143 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) 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
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 289647 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289647 steps, saw 188010 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:49:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-24 06:49:17] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 06:49:18] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:49:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:49:18] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:49:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:49:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:49:19] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:19] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:19] [INFO ] After 395ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:19] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2024-05-24 06:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-24 06:49:20] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 197 ms.
[2024-05-24 06:49:20] [INFO ] After 1755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 73 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 70 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 06:49:20] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:49:20] [INFO ] Invariant cache hit.
[2024-05-24 06:49:20] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-24 06:49:20] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:49:20] [INFO ] Invariant cache hit.
[2024-05-24 06:49:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:22] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
[2024-05-24 06:49:22] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 06:49:22] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:49:22] [INFO ] Invariant cache hit.
[2024-05-24 06:49:22] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2575 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 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 409 transitions
Reduce isomorphic transitions removed 724 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 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
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 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 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 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
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 1119 place count 24 transition count 41
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 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 30 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-24 06:49:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:49:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:49:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:49:22] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-24 06:49:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:49:22] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:49:22] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:49:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:49:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:49:22] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:23] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:23] [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 06:49:23] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 19 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 06:49:23] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 06:49:23] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 06:49:23] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-24 06:49:23] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:49:23] [INFO ] Invariant cache hit.
[2024-05-24 06:49:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:25] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2024-05-24 06:49:25] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:49:25] [INFO ] Invariant cache hit.
[2024-05-24 06:49:25] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2479 ms. Remains : 615/615 places, 1612/1612 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 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) 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 11 ms. (steps per millisecond=909 ) 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
Interrupted probabilistic random walk after 252383 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252383 steps, saw 163829 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:49:29] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:49:29] [INFO ] Invariant cache hit.
[2024-05-24 06:49:29] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:49:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:49:29] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:49:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:49:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:49:30] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:30] [INFO ] After 255ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:30] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-24 06:49:31] [INFO ] After 1344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 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 615 transition count 1608
Applied a total of 4 rules in 139 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) 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 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 237940 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237940 steps, saw 154453 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:49:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-24 06:49:34] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 06:49:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:49:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:49:34] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:49:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:49:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:49:35] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:35] [INFO ] After 386ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:36] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 0 ms to minimize.
[2024-05-24 06:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2024-05-24 06:49:36] [INFO ] After 914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 199 ms.
[2024-05-24 06:49:36] [INFO ] After 1764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 71 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 70 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 06:49:36] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:49:36] [INFO ] Invariant cache hit.
[2024-05-24 06:49:37] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-24 06:49:37] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:49:37] [INFO ] Invariant cache hit.
[2024-05-24 06:49:37] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:38] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
[2024-05-24 06:49:38] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 06:49:38] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:49:38] [INFO ] Invariant cache hit.
[2024-05-24 06:49:39] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2509 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 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 409 transitions
Reduce isomorphic transitions removed 724 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 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 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 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
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 1119 place count 24 transition count 41
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 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 28 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-24 06:49:39] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 06:49:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:49:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:49:39] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-24 06:49:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:49:39] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:49:39] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:49:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:49:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:49:39] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:39] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:49:39] [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 6 ms.
[2024-05-24 06:49:39] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33428 reset in 654 ms.
Product exploration explored 100000 steps with 33167 reset in 664 ms.
Built C files in :
/tmp/ltsmin8634032005313826144
[2024-05-24 06:49:41] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8634032005313826144
Running compilation step : cd /tmp/ltsmin8634032005313826144;'/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 2765 ms.
Running link step : cd /tmp/ltsmin8634032005313826144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8634032005313826144;'/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/stateBased8208401414120729059.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 11 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 06:49:56] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 06:49:56] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 06:49:56] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-24 06:49:56] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:49:56] [INFO ] Invariant cache hit.
[2024-05-24 06:49:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:49:58] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
[2024-05-24 06:49:58] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:49:58] [INFO ] Invariant cache hit.
[2024-05-24 06:49:58] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2215 ms. Remains : 615/615 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin1798343293328495431
[2024-05-24 06:49:58] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1798343293328495431
Running compilation step : cd /tmp/ltsmin1798343293328495431;'/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 2717 ms.
Running link step : cd /tmp/ltsmin1798343293328495431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1798343293328495431;'/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/stateBased3414723462526778328.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:50:13] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:50:13] [INFO ] Flatten gal took : 32 ms
[2024-05-24 06:50:13] [INFO ] Time to serialize gal into /tmp/LTL14040152730805671698.gal : 8 ms
[2024-05-24 06:50:13] [INFO ] Time to serialize properties into /tmp/LTL12801162965618079104.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/LTL14040152730805671698.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16039622512003443808.hoa' '-atoms' '/tmp/LTL12801162965618079104.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/LTL12801162965618079104.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16039622512003443808.hoa
Detected timeout of ITS tools.
[2024-05-24 06:50:28] [INFO ] Flatten gal took : 32 ms
[2024-05-24 06:50:28] [INFO ] Flatten gal took : 34 ms
[2024-05-24 06:50:28] [INFO ] Time to serialize gal into /tmp/LTL6366767580107048643.gal : 10 ms
[2024-05-24 06:50:28] [INFO ] Time to serialize properties into /tmp/LTL10954643448180641377.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/LTL6366767580107048643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10954643448180641377.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((X(("((s0<1)||(l2128<1))")||(G("((s0<1)||(l753<1))"))))&&("((s0<1)||(l753<1))")))))
Formula 0 simplified : FG(!"((s0<1)||(l753<1))" | X(!"((s0<1)||(l2128<1))" & F!"((s0<1)||(l753<1))"))
Detected timeout of ITS tools.
[2024-05-24 06:50:43] [INFO ] Flatten gal took : 35 ms
[2024-05-24 06:50:43] [INFO ] Applying decomposition
[2024-05-24 06:50:44] [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/graph5970509190663696393.txt' '-o' '/tmp/graph5970509190663696393.bin' '-w' '/tmp/graph5970509190663696393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5970509190663696393.bin' '-l' '-1' '-v' '-w' '/tmp/graph5970509190663696393.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:50:44] [INFO ] Decomposing Gal with order
[2024-05-24 06:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:50:44] [INFO ] Removed a total of 2685 redundant transitions.
[2024-05-24 06:50:44] [INFO ] Flatten gal took : 95 ms
[2024-05-24 06:50:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 1194 labels/synchronizations in 33 ms.
[2024-05-24 06:50:44] [INFO ] Time to serialize gal into /tmp/LTL12003215546613465450.gal : 8 ms
[2024-05-24 06:50:44] [INFO ] Time to serialize properties into /tmp/LTL658808826058851962.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/LTL12003215546613465450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL658808826058851962.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((X(("((i1.u1.s0<1)||(i26.i2.u155.l2128<1))")||(G("((i1.u1.s0<1)||(i7.u102.l753<1))"))))&&("((i1.u1.s0<1)||(i7.u102.l753<1))")))...157
Formula 0 simplified : FG(!"((i1.u1.s0<1)||(i7.u102.l753<1))" | X(!"((i1.u1.s0<1)||(i26.i2.u155.l2128<1))" & F!"((i1.u1.s0<1)||(i7.u102.l753<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7556112508591476650
[2024-05-24 06:50:59] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7556112508591476650
Running compilation step : cd /tmp/ltsmin7556112508591476650;'/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 2690 ms.
Running link step : cd /tmp/ltsmin7556112508591476650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7556112508591476650;'/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))||(LTLAPp0==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 129086 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))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 684 transition count 1782
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 684 transition count 1782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 673 transition count 1748
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 673 transition count 1748
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 88 place count 661 transition count 1708
Iterating global reduction 1 with 12 rules applied. Total rules applied 100 place count 661 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 110 place count 651 transition count 1684
Iterating global reduction 1 with 10 rules applied. Total rules applied 120 place count 651 transition count 1684
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 130 place count 641 transition count 1664
Iterating global reduction 1 with 10 rules applied. Total rules applied 140 place count 641 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 148 place count 633 transition count 1648
Iterating global reduction 1 with 8 rules applied. Total rules applied 156 place count 633 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 164 place count 625 transition count 1632
Iterating global reduction 1 with 8 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 180 place count 617 transition count 1616
Iterating global reduction 1 with 8 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 151 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-24 06:51:14] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 06:51:14] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 06:51:14] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-24 06:51:14] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:51:14] [INFO ] Invariant cache hit.
[2024-05-24 06:51:15] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:51:16] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
[2024-05-24 06:51:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:51:16] [INFO ] Invariant cache hit.
[2024-05-24 06:51:16] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2446 ms. Remains : 615/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s537 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 637 ms.
Product exploration explored 100000 steps with 33333 reset in 648 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLFireability-13 finished in 3894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X((p2&&X(p3))))))'
Support contains 6 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 698 transition count 1814
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 698 transition count 1814
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 698 transition count 1810
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 689 transition count 1792
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 689 transition count 1792
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 680 transition count 1766
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 680 transition count 1766
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 670 transition count 1734
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 670 transition count 1734
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 90 place count 662 transition count 1714
Iterating global reduction 1 with 8 rules applied. Total rules applied 98 place count 662 transition count 1714
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 654 transition count 1698
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 654 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 647 transition count 1684
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 647 transition count 1684
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 640 transition count 1670
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 640 transition count 1670
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 149 place count 633 transition count 1654
Iterating global reduction 1 with 7 rules applied. Total rules applied 156 place count 633 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 159 place count 630 transition count 1646
Iterating global reduction 1 with 3 rules applied. Total rules applied 162 place count 630 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 629 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 629 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 628 transition count 1642
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 628 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 627 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 626 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 626 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 625 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 625 transition count 1636
Applied a total of 172 rules in 206 ms. Remains 625 /709 variables (removed 84) and now considering 1636/1838 (removed 202) transitions.
[2024-05-24 06:51:18] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 625 cols
[2024-05-24 06:51:18] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 06:51:18] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-24 06:51:18] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 06:51:18] [INFO ] Invariant cache hit.
[2024-05-24 06:51:19] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-24 06:51:20] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2024-05-24 06:51:20] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 06:51:20] [INFO ] Invariant cache hit.
[2024-05-24 06:51:20] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/709 places, 1636/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2565 ms. Remains : 625/709 places, 1636/1838 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p3), acceptance={} source=5 dest: 2}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s596 1)), p0:(OR (LT s1 1) (LT s552 1)), p2:(OR (LT s1 1) (LT s525 1)), p3:(OR (LT s0 1) (LT s553 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 552 ms.
Product exploration explored 100000 steps with 3 reset in 593 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 p1 p0 p2 p3), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p1 p2))), true, (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 286811 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286811 steps, saw 186173 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:51:25] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 06:51:25] [INFO ] Invariant cache hit.
[2024-05-24 06:51:25] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:51:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:51:26] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:51:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2024-05-24 06:51:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:51:26] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:51:26] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-24 06:51:27] [INFO ] After 472ms SMT Verify possible using 270 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:51:27] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 0 ms to minimize.
[2024-05-24 06:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-05-24 06:51:28] [INFO ] After 1206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 521 ms.
[2024-05-24 06:51:28] [INFO ] After 2474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 625/625 places, 1636/1636 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 623 transition count 1632
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 623 transition count 1632
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 621 transition count 1626
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 620 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 620 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 614 transition count 1604
Applied a total of 28 rules in 250 ms. Remains 614 /625 variables (removed 11) and now considering 1604/1636 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 614/625 places, 1604/1636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) 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 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
Interrupted probabilistic random walk after 297596 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 297596 steps, saw 193170 distinct states, run finished after 3003 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:51:32] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:51:32] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 06:51:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:51:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:51:32] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:51:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:51:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:51:33] [INFO ] After 698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:51:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:51:33] [INFO ] After 540ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:51:34] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 266 ms.
[2024-05-24 06:51:34] [INFO ] After 2041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 68 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 68 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:51:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:51:34] [INFO ] Invariant cache hit.
[2024-05-24 06:51:34] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-24 06:51:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:51:34] [INFO ] Invariant cache hit.
[2024-05-24 06:51:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:51:36] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2024-05-24 06:51:36] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 06:51:36] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:51:36] [INFO ] Invariant cache hit.
[2024-05-24 06:51:36] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2296 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 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 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 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
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 476 transition count 796
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 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
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 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
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 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 1114 place count 24 transition count 44
Applied a total of 1114 rules in 27 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-24 06:51:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 06:51:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:51:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:51:37] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-24 06:51:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:51:37] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:51:37] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:51:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:51:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:51:37] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:51:37] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:51:37] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 06:51:37] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0 p2 p3), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p1 p2))), true, (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Support contains 4 out of 625 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 625/625 places, 1636/1636 transitions.
Applied a total of 0 rules in 14 ms. Remains 625 /625 variables (removed 0) and now considering 1636/1636 (removed 0) transitions.
[2024-05-24 06:51:37] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 625 cols
[2024-05-24 06:51:37] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 06:51:37] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-24 06:51:37] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 06:51:37] [INFO ] Invariant cache hit.
[2024-05-24 06:51:38] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-24 06:51:39] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
[2024-05-24 06:51:39] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 06:51:39] [INFO ] Invariant cache hit.
[2024-05-24 06:51:40] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2437 ms. Remains : 625/625 places, 1636/1636 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 p3), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Finished random walk after 150 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p3), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p3))), (F (OR (NOT p1) (NOT p3)))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 436 ms.
Product exploration explored 100000 steps with 1 reset in 469 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Support contains 4 out of 625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 625/625 places, 1636/1636 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 623 transition count 1632
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 623 transition count 1632
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 621 transition count 1626
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 620 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 620 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 614 transition count 1604
Applied a total of 28 rules in 410 ms. Remains 614 /625 variables (removed 11) and now considering 1604/1636 (removed 32) transitions.
[2024-05-24 06:51:42] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 06:51:42] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:51:42] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 06:51:43] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/625 places, 1604/1636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 902 ms. Remains : 614/625 places, 1604/1636 transitions.
Built C files in :
/tmp/ltsmin4552246982380168633
[2024-05-24 06:51:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4552246982380168633
Running compilation step : cd /tmp/ltsmin4552246982380168633;'/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 2801 ms.
Running link step : cd /tmp/ltsmin4552246982380168633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4552246982380168633;'/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/stateBased9746277180431574840.hoa' '--buchi-type=spotba'
LTSmin run took 4283 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c016-LTLFireability-15 finished in 31895 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(G((X(p1)||p0)))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLFireability-02
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1716
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1676
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1626
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 614 transition count 1608
Applied a total of 196 rules in 463 ms. Remains 614 /709 variables (removed 95) and now considering 1608/1838 (removed 230) transitions.
[2024-05-24 06:51:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 06:51:51] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 06:51:51] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-24 06:51:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:51:51] [INFO ] Invariant cache hit.
[2024-05-24 06:51:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:51:52] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
[2024-05-24 06:51:52] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:51:52] [INFO ] Invariant cache hit.
[2024-05-24 06:51:53] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 614/709 places, 1608/1838 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2792 ms. Remains : 614/709 places, 1608/1838 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s0 1) (LT s542 1)), p0:(OR (LT s0 1) (LT s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 486 ms.
Product exploration explored 100000 steps with 2 reset in 534 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 p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (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 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 227119 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227119 steps, saw 147431 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 06:51:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:51:57] [INFO ] Invariant cache hit.
[2024-05-24 06:51:57] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:51:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:51:58] [INFO ] After 625ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-24 06:51:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:51:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:51:58] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 06:51:59] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:51:59] [INFO ] After 290ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 06:51:59] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 1 ms to minimize.
[2024-05-24 06:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-05-24 06:51:59] [INFO ] After 760ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-24 06:51:59] [INFO ] After 1486ms 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 26 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 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 614 transition count 1604
Applied a total of 4 rules in 138 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 281084 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281084 steps, saw 182456 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:52:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:52:03] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 06:52:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:52:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:52:03] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:52:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:52:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:52:04] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:52:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:52:04] [INFO ] After 317ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:52:04] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2024-05-24 06:52:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-05-24 06:52:05] [INFO ] After 753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-05-24 06:52:05] [INFO ] After 1488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 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.
Applied a total of 0 rules in 69 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:52:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:52:05] [INFO ] Invariant cache hit.
[2024-05-24 06:52:05] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-24 06:52:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:52:05] [INFO ] Invariant cache hit.
[2024-05-24 06:52:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:52:08] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 2579 ms to find 0 implicit places.
[2024-05-24 06:52:08] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 06:52:08] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:52:08] [INFO ] Invariant cache hit.
[2024-05-24 06:52:08] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3177 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 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 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 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
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 476 transition count 796
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 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 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 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
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 1119 place count 22 transition count 35
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 1121 place count 21 transition count 34
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 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 28 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-24 06:52:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:52:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:52:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:52:08] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-24 06:52:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:52:08] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:52:08] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:52:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:52:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:52:08] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:52:08] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:52:08] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 06:52:08] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 18 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 06:52:09] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 06:52:09] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 06:52:09] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-24 06:52:09] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:52:09] [INFO ] Invariant cache hit.
[2024-05-24 06:52:09] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:52:11] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
[2024-05-24 06:52:11] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:52:11] [INFO ] Invariant cache hit.
[2024-05-24 06:52:11] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2426 ms. Remains : 614/614 places, 1608/1608 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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 12 ms. (steps per millisecond=833 ) 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
Interrupted probabilistic random walk after 256866 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256866 steps, saw 166737 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:52:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:52:14] [INFO ] Invariant cache hit.
[2024-05-24 06:52:15] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:52:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:52:15] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:52:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:52:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:52:16] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:52:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:52:16] [INFO ] After 200ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:52:16] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-05-24 06:52:16] [INFO ] After 1077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 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 614 transition count 1604
Applied a total of 4 rules in 145 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
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 293670 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293670 steps, saw 190622 distinct states, run finished after 3003 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:52:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:52:19] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 06:52:19] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:52:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:52:20] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:52:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:52:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:52:20] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:52:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:52:21] [INFO ] After 211ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:52:21] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 186 ms.
[2024-05-24 06:52:21] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 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.
Applied a total of 0 rules in 71 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:52:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:52:21] [INFO ] Invariant cache hit.
[2024-05-24 06:52:21] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-24 06:52:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:52:21] [INFO ] Invariant cache hit.
[2024-05-24 06:52:22] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:52:23] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2024-05-24 06:52:23] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 06:52:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:52:23] [INFO ] Invariant cache hit.
[2024-05-24 06:52:23] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2362 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 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 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 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
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 476 transition count 796
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 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
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 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 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 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
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 1119 place count 22 transition count 35
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 1121 place count 21 transition count 34
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 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 28 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-24 06:52:23] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 06:52:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:52:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:52:23] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 06:52:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:52:23] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:52:23] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:52:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:52:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:52:24] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:52:24] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:52:24] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 06:52:24] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 411 ms.
Product exploration explored 100000 steps with 0 reset in 554 ms.
Built C files in :
/tmp/ltsmin7762927708110873751
[2024-05-24 06:52:25] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7762927708110873751
Running compilation step : cd /tmp/ltsmin7762927708110873751;'/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 2717 ms.
Running link step : cd /tmp/ltsmin7762927708110873751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7762927708110873751;'/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/stateBased16344362364623793780.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 LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 18 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 06:52:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 06:52:40] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 06:52:41] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-24 06:52:41] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:52:41] [INFO ] Invariant cache hit.
[2024-05-24 06:52:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:52:42] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2024-05-24 06:52:42] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:52:42] [INFO ] Invariant cache hit.
[2024-05-24 06:52:43] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2333 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin5724515428902263284
[2024-05-24 06:52:43] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5724515428902263284
Running compilation step : cd /tmp/ltsmin5724515428902263284;'/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 2707 ms.
Running link step : cd /tmp/ltsmin5724515428902263284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5724515428902263284;'/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/stateBased7535178292532124082.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:52:58] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:52:58] [INFO ] Flatten gal took : 32 ms
[2024-05-24 06:52:58] [INFO ] Time to serialize gal into /tmp/LTL6796105441275447107.gal : 13 ms
[2024-05-24 06:52:58] [INFO ] Time to serialize properties into /tmp/LTL11387509764090596112.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/LTL6796105441275447107.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8327269406945713261.hoa' '-atoms' '/tmp/LTL11387509764090596112.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/LTL11387509764090596112.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8327269406945713261.hoa
Detected timeout of ITS tools.
[2024-05-24 06:53:13] [INFO ] Flatten gal took : 36 ms
[2024-05-24 06:53:13] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:53:13] [INFO ] Time to serialize gal into /tmp/LTL1598206258819079387.gal : 6 ms
[2024-05-24 06:53:13] [INFO ] Time to serialize properties into /tmp/LTL17199791044233324944.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/LTL1598206258819079387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17199791044233324944.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 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
Detected timeout of ITS tools.
[2024-05-24 06:53:28] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:53:28] [INFO ] Applying decomposition
[2024-05-24 06:53:28] [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/graph3222083804656125558.txt' '-o' '/tmp/graph3222083804656125558.bin' '-w' '/tmp/graph3222083804656125558.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3222083804656125558.bin' '-l' '-1' '-v' '-w' '/tmp/graph3222083804656125558.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:53:28] [INFO ] Decomposing Gal with order
[2024-05-24 06:53:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:53:28] [INFO ] Removed a total of 2670 redundant transitions.
[2024-05-24 06:53:28] [INFO ] Flatten gal took : 84 ms
[2024-05-24 06:53:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1159 labels/synchronizations in 33 ms.
[2024-05-24 06:53:28] [INFO ] Time to serialize gal into /tmp/LTL4714259142098089965.gal : 13 ms
[2024-05-24 06:53:28] [INFO ] Time to serialize properties into /tmp/LTL14333790378926166607.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/LTL4714259142098089965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14333790378926166607.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 : !((X(X(G(("((i0.u0.s0<1)||(i28.i3.u153.l2051<1))")||(X("((i0.u0.s0<1)||(i28.i3.u153.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i0.u0.s0<1)||(i28.i3.u153.l2051<1))" & X!"((i0.u0.s0<1)||(i28.i3.u153.l2051<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9165385724463308818
[2024-05-24 06:53:43] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9165385724463308818
Running compilation step : cd /tmp/ltsmin9165385724463308818;'/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 2748 ms.
Running link step : cd /tmp/ltsmin9165385724463308818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9165385724463308818;'/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(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 128714 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((G(p0)||p1))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c016-LTLFireability-12
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 709 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 685 transition count 1784
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 685 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 675 transition count 1752
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 665 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 665 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 642 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 642 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 145 place count 635 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 152 place count 635 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 627 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 170 place count 625 transition count 1632
Iterating global reduction 1 with 2 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 174 place count 623 transition count 1628
Iterating global reduction 1 with 2 rules applied. Total rules applied 176 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 178 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 186 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 245 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-24 06:53:59] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 06:53:59] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 06:53:59] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-24 06:53:59] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:53:59] [INFO ] Invariant cache hit.
[2024-05-24 06:54:00] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:01] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
[2024-05-24 06:54:01] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:54:01] [INFO ] Invariant cache hit.
[2024-05-24 06:54:02] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2755 ms. Remains : 615/709 places, 1612/1838 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s375 1)), p1:(OR (LT s0 1) (LT 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 33345 reset in 652 ms.
Product exploration explored 100000 steps with 33435 reset in 657 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 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 261818 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261818 steps, saw 169951 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:54:06] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:54:06] [INFO ] Invariant cache hit.
[2024-05-24 06:54:06] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:54:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:54:07] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:54:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:54:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:54:07] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:08] [INFO ] After 256ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:08] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 172 ms.
[2024-05-24 06:54:08] [INFO ] After 1369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 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 615 transition count 1608
Applied a total of 4 rules in 141 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 301207 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301207 steps, saw 195515 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:54:11] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-24 06:54:11] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 06:54:11] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:54:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:54:12] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:54:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:54:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:54:12] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:13] [INFO ] After 380ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:13] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2024-05-24 06:54:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-24 06:54:13] [INFO ] After 855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-24 06:54:14] [INFO ] After 1702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 69 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 70 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 06:54:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:54:14] [INFO ] Invariant cache hit.
[2024-05-24 06:54:14] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-24 06:54:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:54:14] [INFO ] Invariant cache hit.
[2024-05-24 06:54:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:15] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2024-05-24 06:54:15] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 06:54:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:54:15] [INFO ] Invariant cache hit.
[2024-05-24 06:54:16] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2321 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 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 409 transitions
Reduce isomorphic transitions removed 724 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 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
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 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 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 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
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 1119 place count 24 transition count 41
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 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 25 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-24 06:54:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:54:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:54:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:54:16] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-24 06:54:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:54:16] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:54:16] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:54:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:54:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:54:16] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:16] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:16] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 06:54:16] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 77 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 16 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 06:54:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 06:54:16] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 06:54:17] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-24 06:54:17] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:54:17] [INFO ] Invariant cache hit.
[2024-05-24 06:54:17] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:18] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2024-05-24 06:54:18] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:54:18] [INFO ] Invariant cache hit.
[2024-05-24 06:54:19] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2570 ms. Remains : 615/615 places, 1612/1612 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 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) 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 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 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 226384 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226384 steps, saw 146953 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:54:22] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:54:22] [INFO ] Invariant cache hit.
[2024-05-24 06:54:22] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:54:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:54:23] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:54:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:54:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:54:24] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:24] [INFO ] After 258ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:24] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-24 06:54:24] [INFO ] After 1386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 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 615 transition count 1608
Applied a total of 4 rules in 137 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 308466 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308466 steps, saw 200226 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:54:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-24 06:54:27] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 06:54:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:54:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:54:28] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:54:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:54:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:54:29] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:29] [INFO ] After 386ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:29] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2024-05-24 06:54:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-05-24 06:54:29] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 194 ms.
[2024-05-24 06:54:30] [INFO ] After 1709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 69 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 78 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-24 06:54:30] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:54:30] [INFO ] Invariant cache hit.
[2024-05-24 06:54:30] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-24 06:54:30] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:54:30] [INFO ] Invariant cache hit.
[2024-05-24 06:54:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:32] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2024-05-24 06:54:32] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 06:54:32] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:54:32] [INFO ] Invariant cache hit.
[2024-05-24 06:54:32] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2353 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 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 409 transitions
Reduce isomorphic transitions removed 724 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 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
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 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 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 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
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 1119 place count 24 transition count 41
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 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 28 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-24 06:54:32] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 06:54:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:54:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:54:32] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-24 06:54:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:54:32] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:54:32] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:54:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:54:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:54:32] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:32] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:54:32] [INFO ] After 21ms 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 06:54:32] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33401 reset in 649 ms.
Product exploration explored 100000 steps with 33419 reset in 667 ms.
Built C files in :
/tmp/ltsmin1298213585989991010
[2024-05-24 06:54:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1298213585989991010
Running compilation step : cd /tmp/ltsmin1298213585989991010;'/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 2780 ms.
Running link step : cd /tmp/ltsmin1298213585989991010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1298213585989991010;'/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/stateBased6775569760027383716.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 20 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 06:54:49] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-24 06:54:49] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 06:54:50] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-24 06:54:50] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:54:50] [INFO ] Invariant cache hit.
[2024-05-24 06:54:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:54:52] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
[2024-05-24 06:54:52] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:54:52] [INFO ] Invariant cache hit.
[2024-05-24 06:54:52] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2895 ms. Remains : 615/615 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin14117722799267451226
[2024-05-24 06:54:52] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14117722799267451226
Running compilation step : cd /tmp/ltsmin14117722799267451226;'/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 2724 ms.
Running link step : cd /tmp/ltsmin14117722799267451226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14117722799267451226;'/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/stateBased1562005305383835531.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:55:07] [INFO ] Flatten gal took : 40 ms
[2024-05-24 06:55:07] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:55:07] [INFO ] Time to serialize gal into /tmp/LTL10893515982189622625.gal : 6 ms
[2024-05-24 06:55:07] [INFO ] Time to serialize properties into /tmp/LTL5368378954307127237.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/LTL10893515982189622625.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4924837545285674310.hoa' '-atoms' '/tmp/LTL5368378954307127237.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/LTL5368378954307127237.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4924837545285674310.hoa
Detected timeout of ITS tools.
[2024-05-24 06:55:22] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:55:22] [INFO ] Flatten gal took : 34 ms
[2024-05-24 06:55:22] [INFO ] Time to serialize gal into /tmp/LTL1467133695360561245.gal : 5 ms
[2024-05-24 06:55:22] [INFO ] Time to serialize properties into /tmp/LTL1311600473297238512.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/LTL1467133695360561245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1311600473297238512.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((s0<1)||(l2128<1))")||(G("((s0<1)||(l753<1))"))))&&("((s0<1)||(l753<1))")))))
Formula 0 simplified : FG(!"((s0<1)||(l753<1))" | X(!"((s0<1)||(l2128<1))" & F!"((s0<1)||(l753<1))"))
Detected timeout of ITS tools.
[2024-05-24 06:55:37] [INFO ] Flatten gal took : 36 ms
[2024-05-24 06:55:37] [INFO ] Applying decomposition
[2024-05-24 06:55:38] [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/graph10546250704335303097.txt' '-o' '/tmp/graph10546250704335303097.bin' '-w' '/tmp/graph10546250704335303097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10546250704335303097.bin' '-l' '-1' '-v' '-w' '/tmp/graph10546250704335303097.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:55:38] [INFO ] Decomposing Gal with order
[2024-05-24 06:55:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:55:38] [INFO ] Removed a total of 2683 redundant transitions.
[2024-05-24 06:55:38] [INFO ] Flatten gal took : 61 ms
[2024-05-24 06:55:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1125 labels/synchronizations in 34 ms.
[2024-05-24 06:55:38] [INFO ] Time to serialize gal into /tmp/LTL18308610837205009249.gal : 9 ms
[2024-05-24 06:55:38] [INFO ] Time to serialize properties into /tmp/LTL5026262629114571816.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/LTL18308610837205009249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5026262629114571816.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((X(("((i0.u0.s0<1)||(i26.i2.u155.l2128<1))")||(G("((i0.u0.s0<1)||(i11.u72.l753<1))"))))&&("((i0.u0.s0<1)||(i11.u72.l753<1))")))...157
Formula 0 simplified : FG(!"((i0.u0.s0<1)||(i11.u72.l753<1))" | X(!"((i0.u0.s0<1)||(i26.i2.u155.l2128<1))" & F!"((i0.u0.s0<1)||(i11.u72.l753<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13862967299487744590
[2024-05-24 06:55:53] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13862967299487744590
Running compilation step : cd /tmp/ltsmin13862967299487744590;'/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 2838 ms.
Running link step : cd /tmp/ltsmin13862967299487744590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13862967299487744590;'/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))||(LTLAPp0==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 129366 ms.
[2024-05-24 06:56:08] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1707651740790159552
[2024-05-24 06:56:08] [INFO ] Too many transitions (1838) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:56:08] [INFO ] Applying decomposition
[2024-05-24 06:56:08] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1707651740790159552
Running compilation step : cd /tmp/ltsmin1707651740790159552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' '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 06:56:08] [INFO ] Flatten gal took : 51 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/graph17448316775584060670.txt' '-o' '/tmp/graph17448316775584060670.bin' '-w' '/tmp/graph17448316775584060670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17448316775584060670.bin' '-l' '-1' '-v' '-w' '/tmp/graph17448316775584060670.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:56:08] [INFO ] Decomposing Gal with order
[2024-05-24 06:56:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:56:08] [INFO ] Removed a total of 3085 redundant transitions.
[2024-05-24 06:56:08] [INFO ] Flatten gal took : 68 ms
[2024-05-24 06:56:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1333 labels/synchronizations in 40 ms.
[2024-05-24 06:56:08] [INFO ] Time to serialize gal into /tmp/LTLFireability11148263230187689236.gal : 9 ms
[2024-05-24 06:56:08] [INFO ] Time to serialize properties into /tmp/LTLFireability8758086116433287248.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/LTLFireability11148263230187689236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8758086116433287248.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 3 LTL properties
Checking formula 0 : !((X(X(G(("((i1.u2.s0<1)||(i29.i3.u170.l2051<1))")||(X("((i1.u2.s0<1)||(i29.i3.u170.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i1.u2.s0<1)||(i29.i3.u170.l2051<1))" & X!"((i1.u2.s0<1)||(i29.i3.u170.l2051<1))")
Compilation finished in 3393 ms.
Running link step : cd /tmp/ltsmin1707651740790159552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1707651740790159552;'/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(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin1707651740790159552;'/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(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1707651740790159552;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 196851 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1707651740790159552;'/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' '[](<>(((LTLAPp3==true)&&X(([]((LTLAPp3==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 07:20:05] [INFO ] Flatten gal took : 142 ms
[2024-05-24 07:20:05] [INFO ] Time to serialize gal into /tmp/LTLFireability3625041785356014934.gal : 23 ms
[2024-05-24 07:20:05] [INFO ] Time to serialize properties into /tmp/LTLFireability6243529413147367817.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/LTLFireability3625041785356014934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6243529413147367817.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...297
Read 2 LTL properties
Checking formula 0 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: LTL layer: formula: [](<>(((LTLAPp3==true)&&X(([]((LTLAPp3==true))||(LTLAPp4==true))))))
pins2lts-mc-linux64( 4/ 8), 0.012: "[](<>(((LTLAPp3==true)&&X(([]((LTLAPp3==true))||(LTLAPp4==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.013: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.298: There are 1844 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.298: State length is 710, there are 1846 groups
pins2lts-mc-linux64( 0/ 8), 0.298: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.298: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.298: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.298: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.441: [Blue] ~120 levels ~960 states ~6232 transitions
pins2lts-mc-linux64( 3/ 8), 0.544: [Blue] ~240 levels ~1920 states ~9736 transitions
pins2lts-mc-linux64( 3/ 8), 0.728: [Blue] ~480 levels ~3840 states ~17416 transitions
pins2lts-mc-linux64( 3/ 8), 1.084: [Blue] ~960 levels ~7680 states ~32776 transitions
pins2lts-mc-linux64( 3/ 8), 1.657: [Blue] ~1920 levels ~15360 states ~63496 transitions
pins2lts-mc-linux64( 3/ 8), 2.787: [Blue] ~3840 levels ~30720 states ~124936 transitions
pins2lts-mc-linux64( 3/ 8), 4.821: [Blue] ~7680 levels ~61440 states ~247816 transitions
pins2lts-mc-linux64( 3/ 8), 8.445: [Blue] ~15360 levels ~122880 states ~493576 transitions
pins2lts-mc-linux64( 3/ 8), 15.164: [Blue] ~30720 levels ~245760 states ~985096 transitions
pins2lts-mc-linux64( 3/ 8), 28.431: [Blue] ~61440 levels ~491520 states ~1968136 transitions
pins2lts-mc-linux64( 3/ 8), 54.999: [Blue] ~122880 levels ~983040 states ~3934216 transitions
pins2lts-mc-linux64( 3/ 8), 107.659: [Blue] ~245760 levels ~1966080 states ~7866376 transitions
pins2lts-mc-linux64( 4/ 8), 154.982: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 155.207:
pins2lts-mc-linux64( 0/ 8), 155.207: Explored 2699684 states 18460868 transitions, fanout: 6.838
pins2lts-mc-linux64( 0/ 8), 155.207: Total exploration time 154.890 sec (154.670 sec minimum, 154.754 sec on average)
pins2lts-mc-linux64( 0/ 8), 155.207: States per second: 17430, Transitions per second: 119187
pins2lts-mc-linux64( 0/ 8), 155.207:
pins2lts-mc-linux64( 0/ 8), 155.207: State space has 18168889 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 155.207: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 155.207: blue states: 2699684 (14.86%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 155.207: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 155.207: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 155.207:
pins2lts-mc-linux64( 0/ 8), 155.207: Total memory used for local state coloring: 41.2MB
pins2lts-mc-linux64( 0/ 8), 155.207:
pins2lts-mc-linux64( 0/ 8), 155.207: Queue width: 8B, total height: 2699684, memory: 20.60MB
pins2lts-mc-linux64( 0/ 8), 155.207: Tree memory: 394.6MB, 22.8 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 155.207: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 155.207: Stored 2287 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 155.207: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 155.207: Est. total memory use: 415.2MB (~1044.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1707651740790159552;'/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' '[](<>(((LTLAPp3==true)&&X(([]((LTLAPp3==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1707651740790159552;'/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' '[](<>(((LTLAPp3==true)&&X(([]((LTLAPp3==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 16251708 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16153096 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-c016"
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-c016, 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-171640625100188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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