Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592600076.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592600076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 516K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678491284289

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 23:34:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 23:34:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:34:46] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-10 23:34:46] [INFO ] Transformed 1211 places.
[2023-03-10 23:34:46] [INFO ] Transformed 1827 transitions.
[2023-03-10 23:34:46] [INFO ] Found NUPN structural information;
[2023-03-10 23:34:46] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
FORMULA ASLink-PT-05a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 1211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1181 transition count 1808
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 1173 transition count 1777
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 1172 transition count 1777
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 1172 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1171 transition count 1767
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 1171 transition count 1767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1170 transition count 1759
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1170 transition count 1759
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1169 transition count 1751
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1169 transition count 1751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1168 transition count 1743
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1168 transition count 1743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1167 transition count 1735
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1167 transition count 1735
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1166 transition count 1727
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1166 transition count 1727
Applied a total of 61 rules in 553 ms. Remains 1166 /1211 variables (removed 45) and now considering 1727/1808 (removed 81) transitions.
// Phase 1: matrix 1727 rows 1166 cols
[2023-03-10 23:34:47] [INFO ] Computed 201 place invariants in 68 ms
[2023-03-10 23:34:48] [INFO ] Implicit Places using invariants in 1297 ms returned [1, 19, 20, 33, 51, 69, 198, 214, 219, 220, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 617, 635, 764, 780, 785, 786, 787, 805, 823, 952, 957, 969, 974, 975, 976, 1006, 1009, 1027, 1028, 1029, 1030, 1047, 1055, 1063, 1069, 1075, 1081, 1087, 1095, 1101, 1107, 1115]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 1332 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1111/1211 places, 1727/1808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1098 transition count 1714
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1098 transition count 1714
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1088 transition count 1704
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1088 transition count 1704
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1083 transition count 1699
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1083 transition count 1699
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1081 transition count 1697
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1081 transition count 1697
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1079 transition count 1695
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1079 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1078 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1078 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1077 transition count 1693
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1077 transition count 1693
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1076 transition count 1692
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1076 transition count 1692
Applied a total of 70 rules in 242 ms. Remains 1076 /1111 variables (removed 35) and now considering 1692/1727 (removed 35) transitions.
// Phase 1: matrix 1692 rows 1076 cols
[2023-03-10 23:34:49] [INFO ] Computed 146 place invariants in 44 ms
[2023-03-10 23:34:49] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-10 23:34:49] [INFO ] Invariant cache hit.
[2023-03-10 23:34:52] [INFO ] Implicit Places using invariants and state equation in 2778 ms returned []
Implicit Place search using SMT with State Equation took 3395 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1076/1211 places, 1692/1808 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5523 ms. Remains : 1076/1211 places, 1692/1808 transitions.
Support contains 57 out of 1076 places after structural reductions.
[2023-03-10 23:34:53] [INFO ] Flatten gal took : 149 ms
[2023-03-10 23:34:53] [INFO ] Flatten gal took : 82 ms
[2023-03-10 23:34:53] [INFO ] Input system was already deterministic with 1692 transitions.
Support contains 55 out of 1076 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Running SMT prover for 20 properties.
[2023-03-10 23:34:54] [INFO ] Invariant cache hit.
[2023-03-10 23:34:54] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-10 23:34:55] [INFO ] [Nat]Absence check using 29 positive place invariants in 15 ms returned sat
[2023-03-10 23:34:55] [INFO ] [Nat]Absence check using 29 positive and 117 generalized place invariants in 72 ms returned sat
[2023-03-10 23:34:58] [INFO ] After 2480ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :7
[2023-03-10 23:34:59] [INFO ] After 3682ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :7
Attempting to minimize the solution found.
Minimization took 629 ms.
[2023-03-10 23:35:00] [INFO ] After 5556ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :7
Fused 20 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 13 out of 1076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1076 transition count 1506
Reduce places removed 186 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 188 rules applied. Total rules applied 374 place count 890 transition count 1504
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 376 place count 888 transition count 1504
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 376 place count 888 transition count 1361
Deduced a syphon composed of 143 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 3 with 331 rules applied. Total rules applied 707 place count 700 transition count 1361
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 16 rules applied. Total rules applied 723 place count 693 transition count 1352
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 732 place count 684 transition count 1352
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 732 place count 684 transition count 1332
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 772 place count 664 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 779 place count 657 transition count 1313
Iterating global reduction 5 with 7 rules applied. Total rules applied 786 place count 657 transition count 1313
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 791 place count 656 transition count 1309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 792 place count 655 transition count 1309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 792 place count 655 transition count 1308
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 794 place count 654 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 795 place count 653 transition count 1300
Iterating global reduction 7 with 1 rules applied. Total rules applied 796 place count 653 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 797 place count 652 transition count 1292
Iterating global reduction 7 with 1 rules applied. Total rules applied 798 place count 652 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 799 place count 651 transition count 1284
Iterating global reduction 7 with 1 rules applied. Total rules applied 800 place count 651 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 801 place count 650 transition count 1276
Iterating global reduction 7 with 1 rules applied. Total rules applied 802 place count 650 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 649 transition count 1268
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 649 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 648 transition count 1260
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 648 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 647 transition count 1252
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 647 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 646 transition count 1244
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 646 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 645 transition count 1236
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 645 transition count 1236
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 908 place count 597 transition count 1188
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 909 place count 596 transition count 1187
Iterating global reduction 7 with 1 rules applied. Total rules applied 910 place count 596 transition count 1187
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 914 place count 596 transition count 1183
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 918 place count 592 transition count 1183
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 940 place count 592 transition count 1161
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 963 place count 569 transition count 1161
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 966 place count 569 transition count 1158
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 984 place count 569 transition count 1158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 985 place count 568 transition count 1157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 990 place count 563 transition count 1157
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 9 Pre rules applied. Total rules applied 990 place count 563 transition count 1148
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 23 rules applied. Total rules applied 1013 place count 549 transition count 1148
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1018 place count 544 transition count 1143
Iterating global reduction 10 with 5 rules applied. Total rules applied 1023 place count 544 transition count 1143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1028 place count 544 transition count 1138
Applied a total of 1028 rules in 561 ms. Remains 544 /1076 variables (removed 532) and now considering 1138/1692 (removed 554) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 562 ms. Remains : 544/1076 places, 1138/1692 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 178680 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 178680 steps, saw 153620 distinct states, run finished after 3005 ms. (steps per millisecond=59 ) properties seen :4
Running SMT prover for 3 properties.
// Phase 1: matrix 1138 rows 544 cols
[2023-03-10 23:35:04] [INFO ] Computed 82 place invariants in 26 ms
[2023-03-10 23:35:04] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-10 23:35:04] [INFO ] [Real]Absence check using 18 positive and 64 generalized place invariants in 16 ms returned sat
[2023-03-10 23:35:05] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 23:35:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-10 23:35:05] [INFO ] [Nat]Absence check using 18 positive and 64 generalized place invariants in 31 ms returned sat
[2023-03-10 23:35:06] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 23:35:06] [INFO ] After 934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-10 23:35:06] [INFO ] After 1249ms 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 21 ms.
Support contains 7 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1138/1138 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 544 transition count 1136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 542 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 540 transition count 1134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 540 transition count 1133
Applied a total of 9 rules in 42 ms. Remains 540 /544 variables (removed 4) and now considering 1133/1138 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 540/544 places, 1133/1138 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 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 35 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 270424 steps, run timeout after 3004 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270424 steps, saw 125099 distinct states, run finished after 3005 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1133 rows 540 cols
[2023-03-10 23:35:09] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-10 23:35:09] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-10 23:35:09] [INFO ] [Real]Absence check using 18 positive and 64 generalized place invariants in 31 ms returned sat
[2023-03-10 23:35:10] [INFO ] After 807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 23:35:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-10 23:35:10] [INFO ] [Nat]Absence check using 18 positive and 64 generalized place invariants in 59 ms returned sat
[2023-03-10 23:35:11] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 23:35:11] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 3 ms to minimize.
[2023-03-10 23:35:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-10 23:35:11] [INFO ] After 1176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-10 23:35:12] [INFO ] After 1569ms 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 53 ms.
Support contains 7 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1133/1133 transitions.
Applied a total of 0 rules in 17 ms. Remains 540 /540 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 540/540 places, 1133/1133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1133/1133 transitions.
Applied a total of 0 rules in 16 ms. Remains 540 /540 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
[2023-03-10 23:35:12] [INFO ] Invariant cache hit.
[2023-03-10 23:35:12] [INFO ] Implicit Places using invariants in 547 ms returned [73, 90, 96, 99, 101, 108, 109, 110, 163, 184, 190, 193, 195, 196, 201, 202, 254, 271, 277, 280, 282, 283, 288, 289, 344, 365, 371, 374, 376, 377, 382, 387, 388, 440, 457, 463, 466, 468, 469, 497]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 549 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/540 places, 1133/1133 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 500 transition count 1128
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 495 transition count 1128
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 479 transition count 1112
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 479 transition count 1112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 474 transition count 1107
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 474 transition count 1107
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 86 place count 457 transition count 1090
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 102 place count 457 transition count 1074
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 118 place count 441 transition count 1074
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 441 transition count 1070
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 437 transition count 1070
Applied a total of 126 rules in 74 ms. Remains 437 /500 variables (removed 63) and now considering 1070/1133 (removed 63) transitions.
// Phase 1: matrix 1070 rows 437 cols
[2023-03-10 23:35:12] [INFO ] Computed 42 place invariants in 6 ms
[2023-03-10 23:35:13] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-10 23:35:13] [INFO ] Invariant cache hit.
[2023-03-10 23:35:14] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 437/540 places, 1070/1133 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2012 ms. Remains : 437/540 places, 1070/1133 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 206935 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206935 steps, saw 140439 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 23:35:17] [INFO ] Invariant cache hit.
[2023-03-10 23:35:17] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-10 23:35:17] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-10 23:35:17] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 23:35:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-10 23:35:18] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-10 23:35:18] [INFO ] After 685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 23:35:19] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-10 23:35:19] [INFO ] After 1237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 68 ms.
Support contains 7 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1070/1070 transitions.
Applied a total of 0 rules in 13 ms. Remains 437 /437 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 437/437 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1070/1070 transitions.
Applied a total of 0 rules in 12 ms. Remains 437 /437 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2023-03-10 23:35:19] [INFO ] Invariant cache hit.
[2023-03-10 23:35:19] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-10 23:35:19] [INFO ] Invariant cache hit.
[2023-03-10 23:35:20] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2023-03-10 23:35:20] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-10 23:35:20] [INFO ] Invariant cache hit.
[2023-03-10 23:35:21] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1820 ms. Remains : 437/437 places, 1070/1070 transitions.
Applied a total of 0 rules in 14 ms. Remains 437 /437 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-10 23:35:21] [INFO ] Invariant cache hit.
[2023-03-10 23:35:21] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-10 23:35:21] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-10 23:35:21] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 23:35:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-10 23:35:21] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 17 ms returned sat
[2023-03-10 23:35:22] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 23:35:22] [INFO ] After 912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-10 23:35:23] [INFO ] After 1245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
FORMULA ASLink-PT-05a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-05a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1073 transition count 1672
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1073 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1072 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1072 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1071 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1071 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1070 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1070 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1069 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1069 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1068 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1068 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1067 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1067 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1066 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1066 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1065 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1065 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1064 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1064 transition count 1600
Applied a total of 24 rules in 286 ms. Remains 1064 /1076 variables (removed 12) and now considering 1600/1692 (removed 92) transitions.
// Phase 1: matrix 1600 rows 1064 cols
[2023-03-10 23:35:23] [INFO ] Computed 146 place invariants in 29 ms
[2023-03-10 23:35:24] [INFO ] Implicit Places using invariants in 653 ms returned [20, 211, 574, 954]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 680 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1076 places, 1600/1692 transitions.
Applied a total of 0 rules in 21 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 987 ms. Remains : 1060/1076 places, 1600/1692 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s625 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 129 steps with 0 reset in 8 ms.
FORMULA ASLink-PT-05a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-02 finished in 1411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 6 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1073 transition count 1672
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1073 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1072 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1072 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1071 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1071 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1070 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1070 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1069 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1069 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1068 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1068 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1067 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1067 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1066 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1066 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1065 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1065 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1064 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1064 transition count 1600
Applied a total of 24 rules in 326 ms. Remains 1064 /1076 variables (removed 12) and now considering 1600/1692 (removed 92) transitions.
[2023-03-10 23:35:25] [INFO ] Invariant cache hit.
[2023-03-10 23:35:25] [INFO ] Implicit Places using invariants in 552 ms returned [20, 211, 574, 954]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 590 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1076 places, 1600/1692 transitions.
Applied a total of 0 rules in 21 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 939 ms. Remains : 1060/1076 places, 1600/1692 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-03 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: 2}]], initial=1, aps=[p1:(AND (EQ s924 1) (EQ s959 1)), p0:(OR (AND (EQ s405 1) (EQ s620 1)) (AND (EQ s43 1) (EQ s258 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-03 finished in 1163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 3 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1074 transition count 1678
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1074 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1073 transition count 1670
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1073 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1072 transition count 1662
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1072 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1071 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1071 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1070 transition count 1646
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1070 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1069 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1069 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1068 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1068 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1067 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1067 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1066 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1066 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1065 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1065 transition count 1606
Applied a total of 22 rules in 333 ms. Remains 1065 /1076 variables (removed 11) and now considering 1606/1692 (removed 86) transitions.
// Phase 1: matrix 1606 rows 1065 cols
[2023-03-10 23:35:26] [INFO ] Computed 146 place invariants in 12 ms
[2023-03-10 23:35:26] [INFO ] Implicit Places using invariants in 644 ms returned [20, 211, 955]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 658 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1062/1076 places, 1606/1692 transitions.
Applied a total of 0 rules in 25 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1016 ms. Remains : 1062/1076 places, 1606/1692 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s573 1) (EQ s728 1)), p1:(NEQ s263 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][false, false, false]]
Product exploration explored 100000 steps with 589 reset in 441 ms.
Product exploration explored 100000 steps with 626 reset in 321 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 685 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 194857 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194857 steps, saw 75698 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1606 rows 1062 cols
[2023-03-10 23:35:32] [INFO ] Computed 143 place invariants in 18 ms
[2023-03-10 23:35:32] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-10 23:35:32] [INFO ] [Real]Absence check using 30 positive and 113 generalized place invariants in 54 ms returned sat
[2023-03-10 23:35:33] [INFO ] After 1174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:35:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2023-03-10 23:35:33] [INFO ] [Nat]Absence check using 30 positive and 113 generalized place invariants in 43 ms returned sat
[2023-03-10 23:35:34] [INFO ] After 985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:35:35] [INFO ] After 1518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 324 ms.
[2023-03-10 23:35:35] [INFO ] After 2251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 87 ms.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1062 transition count 1408
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 864 transition count 1407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 863 transition count 1407
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 398 place count 863 transition count 1266
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 327 rules applied. Total rules applied 725 place count 677 transition count 1266
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 742 place count 669 transition count 1257
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 751 place count 660 transition count 1257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 751 place count 660 transition count 1237
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 791 place count 640 transition count 1237
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 796 place count 635 transition count 1232
Iterating global reduction 5 with 5 rules applied. Total rules applied 801 place count 635 transition count 1232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 805 place count 635 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 806 place count 634 transition count 1228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 806 place count 634 transition count 1227
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 808 place count 633 transition count 1227
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 922 place count 576 transition count 1170
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 926 place count 576 transition count 1166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 930 place count 572 transition count 1166
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 950 place count 572 transition count 1146
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 971 place count 551 transition count 1146
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 974 place count 551 transition count 1143
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 990 place count 551 transition count 1143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 991 place count 550 transition count 1142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 996 place count 545 transition count 1142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 996 place count 545 transition count 1132
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 1021 place count 530 transition count 1132
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1026 place count 525 transition count 1127
Iterating global reduction 10 with 5 rules applied. Total rules applied 1031 place count 525 transition count 1127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1036 place count 525 transition count 1122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1038 place count 524 transition count 1121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1039 place count 524 transition count 1120
Applied a total of 1039 rules in 263 ms. Remains 524 /1062 variables (removed 538) and now considering 1120/1606 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 524/1062 places, 1120/1606 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1120 rows 524 cols
[2023-03-10 23:35:35] [INFO ] Computed 79 place invariants in 21 ms
[2023-03-10 23:35:36] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-10 23:35:36] [INFO ] [Real]Absence check using 14 positive and 65 generalized place invariants in 49 ms returned sat
[2023-03-10 23:35:36] [INFO ] After 733ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:35:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-10 23:35:36] [INFO ] [Nat]Absence check using 14 positive and 65 generalized place invariants in 37 ms returned sat
[2023-03-10 23:35:37] [INFO ] After 570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:35:37] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 1 ms to minimize.
[2023-03-10 23:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-10 23:35:37] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-10 23:35:37] [INFO ] After 1084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1120/1120 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 524 transition count 1119
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 522 transition count 1113
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 522 transition count 1113
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 521 transition count 1113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 520 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 519 transition count 1111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 519 transition count 1111
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 519 transition count 1110
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 518 transition count 1109
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 518 transition count 1109
Applied a total of 13 rules in 99 ms. Remains 518 /524 variables (removed 6) and now considering 1109/1120 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 518/524 places, 1109/1120 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 444321 steps, run timeout after 3002 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 444321 steps, saw 168965 distinct states, run finished after 3002 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1109 rows 518 cols
[2023-03-10 23:35:40] [INFO ] Computed 78 place invariants in 6 ms
[2023-03-10 23:35:41] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-10 23:35:41] [INFO ] [Real]Absence check using 14 positive and 64 generalized place invariants in 23 ms returned sat
[2023-03-10 23:35:41] [INFO ] After 365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 23:35:41] [INFO ] After 441ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-10 23:35:41] [INFO ] After 653ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1109/1109 transitions.
Applied a total of 0 rules in 28 ms. Remains 518 /518 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 518/518 places, 1109/1109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1109/1109 transitions.
Applied a total of 0 rules in 24 ms. Remains 518 /518 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2023-03-10 23:35:41] [INFO ] Invariant cache hit.
[2023-03-10 23:35:42] [INFO ] Implicit Places using invariants in 449 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 176, 182, 185, 187, 188, 193, 194, 246, 263, 269, 272, 274, 275, 280, 281, 282, 335, 356, 362, 365, 367, 368, 373, 374, 426, 443, 449, 452, 454, 455]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 451 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 479/518 places, 1109/1109 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 479 transition count 1104
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 474 transition count 1104
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 458 transition count 1088
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 458 transition count 1088
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 453 transition count 1083
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 453 transition count 1083
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 72 place count 443 transition count 1073
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 87 place count 443 transition count 1058
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 102 place count 428 transition count 1058
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 428 transition count 1054
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 424 transition count 1054
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 424 transition count 1054
Applied a total of 111 rules in 71 ms. Remains 424 /479 variables (removed 55) and now considering 1054/1109 (removed 55) transitions.
// Phase 1: matrix 1054 rows 424 cols
[2023-03-10 23:35:42] [INFO ] Computed 39 place invariants in 12 ms
[2023-03-10 23:35:42] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-10 23:35:42] [INFO ] Invariant cache hit.
[2023-03-10 23:35:43] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 424/518 places, 1054/1109 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1831 ms. Remains : 424/518 places, 1054/1109 transitions.
Incomplete random walk after 10000 steps, including 185 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27188 steps, run visited all 1 properties in 176 ms. (steps per millisecond=154 )
Probabilistic random walk after 27188 steps, saw 19628 distinct states, run finished after 176 ms. (steps per millisecond=154 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 765 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Applied a total of 0 rules in 56 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
// Phase 1: matrix 1606 rows 1062 cols
[2023-03-10 23:35:44] [INFO ] Computed 143 place invariants in 25 ms
[2023-03-10 23:35:45] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-10 23:35:45] [INFO ] Invariant cache hit.
[2023-03-10 23:35:47] [INFO ] Implicit Places using invariants and state equation in 2257 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
[2023-03-10 23:35:47] [INFO ] Invariant cache hit.
[2023-03-10 23:35:48] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3819 ms. Remains : 1062/1062 places, 1606/1606 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 519 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 205260 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205260 steps, saw 78319 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 23:35:52] [INFO ] Invariant cache hit.
[2023-03-10 23:35:52] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-10 23:35:52] [INFO ] [Real]Absence check using 30 positive and 113 generalized place invariants in 33 ms returned sat
[2023-03-10 23:35:53] [INFO ] After 936ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:35:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2023-03-10 23:35:53] [INFO ] [Nat]Absence check using 30 positive and 113 generalized place invariants in 50 ms returned sat
[2023-03-10 23:35:54] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:35:55] [INFO ] After 1511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-10 23:35:55] [INFO ] After 2232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 94 ms.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1062 transition count 1408
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 864 transition count 1407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 863 transition count 1407
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 398 place count 863 transition count 1266
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 327 rules applied. Total rules applied 725 place count 677 transition count 1266
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 742 place count 669 transition count 1257
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 751 place count 660 transition count 1257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 751 place count 660 transition count 1237
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 791 place count 640 transition count 1237
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 796 place count 635 transition count 1232
Iterating global reduction 5 with 5 rules applied. Total rules applied 801 place count 635 transition count 1232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 805 place count 635 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 806 place count 634 transition count 1228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 806 place count 634 transition count 1227
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 808 place count 633 transition count 1227
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 922 place count 576 transition count 1170
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 926 place count 576 transition count 1166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 930 place count 572 transition count 1166
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 950 place count 572 transition count 1146
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 971 place count 551 transition count 1146
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 974 place count 551 transition count 1143
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 990 place count 551 transition count 1143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 991 place count 550 transition count 1142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 996 place count 545 transition count 1142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 996 place count 545 transition count 1132
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 1021 place count 530 transition count 1132
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1026 place count 525 transition count 1127
Iterating global reduction 10 with 5 rules applied. Total rules applied 1031 place count 525 transition count 1127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1036 place count 525 transition count 1122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1038 place count 524 transition count 1121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1039 place count 524 transition count 1120
Applied a total of 1039 rules in 229 ms. Remains 524 /1062 variables (removed 538) and now considering 1120/1606 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 524/1062 places, 1120/1606 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 1120 rows 524 cols
[2023-03-10 23:35:56] [INFO ] Computed 79 place invariants in 8 ms
[2023-03-10 23:35:56] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-10 23:35:56] [INFO ] [Real]Absence check using 14 positive and 65 generalized place invariants in 15 ms returned sat
[2023-03-10 23:35:57] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:35:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-10 23:35:57] [INFO ] [Nat]Absence check using 14 positive and 65 generalized place invariants in 18 ms returned sat
[2023-03-10 23:35:57] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:35:57] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2023-03-10 23:35:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-10 23:35:57] [INFO ] After 757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-10 23:35:58] [INFO ] After 959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1120/1120 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 524 transition count 1119
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 522 transition count 1113
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 522 transition count 1113
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 521 transition count 1113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 520 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 519 transition count 1111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 519 transition count 1111
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 519 transition count 1110
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 518 transition count 1109
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 518 transition count 1109
Applied a total of 13 rules in 83 ms. Remains 518 /524 variables (removed 6) and now considering 1109/1120 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 518/524 places, 1109/1120 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 464597 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 464597 steps, saw 175194 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1109 rows 518 cols
[2023-03-10 23:36:01] [INFO ] Computed 78 place invariants in 19 ms
[2023-03-10 23:36:01] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-10 23:36:01] [INFO ] [Real]Absence check using 14 positive and 64 generalized place invariants in 37 ms returned sat
[2023-03-10 23:36:01] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 23:36:01] [INFO ] After 370ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-10 23:36:01] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1109/1109 transitions.
Applied a total of 0 rules in 69 ms. Remains 518 /518 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 518/518 places, 1109/1109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1109/1109 transitions.
Applied a total of 0 rules in 28 ms. Remains 518 /518 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2023-03-10 23:36:02] [INFO ] Invariant cache hit.
[2023-03-10 23:36:02] [INFO ] Implicit Places using invariants in 591 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 176, 182, 185, 187, 188, 193, 194, 246, 263, 269, 272, 274, 275, 280, 281, 282, 335, 356, 362, 365, 367, 368, 373, 374, 426, 443, 449, 452, 454, 455]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 593 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 479/518 places, 1109/1109 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 479 transition count 1104
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 474 transition count 1104
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 458 transition count 1088
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 458 transition count 1088
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 453 transition count 1083
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 453 transition count 1083
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 72 place count 443 transition count 1073
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 87 place count 443 transition count 1058
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 102 place count 428 transition count 1058
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 428 transition count 1054
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 424 transition count 1054
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 424 transition count 1054
Applied a total of 111 rules in 72 ms. Remains 424 /479 variables (removed 55) and now considering 1054/1109 (removed 55) transitions.
// Phase 1: matrix 1054 rows 424 cols
[2023-03-10 23:36:02] [INFO ] Computed 39 place invariants in 7 ms
[2023-03-10 23:36:02] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-10 23:36:02] [INFO ] Invariant cache hit.
[2023-03-10 23:36:03] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 424/518 places, 1054/1109 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1893 ms. Remains : 424/518 places, 1054/1109 transitions.
Incomplete random walk after 10000 steps, including 190 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27188 steps, run visited all 1 properties in 167 ms. (steps per millisecond=162 )
Probabilistic random walk after 27188 steps, saw 19628 distinct states, run finished after 167 ms. (steps per millisecond=162 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 615 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 589 reset in 349 ms.
Product exploration explored 100000 steps with 627 reset in 317 ms.
Built C files in :
/tmp/ltsmin14343845686885231841
[2023-03-10 23:36:06] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14343845686885231841
Running compilation step : cd /tmp/ltsmin14343845686885231841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2991 ms.
Running link step : cd /tmp/ltsmin14343845686885231841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin14343845686885231841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4438987914579685320.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Applied a total of 0 rules in 43 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
// Phase 1: matrix 1606 rows 1062 cols
[2023-03-10 23:36:21] [INFO ] Computed 143 place invariants in 28 ms
[2023-03-10 23:36:22] [INFO ] Implicit Places using invariants in 739 ms returned []
[2023-03-10 23:36:22] [INFO ] Invariant cache hit.
[2023-03-10 23:36:23] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
[2023-03-10 23:36:24] [INFO ] Invariant cache hit.
[2023-03-10 23:36:24] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3606 ms. Remains : 1062/1062 places, 1606/1606 transitions.
Built C files in :
/tmp/ltsmin18049127449363542593
[2023-03-10 23:36:24] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18049127449363542593
Running compilation step : cd /tmp/ltsmin18049127449363542593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2962 ms.
Running link step : cd /tmp/ltsmin18049127449363542593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin18049127449363542593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12457270131439017210.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 23:36:40] [INFO ] Flatten gal took : 68 ms
[2023-03-10 23:36:40] [INFO ] Flatten gal took : 62 ms
[2023-03-10 23:36:40] [INFO ] Time to serialize gal into /tmp/LTL11229678394703769494.gal : 12 ms
[2023-03-10 23:36:40] [INFO ] Time to serialize properties into /tmp/LTL274193523498278594.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11229678394703769494.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4741935205377952321.hoa' '-atoms' '/tmp/LTL274193523498278594.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL274193523498278594.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4741935205377952321.hoa
Detected timeout of ITS tools.
[2023-03-10 23:36:55] [INFO ] Flatten gal took : 119 ms
[2023-03-10 23:36:55] [INFO ] Flatten gal took : 73 ms
[2023-03-10 23:36:55] [INFO ] Time to serialize gal into /tmp/LTL583829823301613986.gal : 23 ms
[2023-03-10 23:36:55] [INFO ] Time to serialize properties into /tmp/LTL9003307621735047879.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL583829823301613986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9003307621735047879.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G((X("(p287!=1)"))||("((p620==1)&&(p779==1))"))))
Formula 0 simplified : F(!"((p620==1)&&(p779==1))" & X!"(p287!=1)")
Detected timeout of ITS tools.
[2023-03-10 23:37:10] [INFO ] Flatten gal took : 50 ms
[2023-03-10 23:37:10] [INFO ] Applying decomposition
[2023-03-10 23:37:10] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph282723275903945918.txt' '-o' '/tmp/graph282723275903945918.bin' '-w' '/tmp/graph282723275903945918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph282723275903945918.bin' '-l' '-1' '-v' '-w' '/tmp/graph282723275903945918.weights' '-q' '0' '-e' '0.001'
[2023-03-10 23:37:11] [INFO ] Decomposing Gal with order
[2023-03-10 23:37:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:37:11] [INFO ] Removed a total of 2175 redundant transitions.
[2023-03-10 23:37:11] [INFO ] Flatten gal took : 144 ms
[2023-03-10 23:37:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 27 ms.
[2023-03-10 23:37:11] [INFO ] Time to serialize gal into /tmp/LTL6745392414718385989.gal : 20 ms
[2023-03-10 23:37:11] [INFO ] Time to serialize properties into /tmp/LTL5348829642433162195.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6745392414718385989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5348829642433162195.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("(i4.u119.p287!=1)"))||("((i9.u181.p620==1)&&(i9.u218.p779==1))"))))
Formula 0 simplified : F(!"((i9.u181.p620==1)&&(i9.u218.p779==1))" & X!"(i4.u119.p287!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2377364043816365013
[2023-03-10 23:37:26] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2377364043816365013
Running compilation step : cd /tmp/ltsmin2377364043816365013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2859 ms.
Running link step : cd /tmp/ltsmin2377364043816365013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin2377364043816365013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-05a-LTLFireability-07 finished in 135697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 5 out of 1076 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1076 transition count 1504
Reduce places removed 188 places and 0 transitions.
Iterating post reduction 1 with 188 rules applied. Total rules applied 376 place count 888 transition count 1504
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 141 Pre rules applied. Total rules applied 376 place count 888 transition count 1363
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 44 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 326 rules applied. Total rules applied 702 place count 703 transition count 1363
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 718 place count 696 transition count 1354
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 727 place count 687 transition count 1354
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 727 place count 687 transition count 1335
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 765 place count 668 transition count 1335
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 773 place count 660 transition count 1310
Iterating global reduction 4 with 8 rules applied. Total rules applied 781 place count 660 transition count 1310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 787 place count 658 transition count 1306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 788 place count 657 transition count 1306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 788 place count 657 transition count 1305
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 790 place count 656 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 791 place count 655 transition count 1297
Iterating global reduction 6 with 1 rules applied. Total rules applied 792 place count 655 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 793 place count 654 transition count 1289
Iterating global reduction 6 with 1 rules applied. Total rules applied 794 place count 654 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 795 place count 653 transition count 1281
Iterating global reduction 6 with 1 rules applied. Total rules applied 796 place count 653 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 797 place count 652 transition count 1273
Iterating global reduction 6 with 1 rules applied. Total rules applied 798 place count 652 transition count 1273
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 799 place count 651 transition count 1265
Iterating global reduction 6 with 1 rules applied. Total rules applied 800 place count 651 transition count 1265
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 801 place count 650 transition count 1257
Iterating global reduction 6 with 1 rules applied. Total rules applied 802 place count 650 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 803 place count 649 transition count 1249
Iterating global reduction 6 with 1 rules applied. Total rules applied 804 place count 649 transition count 1249
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 805 place count 648 transition count 1241
Iterating global reduction 6 with 1 rules applied. Total rules applied 806 place count 648 transition count 1241
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 807 place count 647 transition count 1233
Iterating global reduction 6 with 1 rules applied. Total rules applied 808 place count 647 transition count 1233
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 912 place count 595 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 915 place count 592 transition count 1178
Iterating global reduction 6 with 3 rules applied. Total rules applied 918 place count 592 transition count 1178
Applied a total of 918 rules in 258 ms. Remains 592 /1076 variables (removed 484) and now considering 1178/1692 (removed 514) transitions.
// Phase 1: matrix 1178 rows 592 cols
[2023-03-10 23:37:41] [INFO ] Computed 93 place invariants in 21 ms
[2023-03-10 23:37:42] [INFO ] Implicit Places using invariants in 419 ms returned [19, 91, 97, 102, 118, 119, 194, 200, 205, 224, 299, 305, 310, 326, 327, 402, 408, 413, 429, 499, 505, 510, 529, 589]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 420 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 568/1076 places, 1178/1692 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 568 transition count 1169
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 559 transition count 1169
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 559 transition count 1159
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 549 transition count 1159
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 47 place count 540 transition count 1150
Iterating global reduction 2 with 9 rules applied. Total rules applied 56 place count 540 transition count 1150
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 65 place count 531 transition count 1141
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 531 transition count 1141
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 526 transition count 1136
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 526 transition count 1136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 108 place count 514 transition count 1124
Applied a total of 108 rules in 56 ms. Remains 514 /568 variables (removed 54) and now considering 1124/1178 (removed 54) transitions.
// Phase 1: matrix 1124 rows 514 cols
[2023-03-10 23:37:42] [INFO ] Computed 69 place invariants in 13 ms
[2023-03-10 23:37:42] [INFO ] Implicit Places using invariants in 336 ms returned [93, 96, 182, 185, 271, 274, 355, 358, 439, 442]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 337 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 504/1076 places, 1124/1692 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 504 transition count 1119
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 499 transition count 1119
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 15 place count 494 transition count 1114
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 494 transition count 1114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 25 place count 494 transition count 1109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 493 transition count 1108
Applied a total of 27 rules in 56 ms. Remains 493 /504 variables (removed 11) and now considering 1108/1124 (removed 16) transitions.
// Phase 1: matrix 1108 rows 493 cols
[2023-03-10 23:37:42] [INFO ] Computed 59 place invariants in 14 ms
[2023-03-10 23:37:43] [INFO ] Implicit Places using invariants in 322 ms returned [72, 151, 237, 321, 401]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 324 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 488/1076 places, 1108/1692 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 483 transition count 1103
Applied a total of 10 rules in 22 ms. Remains 483 /488 variables (removed 5) and now considering 1103/1108 (removed 5) transitions.
// Phase 1: matrix 1103 rows 483 cols
[2023-03-10 23:37:43] [INFO ] Computed 54 place invariants in 8 ms
[2023-03-10 23:37:43] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-10 23:37:43] [INFO ] Invariant cache hit.
[2023-03-10 23:37:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 23:37:44] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 483/1076 places, 1103/1692 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 3053 ms. Remains : 483/1076 places, 1103/1692 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), true, p0]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s171 1), p0:(OR (AND (EQ s197 1) (EQ s309 1)) (AND (EQ s440 1) (EQ s477 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-09 finished in 3248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1073 transition count 1672
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1073 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1072 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1072 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1071 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1071 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1070 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1070 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1069 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1069 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1068 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1068 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1067 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1067 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1066 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1066 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1065 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1065 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1064 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1064 transition count 1600
Applied a total of 24 rules in 338 ms. Remains 1064 /1076 variables (removed 12) and now considering 1600/1692 (removed 92) transitions.
// Phase 1: matrix 1600 rows 1064 cols
[2023-03-10 23:37:45] [INFO ] Computed 146 place invariants in 25 ms
[2023-03-10 23:37:45] [INFO ] Implicit Places using invariants in 639 ms returned [20, 211, 574, 954]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 642 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1076 places, 1600/1692 transitions.
Applied a total of 0 rules in 26 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1006 ms. Remains : 1060/1076 places, 1600/1692 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1036 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 50000 reset in 1022 ms.
Product exploration explored 100000 steps with 50000 reset in 992 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLFireability-11 finished in 3292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Found a Lengthening insensitive property : ASLink-PT-05a-LTLFireability-07
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1076 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1076/1076 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 191 place count 1075 transition count 1500
Reduce places removed 195 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 198 rules applied. Total rules applied 389 place count 880 transition count 1497
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 393 place count 877 transition count 1496
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 394 place count 876 transition count 1496
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 151 Pre rules applied. Total rules applied 394 place count 876 transition count 1345
Deduced a syphon composed of 151 places in 2 ms
Ensure Unique test removed 46 places
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 4 with 348 rules applied. Total rules applied 742 place count 679 transition count 1345
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 29 rules applied. Total rules applied 771 place count 667 transition count 1328
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 788 place count 650 transition count 1328
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 788 place count 650 transition count 1307
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 830 place count 629 transition count 1307
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 841 place count 618 transition count 1284
Iterating global reduction 6 with 11 rules applied. Total rules applied 852 place count 618 transition count 1284
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 9 rules applied. Total rules applied 861 place count 617 transition count 1276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 862 place count 616 transition count 1276
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 862 place count 616 transition count 1275
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 864 place count 615 transition count 1275
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 865 place count 614 transition count 1267
Iterating global reduction 8 with 1 rules applied. Total rules applied 866 place count 614 transition count 1267
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 867 place count 613 transition count 1259
Iterating global reduction 8 with 1 rules applied. Total rules applied 868 place count 613 transition count 1259
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 869 place count 612 transition count 1251
Iterating global reduction 8 with 1 rules applied. Total rules applied 870 place count 612 transition count 1251
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 871 place count 611 transition count 1243
Iterating global reduction 8 with 1 rules applied. Total rules applied 872 place count 611 transition count 1243
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 873 place count 610 transition count 1235
Iterating global reduction 8 with 1 rules applied. Total rules applied 874 place count 610 transition count 1235
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 875 place count 609 transition count 1227
Iterating global reduction 8 with 1 rules applied. Total rules applied 876 place count 609 transition count 1227
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 877 place count 608 transition count 1219
Iterating global reduction 8 with 1 rules applied. Total rules applied 878 place count 608 transition count 1219
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 879 place count 607 transition count 1211
Iterating global reduction 8 with 1 rules applied. Total rules applied 880 place count 607 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 881 place count 606 transition count 1203
Iterating global reduction 8 with 1 rules applied. Total rules applied 882 place count 606 transition count 1203
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 8 with 92 rules applied. Total rules applied 974 place count 560 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 975 place count 559 transition count 1156
Iterating global reduction 8 with 1 rules applied. Total rules applied 976 place count 559 transition count 1156
Applied a total of 976 rules in 252 ms. Remains 559 /1076 variables (removed 517) and now considering 1156/1692 (removed 536) transitions.
// Phase 1: matrix 1156 rows 559 cols
[2023-03-10 23:37:48] [INFO ] Computed 83 place invariants in 13 ms
[2023-03-10 23:37:49] [INFO ] Implicit Places using invariants in 402 ms returned [72, 89, 95, 100, 108, 184, 190, 195, 264, 281, 287, 292, 294, 357, 378, 384, 389, 390, 395, 455, 472, 478, 483, 485, 514, 556]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 404 ms to find 26 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 533/1076 places, 1156/1692 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 533 transition count 1151
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 528 transition count 1151
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 21 place count 517 transition count 1140
Iterating global reduction 2 with 11 rules applied. Total rules applied 32 place count 517 transition count 1140
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 507 transition count 1130
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 507 transition count 1130
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 502 transition count 1125
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 502 transition count 1125
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 96 place count 485 transition count 1108
Applied a total of 96 rules in 51 ms. Remains 485 /533 variables (removed 48) and now considering 1108/1156 (removed 48) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2023-03-10 23:37:49] [INFO ] Computed 57 place invariants in 18 ms
[2023-03-10 23:37:49] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-10 23:37:49] [INFO ] Invariant cache hit.
[2023-03-10 23:37:50] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 485/1076 places, 1108/1692 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2126 ms. Remains : 485/1076 places, 1108/1692 transitions.
Running random walk in product with property : ASLink-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s266 1) (EQ s342 1)), p1:(NEQ s149 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][false, false, false]]
Product exploration explored 100000 steps with 1452 reset in 284 ms.
Product exploration explored 100000 steps with 1457 reset in 260 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 695 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 142 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:37:52] [INFO ] Invariant cache hit.
[2023-03-10 23:37:52] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2023-03-10 23:37:52] [INFO ] [Real]Absence check using 12 positive and 45 generalized place invariants in 14 ms returned sat
[2023-03-10 23:37:52] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:37:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-10 23:37:52] [INFO ] [Nat]Absence check using 12 positive and 45 generalized place invariants in 31 ms returned sat
[2023-03-10 23:37:53] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:37:53] [INFO ] After 520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-10 23:37:53] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 485 transition count 1107
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 484 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 482 transition count 1100
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 482 transition count 1100
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 26 place count 482 transition count 1080
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 50 place count 462 transition count 1076
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 65 place count 462 transition count 1061
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 81 place count 446 transition count 1061
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 81 place count 446 transition count 1059
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 443 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 442 transition count 1058
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 442 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 442 transition count 1057
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 442 transition count 1056
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 442 transition count 1056
Applied a total of 91 rules in 138 ms. Remains 442 /485 variables (removed 43) and now considering 1056/1108 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 442/485 places, 1056/1108 transitions.
Incomplete random walk after 10000 steps, including 182 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 446171 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446171 steps, saw 317436 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1056 rows 442 cols
[2023-03-10 23:37:56] [INFO ] Computed 55 place invariants in 12 ms
[2023-03-10 23:37:56] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 23:37:56] [INFO ] [Real]Absence check using 10 positive and 45 generalized place invariants in 31 ms returned sat
[2023-03-10 23:37:56] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:37:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 23:37:57] [INFO ] [Nat]Absence check using 10 positive and 45 generalized place invariants in 20 ms returned sat
[2023-03-10 23:37:57] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:37:57] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-10 23:37:57] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1056/1056 transitions.
Applied a total of 0 rules in 22 ms. Remains 442 /442 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 442/442 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1056/1056 transitions.
Applied a total of 0 rules in 20 ms. Remains 442 /442 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2023-03-10 23:37:57] [INFO ] Invariant cache hit.
[2023-03-10 23:37:58] [INFO ] Implicit Places using invariants in 390 ms returned [88, 89, 141, 159, 164, 165, 235, 236, 237, 313, 314]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 391 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 431/442 places, 1056/1056 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 431 transition count 1052
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 427 transition count 1052
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 425 transition count 1050
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 425 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 424 transition count 1049
Applied a total of 14 rules in 32 ms. Remains 424 /431 variables (removed 7) and now considering 1049/1056 (removed 7) transitions.
// Phase 1: matrix 1049 rows 424 cols
[2023-03-10 23:37:58] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-10 23:37:58] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-10 23:37:58] [INFO ] Invariant cache hit.
[2023-03-10 23:37:59] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 424/442 places, 1049/1056 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1614 ms. Remains : 424/442 places, 1049/1056 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 462739 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 462739 steps, saw 326262 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:38:02] [INFO ] Invariant cache hit.
[2023-03-10 23:38:02] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:38:02] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 54 ms returned sat
[2023-03-10 23:38:02] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 23:38:03] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 17 ms returned sat
[2023-03-10 23:38:03] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:38:03] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-10 23:38:03] [INFO ] After 846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 26 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 424/424 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 18 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2023-03-10 23:38:03] [INFO ] Invariant cache hit.
[2023-03-10 23:38:04] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-10 23:38:04] [INFO ] Invariant cache hit.
[2023-03-10 23:38:05] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2023-03-10 23:38:05] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-10 23:38:05] [INFO ] Invariant cache hit.
[2023-03-10 23:38:05] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1994 ms. Remains : 424/424 places, 1049/1049 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-10 23:38:05] [INFO ] Invariant cache hit.
[2023-03-10 23:38:05] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 23:38:05] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 27 ms returned sat
[2023-03-10 23:38:06] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:38:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 23:38:06] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 18 ms returned sat
[2023-03-10 23:38:06] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:38:06] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-10 23:38:07] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 10 factoid took 750 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Applied a total of 0 rules in 18 ms. Remains 485 /485 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2023-03-10 23:38:08] [INFO ] Computed 57 place invariants in 18 ms
[2023-03-10 23:38:08] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-10 23:38:08] [INFO ] Invariant cache hit.
[2023-03-10 23:38:09] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2023-03-10 23:38:09] [INFO ] Invariant cache hit.
[2023-03-10 23:38:10] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2159 ms. Remains : 485/485 places, 1108/1108 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 468 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 137 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 198282 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198282 steps, saw 89024 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 23:38:14] [INFO ] Invariant cache hit.
[2023-03-10 23:38:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-10 23:38:14] [INFO ] [Real]Absence check using 12 positive and 45 generalized place invariants in 15 ms returned sat
[2023-03-10 23:38:14] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:38:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-10 23:38:15] [INFO ] [Nat]Absence check using 12 positive and 45 generalized place invariants in 24 ms returned sat
[2023-03-10 23:38:15] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:38:16] [INFO ] After 951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-10 23:38:16] [INFO ] After 1481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 485 transition count 1088
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 43 place count 465 transition count 1085
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 58 place count 465 transition count 1070
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 74 place count 449 transition count 1070
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 74 place count 449 transition count 1068
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 446 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 445 transition count 1067
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 445 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 445 transition count 1066
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 445 transition count 1065
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 445 transition count 1065
Applied a total of 84 rules in 110 ms. Remains 445 /485 variables (removed 40) and now considering 1065/1108 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 445/485 places, 1065/1108 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 150735 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150735 steps, saw 103319 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1065 rows 445 cols
[2023-03-10 23:38:20] [INFO ] Computed 55 place invariants in 6 ms
[2023-03-10 23:38:20] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-10 23:38:20] [INFO ] [Real]Absence check using 11 positive and 44 generalized place invariants in 10 ms returned sat
[2023-03-10 23:38:20] [INFO ] After 319ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-10 23:38:20] [INFO ] After 490ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-10 23:38:20] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-10 23:38:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-10 23:38:20] [INFO ] [Nat]Absence check using 11 positive and 44 generalized place invariants in 29 ms returned sat
[2023-03-10 23:38:21] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:38:21] [INFO ] After 802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-10 23:38:21] [INFO ] After 1268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1065/1065 transitions.
Applied a total of 0 rules in 24 ms. Remains 445 /445 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 445/445 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1065/1065 transitions.
Applied a total of 0 rules in 18 ms. Remains 445 /445 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2023-03-10 23:38:22] [INFO ] Invariant cache hit.
[2023-03-10 23:38:22] [INFO ] Implicit Places using invariants in 410 ms returned [88, 89, 141, 159, 164, 165, 235, 236, 316, 317]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 412 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/445 places, 1065/1065 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 1064
Applied a total of 2 rules in 22 ms. Remains 434 /435 variables (removed 1) and now considering 1064/1065 (removed 1) transitions.
// Phase 1: matrix 1064 rows 434 cols
[2023-03-10 23:38:22] [INFO ] Computed 45 place invariants in 7 ms
[2023-03-10 23:38:22] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-10 23:38:22] [INFO ] Invariant cache hit.
[2023-03-10 23:38:23] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 434/445 places, 1064/1065 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1656 ms. Remains : 434/445 places, 1064/1065 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 157755 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157755 steps, saw 108527 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 23:38:27] [INFO ] Invariant cache hit.
[2023-03-10 23:38:27] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 23:38:27] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 14 ms returned sat
[2023-03-10 23:38:27] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:38:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:38:27] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 33 ms returned sat
[2023-03-10 23:38:28] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:38:28] [INFO ] After 927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-10 23:38:28] [INFO ] After 1422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1064/1064 transitions.
Applied a total of 0 rules in 20 ms. Remains 434 /434 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 434/434 places, 1064/1064 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1064/1064 transitions.
Applied a total of 0 rules in 16 ms. Remains 434 /434 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
[2023-03-10 23:38:29] [INFO ] Invariant cache hit.
[2023-03-10 23:38:29] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-10 23:38:29] [INFO ] Invariant cache hit.
[2023-03-10 23:38:30] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2023-03-10 23:38:30] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-10 23:38:30] [INFO ] Invariant cache hit.
[2023-03-10 23:38:30] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1777 ms. Remains : 434/434 places, 1064/1064 transitions.
Applied a total of 0 rules in 11 ms. Remains 434 /434 variables (removed 0) and now considering 1064/1064 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-10 23:38:30] [INFO ] Invariant cache hit.
[2023-03-10 23:38:30] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:38:30] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 32 ms returned sat
[2023-03-10 23:38:31] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:38:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:38:31] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 21 ms returned sat
[2023-03-10 23:38:32] [INFO ] After 570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 23:38:32] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 234 ms.
[2023-03-10 23:38:32] [INFO ] After 1359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 555 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1466 reset in 298 ms.
Product exploration explored 100000 steps with 1445 reset in 325 ms.
Built C files in :
/tmp/ltsmin6524040345127212189
[2023-03-10 23:38:34] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6524040345127212189
Running compilation step : cd /tmp/ltsmin6524040345127212189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2044 ms.
Running link step : cd /tmp/ltsmin6524040345127212189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin6524040345127212189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16615526936113313817.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Applied a total of 0 rules in 11 ms. Remains 485 /485 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2023-03-10 23:38:49] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-10 23:38:50] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-10 23:38:50] [INFO ] Invariant cache hit.
[2023-03-10 23:38:51] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2023-03-10 23:38:51] [INFO ] Invariant cache hit.
[2023-03-10 23:38:51] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1946 ms. Remains : 485/485 places, 1108/1108 transitions.
Built C files in :
/tmp/ltsmin16157623938598765988
[2023-03-10 23:38:51] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16157623938598765988
Running compilation step : cd /tmp/ltsmin16157623938598765988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2032 ms.
Running link step : cd /tmp/ltsmin16157623938598765988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin16157623938598765988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17942181237741698671.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 23:39:06] [INFO ] Flatten gal took : 46 ms
[2023-03-10 23:39:06] [INFO ] Flatten gal took : 45 ms
[2023-03-10 23:39:07] [INFO ] Time to serialize gal into /tmp/LTL4621945676127701807.gal : 245 ms
[2023-03-10 23:39:07] [INFO ] Time to serialize properties into /tmp/LTL7391149380965050133.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4621945676127701807.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13513281971450486590.hoa' '-atoms' '/tmp/LTL7391149380965050133.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7391149380965050133.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13513281971450486590.hoa
Detected timeout of ITS tools.
[2023-03-10 23:39:22] [INFO ] Flatten gal took : 37 ms
[2023-03-10 23:39:22] [INFO ] Flatten gal took : 33 ms
[2023-03-10 23:39:22] [INFO ] Time to serialize gal into /tmp/LTL3486135615574822268.gal : 6 ms
[2023-03-10 23:39:22] [INFO ] Time to serialize properties into /tmp/LTL15829915311475954919.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3486135615574822268.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15829915311475954919.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("(p287!=1)"))||("((p620==1)&&(p779==1))"))))
Formula 0 simplified : F(!"((p620==1)&&(p779==1))" & X!"(p287!=1)")
Detected timeout of ITS tools.
[2023-03-10 23:39:37] [INFO ] Flatten gal took : 93 ms
[2023-03-10 23:39:37] [INFO ] Applying decomposition
[2023-03-10 23:39:37] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3911296388306387968.txt' '-o' '/tmp/graph3911296388306387968.bin' '-w' '/tmp/graph3911296388306387968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3911296388306387968.bin' '-l' '-1' '-v' '-w' '/tmp/graph3911296388306387968.weights' '-q' '0' '-e' '0.001'
[2023-03-10 23:39:37] [INFO ] Decomposing Gal with order
[2023-03-10 23:39:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:39:37] [INFO ] Removed a total of 2167 redundant transitions.
[2023-03-10 23:39:37] [INFO ] Flatten gal took : 75 ms
[2023-03-10 23:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 18 ms.
[2023-03-10 23:39:37] [INFO ] Time to serialize gal into /tmp/LTL324208211119345850.gal : 8 ms
[2023-03-10 23:39:37] [INFO ] Time to serialize properties into /tmp/LTL15488389115502812483.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL324208211119345850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15488389115502812483.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("(i0.u42.p287!=1)"))||("((i7.u74.p620==1)&&(i8.u84.p779==1))"))))
Formula 0 simplified : F(!"((i7.u74.p620==1)&&(i8.u84.p779==1))" & X!"(i0.u42.p287!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6806667182386256530
[2023-03-10 23:39:52] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6806667182386256530
Running compilation step : cd /tmp/ltsmin6806667182386256530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1841 ms.
Running link step : cd /tmp/ltsmin6806667182386256530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin6806667182386256530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-05a-LTLFireability-07 finished in 139803 ms.
[2023-03-10 23:40:08] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17319601049788571418
[2023-03-10 23:40:08] [INFO ] Too many transitions (1692) to apply POR reductions. Disabling POR matrices.
[2023-03-10 23:40:08] [INFO ] Applying decomposition
[2023-03-10 23:40:08] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17319601049788571418
Running compilation step : cd /tmp/ltsmin17319601049788571418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-10 23:40: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.202303021504/bin/convert-linux64' '-i' '/tmp/graph15394051674425195541.txt' '-o' '/tmp/graph15394051674425195541.bin' '-w' '/tmp/graph15394051674425195541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15394051674425195541.bin' '-l' '-1' '-v' '-w' '/tmp/graph15394051674425195541.weights' '-q' '0' '-e' '0.001'
[2023-03-10 23:40:08] [INFO ] Decomposing Gal with order
[2023-03-10 23:40:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:40:08] [INFO ] Removed a total of 2407 redundant transitions.
[2023-03-10 23:40:08] [INFO ] Flatten gal took : 103 ms
[2023-03-10 23:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 16 ms.
[2023-03-10 23:40:08] [INFO ] Time to serialize gal into /tmp/LTLFireability17004396836258730426.gal : 13 ms
[2023-03-10 23:40:08] [INFO ] Time to serialize properties into /tmp/LTLFireability14656605134938010392.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17004396836258730426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14656605134938010392.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(("((i8.u177.p620==1)&&(i8.u215.p779==1))")||(X("(i3.u114.p287!=1)")))))
Formula 0 simplified : F(!"((i8.u177.p620==1)&&(i8.u215.p779==1))" & X!"(i3.u114.p287!=1)")
Compilation finished in 3669 ms.
Running link step : cd /tmp/ltsmin17319601049788571418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin17319601049788571418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 00:01:55] [INFO ] Applying decomposition
[2023-03-11 00:01:55] [INFO ] Flatten gal took : 152 ms
[2023-03-11 00:01:56] [INFO ] Decomposing Gal with order
[2023-03-11 00:01:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 00:01:56] [INFO ] Removed a total of 1971 redundant transitions.
[2023-03-11 00:01:56] [INFO ] Flatten gal took : 294 ms
[2023-03-11 00:01:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 689 labels/synchronizations in 93 ms.
[2023-03-11 00:01:56] [INFO ] Time to serialize gal into /tmp/LTLFireability13928098645852148209.gal : 12 ms
[2023-03-11 00:01:56] [INFO ] Time to serialize properties into /tmp/LTLFireability8394342516036492313.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13928098645852148209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8394342516036492313.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((u109.p620==1)&&(i29.u134.p779==1))")||(X("(i13.u245.p287!=1)")))))
Formula 0 simplified : F(!"((u109.p620==1)&&(i29.u134.p779==1))" & X!"(i13.u245.p287!=1)")
Reverse transition relation is NOT exact ! Due to transitions t1028, t1109, t1266, t1267, t1270, t1272, t1275, t1287, t1296, t1346, t1372, t1401, t1429, t1...866
Computing Next relation with stutter on 3.45014e+13 deadlock states
Detected timeout of ITS tools.
[2023-03-11 00:23:44] [INFO ] Flatten gal took : 115 ms
[2023-03-11 00:23:44] [INFO ] Input system was already deterministic with 1692 transitions.
[2023-03-11 00:23:44] [INFO ] Transformed 1076 places.
[2023-03-11 00:23:44] [INFO ] Transformed 1692 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 00:24:14] [INFO ] Time to serialize gal into /tmp/LTLFireability13838845320995582134.gal : 8 ms
[2023-03-11 00:24:14] [INFO ] Time to serialize properties into /tmp/LTLFireability17953502718264385186.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13838845320995582134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17953502718264385186.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("((p620==1)&&(p779==1))")||(X("(p287!=1)")))))
Formula 0 simplified : F(!"((p620==1)&&(p779==1))" & X!"(p287!=1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7568760 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16032636 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813592600076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05a.tgz
mv ASLink-PT-05a 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 ;