Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372700372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is NoC3x3-PT-3B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372700372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 12 07:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 581K May 18 16:43 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 NoC3x3-PT-3B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-3B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716689981838

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 02:19:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:19:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:19:43] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-26 02:19:43] [INFO ] Transformed 2117 places.
[2024-05-26 02:19:43] [INFO ] Transformed 2435 transitions.
[2024-05-26 02:19:43] [INFO ] Found NUPN structural information;
[2024-05-26 02:19:43] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-3B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2112 transition count 2435
Discarding 526 places :
Symmetric choice reduction at 1 with 526 rule applications. Total rules 531 place count 1586 transition count 1909
Iterating global reduction 1 with 526 rules applied. Total rules applied 1057 place count 1586 transition count 1909
Discarding 183 places :
Symmetric choice reduction at 1 with 183 rule applications. Total rules 1240 place count 1403 transition count 1726
Iterating global reduction 1 with 183 rules applied. Total rules applied 1423 place count 1403 transition count 1726
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1426 place count 1403 transition count 1723
Discarding 197 places :
Symmetric choice reduction at 2 with 197 rule applications. Total rules 1623 place count 1206 transition count 1510
Iterating global reduction 2 with 197 rules applied. Total rules applied 1820 place count 1206 transition count 1510
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 1871 place count 1155 transition count 1415
Iterating global reduction 2 with 51 rules applied. Total rules applied 1922 place count 1155 transition count 1415
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 17 rules applied. Total rules applied 1939 place count 1153 transition count 1400
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1975 place count 1117 transition count 1364
Iterating global reduction 3 with 36 rules applied. Total rules applied 2011 place count 1117 transition count 1364
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 2013 place count 1115 transition count 1364
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 2039 place count 1089 transition count 1312
Iterating global reduction 4 with 26 rules applied. Total rules applied 2065 place count 1089 transition count 1312
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 2091 place count 1063 transition count 1286
Iterating global reduction 4 with 26 rules applied. Total rules applied 2117 place count 1063 transition count 1286
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 2119 place count 1061 transition count 1286
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2143 place count 1037 transition count 1262
Iterating global reduction 5 with 24 rules applied. Total rules applied 2167 place count 1037 transition count 1262
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2191 place count 1037 transition count 1238
Applied a total of 2191 rules in 1088 ms. Remains 1037 /2117 variables (removed 1080) and now considering 1238/2435 (removed 1197) transitions.
// Phase 1: matrix 1238 rows 1037 cols
[2024-05-26 02:19:44] [INFO ] Computed 57 invariants in 28 ms
[2024-05-26 02:19:45] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-26 02:19:45] [INFO ] Invariant cache hit.
[2024-05-26 02:19:46] [INFO ] Implicit Places using invariants and state equation in 959 ms returned [72, 80, 139, 142, 146, 147, 155, 158, 250, 253, 257, 260, 321, 322, 333, 336, 340, 431, 432, 433, 434, 438, 439, 440, 449, 452, 455, 463, 466, 469, 650, 651, 652, 656, 657, 658, 659, 663, 664, 665, 779, 780, 788, 846, 847, 848, 852, 862, 966, 967, 968, 972, 973]
Discarding 53 places :
Implicit Place search using SMT with State Equation took 1630 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 984/2117 places, 1238/2435 transitions.
Applied a total of 0 rules in 19 ms. Remains 984 /984 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2737 ms. Remains : 984/2117 places, 1238/2435 transitions.
Support contains 33 out of 984 places after structural reductions.
[2024-05-26 02:19:46] [INFO ] Flatten gal took : 106 ms
[2024-05-26 02:19:46] [INFO ] Flatten gal took : 67 ms
[2024-05-26 02:19:46] [INFO ] Input system was already deterministic with 1238 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 19) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1238 rows 984 cols
[2024-05-26 02:19:47] [INFO ] Computed 42 invariants in 9 ms
[2024-05-26 02:19:48] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-26 02:19:48] [INFO ] [Nat]Absence check using 42 positive place invariants in 21 ms returned sat
[2024-05-26 02:19:49] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-26 02:19:49] [INFO ] After 1261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 345 ms.
[2024-05-26 02:19:50] [INFO ] After 1962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 309 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=103 )
Parikh walk visited 8 properties in 84 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 66 stabilizing places and 66 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U (X(p1) U p2)))))'
Support contains 4 out of 984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 968 transition count 1222
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 968 transition count 1222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 968 transition count 1219
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 960 transition count 1208
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 960 transition count 1208
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 952 transition count 1198
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 952 transition count 1198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 949 transition count 1194
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 949 transition count 1194
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 946 transition count 1189
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 946 transition count 1189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 943 transition count 1185
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 943 transition count 1185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 940 transition count 1182
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 940 transition count 1182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 940 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 939 transition count 1179
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 939 transition count 1179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 939 transition count 1178
Applied a total of 96 rules in 156 ms. Remains 939 /984 variables (removed 45) and now considering 1178/1238 (removed 60) transitions.
// Phase 1: matrix 1178 rows 939 cols
[2024-05-26 02:19:50] [INFO ] Computed 42 invariants in 13 ms
[2024-05-26 02:19:50] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-26 02:19:50] [INFO ] Invariant cache hit.
[2024-05-26 02:19:51] [INFO ] Implicit Places using invariants and state equation in 626 ms returned [784]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 884 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 938/984 places, 1178/1238 transitions.
Applied a total of 0 rules in 20 ms. Remains 938 /938 variables (removed 0) and now considering 1178/1178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1063 ms. Remains : 938/984 places, 1178/1238 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 293 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s709 1), p1:(EQ s911 1), p0:(OR (EQ s447 0) (EQ s702 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 162 reset in 320 ms.
Product exploration explored 100000 steps with 158 reset in 313 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), true, (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND p2 (NOT p1) (NOT p0)), false, false, false]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1178 rows 938 cols
[2024-05-26 02:19:53] [INFO ] Computed 42 invariants in 12 ms
[2024-05-26 02:19:53] [INFO ] [Real]Absence check using 42 positive place invariants in 23 ms returned sat
[2024-05-26 02:19:53] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-26 02:19:54] [INFO ] [Nat]Absence check using 42 positive place invariants in 19 ms returned sat
[2024-05-26 02:19:54] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-26 02:19:55] [INFO ] After 951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 230 ms.
[2024-05-26 02:19:55] [INFO ] After 1450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 98 ms.
Support contains 4 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 1178/1178 transitions.
Graph (trivial) has 751 edges and 938 vertex of which 72 / 938 are part of one of the 9 SCC in 4 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 875 transition count 983
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 247 place count 752 transition count 983
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 247 place count 752 transition count 895
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 423 place count 664 transition count 895
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 444 place count 643 transition count 841
Iterating global reduction 2 with 21 rules applied. Total rules applied 465 place count 643 transition count 841
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Deduced a syphon composed of 333 places in 0 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 2 with 666 rules applied. Total rules applied 1131 place count 310 transition count 508
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1142 place count 299 transition count 488
Iterating global reduction 2 with 11 rules applied. Total rules applied 1153 place count 299 transition count 488
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1155 place count 299 transition count 486
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1157 place count 297 transition count 482
Iterating global reduction 3 with 2 rules applied. Total rules applied 1159 place count 297 transition count 482
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1161 place count 295 transition count 478
Iterating global reduction 3 with 2 rules applied. Total rules applied 1163 place count 295 transition count 478
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1199 place count 277 transition count 514
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1200 place count 277 transition count 513
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1224 place count 277 transition count 489
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 1255 place count 253 transition count 482
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1256 place count 253 transition count 481
Free-agglomeration rule (complex) applied 45 times.
Iterating global reduction 4 with 45 rules applied. Total rules applied 1301 place count 253 transition count 447
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 1357 place count 208 transition count 436
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1359 place count 208 transition count 436
Applied a total of 1359 rules in 200 ms. Remains 208 /938 variables (removed 730) and now considering 436/1178 (removed 742) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 208/938 places, 436/1178 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:19:55] [INFO ] Flow matrix only has 432 transitions (discarded 4 similar events)
// Phase 1: matrix 432 rows 208 cols
[2024-05-26 02:19:55] [INFO ] Computed 42 invariants in 5 ms
[2024-05-26 02:19:55] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:19:55] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2024-05-26 02:19:55] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:19:55] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-26 02:19:56] [INFO ] After 46ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:19:56] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-26 02:19:56] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 436/436 transitions.
Applied a total of 0 rules in 12 ms. Remains 208 /208 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 208/208 places, 436/436 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1171141 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :{}
Probabilistic random walk after 1171141 steps, saw 145667 distinct states, run finished after 3002 ms. (steps per millisecond=390 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:19:59] [INFO ] Flow matrix only has 432 transitions (discarded 4 similar events)
[2024-05-26 02:19:59] [INFO ] Invariant cache hit.
[2024-05-26 02:19:59] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:19:59] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2024-05-26 02:19:59] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:19:59] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-26 02:19:59] [INFO ] After 50ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:19:59] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-26 02:19:59] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 436/436 transitions.
Applied a total of 0 rules in 11 ms. Remains 208 /208 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 208/208 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2024-05-26 02:19:59] [INFO ] Flow matrix only has 432 transitions (discarded 4 similar events)
[2024-05-26 02:19:59] [INFO ] Invariant cache hit.
[2024-05-26 02:19:59] [INFO ] Implicit Places using invariants in 121 ms returned [7, 27, 50, 69, 96, 133, 158, 176, 198]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 124 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 199/208 places, 436/436 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 176 transition count 413
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 71 place count 176 transition count 388
Applied a total of 71 rules in 12 ms. Remains 176 /199 variables (removed 23) and now considering 388/436 (removed 48) transitions.
[2024-05-26 02:19:59] [INFO ] Flow matrix only has 384 transitions (discarded 4 similar events)
// Phase 1: matrix 384 rows 176 cols
[2024-05-26 02:19:59] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:19:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 02:19:59] [INFO ] Flow matrix only has 384 transitions (discarded 4 similar events)
[2024-05-26 02:19:59] [INFO ] Invariant cache hit.
[2024-05-26 02:19:59] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-26 02:20:00] [INFO ] Implicit Places using invariants and state equation in 326 ms returned [37, 71, 107, 125, 163]
Discarding 5 places :
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 428 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 171/208 places, 376/436 transitions.
Applied a total of 0 rules in 11 ms. Remains 171 /171 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 584 ms. Remains : 171/208 places, 376/436 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1347754 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :{}
Probabilistic random walk after 1347754 steps, saw 195857 distinct states, run finished after 3002 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:20:03] [INFO ] Flow matrix only has 372 transitions (discarded 4 similar events)
// Phase 1: matrix 372 rows 171 cols
[2024-05-26 02:20:03] [INFO ] Computed 28 invariants in 5 ms
[2024-05-26 02:20:03] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:20:03] [INFO ] [Nat]Absence check using 28 positive place invariants in 3 ms returned sat
[2024-05-26 02:20:03] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:20:03] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-26 02:20:03] [INFO ] After 22ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:20:03] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-26 02:20:03] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 376/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 171 /171 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 171/171 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-26 02:20:03] [INFO ] Flow matrix only has 372 transitions (discarded 4 similar events)
[2024-05-26 02:20:03] [INFO ] Invariant cache hit.
[2024-05-26 02:20:03] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-26 02:20:03] [INFO ] Flow matrix only has 372 transitions (discarded 4 similar events)
[2024-05-26 02:20:03] [INFO ] Invariant cache hit.
[2024-05-26 02:20:03] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-26 02:20:03] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-26 02:20:03] [INFO ] Redundant transitions in 66 ms returned []
[2024-05-26 02:20:03] [INFO ] Flow matrix only has 372 transitions (discarded 4 similar events)
[2024-05-26 02:20:03] [INFO ] Invariant cache hit.
[2024-05-26 02:20:03] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 171/171 places, 376/376 transitions.
Graph (trivial) has 66 edges and 171 vertex of which 48 / 171 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 453 edges and 147 vertex of which 91 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 91 transition count 177
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 122 place count 91 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 90 transition count 176
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 9 edges and 89 vertex of which 2 / 89 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 88 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 88 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 88 transition count 173
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 87 transition count 172
Applied a total of 130 rules in 19 ms. Remains 87 /171 variables (removed 84) and now considering 172/376 (removed 204) transitions.
Running SMT prover for 1 properties.
[2024-05-26 02:20:03] [INFO ] Flow matrix only has 165 transitions (discarded 7 similar events)
// Phase 1: matrix 165 rows 87 cols
[2024-05-26 02:20:03] [INFO ] Computed 11 invariants in 0 ms
[2024-05-26 02:20:03] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:20:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-26 02:20:04] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:20:04] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-26 02:20:04] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), true, (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (AND p0 p2 p1)), (F p1), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND p2 (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND p2 (NOT p1) (NOT p0)), false, false, false]
// Phase 1: matrix 1178 rows 938 cols
[2024-05-26 02:20:04] [INFO ] Computed 42 invariants in 5 ms
[2024-05-26 02:20:05] [INFO ] [Real]Absence check using 42 positive place invariants in 23 ms returned sat
[2024-05-26 02:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:20:06] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2024-05-26 02:20:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:20:07] [INFO ] [Nat]Absence check using 42 positive place invariants in 26 ms returned sat
[2024-05-26 02:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:20:08] [INFO ] [Nat]Absence check using state equation in 1389 ms returned sat
[2024-05-26 02:20:08] [INFO ] Computed and/alt/rep : 1177/2176/1177 causal constraints (skipped 0 transitions) in 63 ms.
[2024-05-26 02:20:21] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 02:20:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 4 out of 938 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 938/938 places, 1178/1178 transitions.
Graph (trivial) has 751 edges and 938 vertex of which 72 / 938 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 874 transition count 991
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 247 place count 751 transition count 991
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 247 place count 751 transition count 912
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 405 place count 672 transition count 912
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 426 place count 651 transition count 858
Iterating global reduction 2 with 21 rules applied. Total rules applied 447 place count 651 transition count 858
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1127 place count 311 transition count 518
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1138 place count 300 transition count 498
Iterating global reduction 2 with 11 rules applied. Total rules applied 1149 place count 300 transition count 498
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1151 place count 300 transition count 496
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1153 place count 298 transition count 492
Iterating global reduction 3 with 2 rules applied. Total rules applied 1155 place count 298 transition count 492
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1157 place count 296 transition count 488
Iterating global reduction 3 with 2 rules applied. Total rules applied 1159 place count 296 transition count 488
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1189 place count 281 transition count 492
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 1192 place count 281 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1193 place count 280 transition count 491
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1202 place count 271 transition count 491
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1250 place count 247 transition count 467
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 1276 place count 247 transition count 441
Applied a total of 1276 rules in 108 ms. Remains 247 /938 variables (removed 691) and now considering 441/1178 (removed 737) transitions.
[2024-05-26 02:20:22] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
// Phase 1: matrix 433 rows 247 cols
[2024-05-26 02:20:22] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:20:22] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-26 02:20:22] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
[2024-05-26 02:20:22] [INFO ] Invariant cache hit.
[2024-05-26 02:20:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:20:22] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-26 02:20:22] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-26 02:20:22] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
[2024-05-26 02:20:22] [INFO ] Invariant cache hit.
[2024-05-26 02:20:22] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/938 places, 441/1178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 639 ms. Remains : 247/938 places, 441/1178 transitions.
Computed a total of 52 stabilizing places and 180 stable transitions
Computed a total of 52 stabilizing places and 180 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p2 p1)))), true, (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 287 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND p2 (NOT p1) (NOT p0)), false, false, false]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 02:20:23] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
[2024-05-26 02:20:23] [INFO ] Invariant cache hit.
[2024-05-26 02:20:23] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:20:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-26 02:20:23] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:20:23] [INFO ] After 25ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:23] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-26 02:20:23] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 441/441 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 247 transition count 432
Free-agglomeration rule applied 31 times.
Iterating global reduction 1 with 31 rules applied. Total rules applied 40 place count 247 transition count 401
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 216 transition count 394
Free-agglomeration rule (complex) applied 45 times.
Iterating global reduction 2 with 45 rules applied. Total rules applied 123 place count 216 transition count 360
Reduce places removed 54 places and 0 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 85 rules applied. Total rules applied 208 place count 162 transition count 329
Applied a total of 208 rules in 23 ms. Remains 162 /247 variables (removed 85) and now considering 329/441 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 162/247 places, 329/441 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 880080 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :{}
Probabilistic random walk after 880080 steps, saw 171562 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 329 rows 162 cols
[2024-05-26 02:20:26] [INFO ] Computed 24 invariants in 5 ms
[2024-05-26 02:20:26] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:20:26] [INFO ] [Nat]Absence check using 24 positive place invariants in 2 ms returned sat
[2024-05-26 02:20:27] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:20:27] [INFO ] After 20ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:27] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-26 02:20:27] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 5 ms.
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 329/329 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 162/162 places, 329/329 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1389531 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :{}
Probabilistic random walk after 1389531 steps, saw 239816 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:20:30] [INFO ] Invariant cache hit.
[2024-05-26 02:20:30] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:20:30] [INFO ] [Nat]Absence check using 24 positive place invariants in 3 ms returned sat
[2024-05-26 02:20:30] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:20:30] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:20:30] [INFO ] After 15ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:20:30] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-26 02:20:30] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p2 p1)))), true, (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (AND p0 p1 p2)), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (NOT p0))]
Knowledge based reduction with 18 factoid took 535 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND p2 (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND p2 (NOT p1) (NOT p0)), false, false, false]
[2024-05-26 02:20:31] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
// Phase 1: matrix 433 rows 247 cols
[2024-05-26 02:20:31] [INFO ] Computed 33 invariants in 5 ms
[2024-05-26 02:20:31] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-26 02:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:20:31] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-26 02:20:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:20:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-26 02:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:20:32] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-26 02:20:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:20:32] [INFO ] [Nat]Added 24 Read/Feed constraints in 9 ms returned sat
[2024-05-26 02:20:32] [INFO ] Computed and/alt/rep : 393/959/393 causal constraints (skipped 8 transitions) in 23 ms.
[2024-05-26 02:20:33] [INFO ] Added : 166 causal constraints over 34 iterations in 934 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND p2 (NOT p1) (NOT p0)), false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-00 finished in 43171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 968 transition count 1222
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 968 transition count 1222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 968 transition count 1220
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 959 transition count 1208
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 959 transition count 1208
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 950 transition count 1196
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 950 transition count 1196
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 945 transition count 1190
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 945 transition count 1190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 945 transition count 1189
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 941 transition count 1182
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 941 transition count 1182
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 937 transition count 1177
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 937 transition count 1177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 933 transition count 1173
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 933 transition count 1173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 933 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 932 transition count 1169
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 932 transition count 1169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 932 transition count 1168
Applied a total of 111 rules in 154 ms. Remains 932 /984 variables (removed 52) and now considering 1168/1238 (removed 70) transitions.
// Phase 1: matrix 1168 rows 932 cols
[2024-05-26 02:20:33] [INFO ] Computed 42 invariants in 6 ms
[2024-05-26 02:20:33] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-26 02:20:33] [INFO ] Invariant cache hit.
[2024-05-26 02:20:34] [INFO ] Implicit Places using invariants and state equation in 641 ms returned [778]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 865 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 931/984 places, 1168/1238 transitions.
Applied a total of 0 rules in 17 ms. Remains 931 /931 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1036 ms. Remains : 931/984 places, 1168/1238 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (NEQ s524 0) (NEQ s679 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-05 finished in 1213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 968 transition count 1222
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 968 transition count 1222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 968 transition count 1219
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 960 transition count 1208
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 960 transition count 1208
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 952 transition count 1198
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 952 transition count 1198
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 948 transition count 1193
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 948 transition count 1193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 948 transition count 1192
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 945 transition count 1187
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 945 transition count 1187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 942 transition count 1183
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 942 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 939 transition count 1180
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 939 transition count 1180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 939 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 938 transition count 1177
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 938 transition count 1177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 938 transition count 1176
Applied a total of 99 rules in 153 ms. Remains 938 /984 variables (removed 46) and now considering 1176/1238 (removed 62) transitions.
// Phase 1: matrix 1176 rows 938 cols
[2024-05-26 02:20:34] [INFO ] Computed 42 invariants in 11 ms
[2024-05-26 02:20:35] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-26 02:20:35] [INFO ] Invariant cache hit.
[2024-05-26 02:20:35] [INFO ] Implicit Places using invariants and state equation in 660 ms returned [784]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 900 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 937/984 places, 1176/1238 transitions.
Applied a total of 0 rules in 17 ms. Remains 937 /937 variables (removed 0) and now considering 1176/1176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1070 ms. Remains : 937/984 places, 1176/1238 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-06 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=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s639 0) (EQ s900 1)), p0:(OR (EQ s639 0) (EQ s900 1) (AND (NEQ s245 0) (NEQ s136 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 752 ms.
Product exploration explored 100000 steps with 50000 reset in 721 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3B-LTLCardinality-06 finished in 2748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 967 transition count 1221
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 967 transition count 1221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 967 transition count 1218
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 957 transition count 1205
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 957 transition count 1205
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 948 transition count 1193
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 948 transition count 1193
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 943 transition count 1187
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 943 transition count 1187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 943 transition count 1186
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 939 transition count 1179
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 939 transition count 1179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 935 transition count 1174
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 935 transition count 1174
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 931 transition count 1170
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 931 transition count 1170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 931 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 930 transition count 1166
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 930 transition count 1166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 930 transition count 1165
Applied a total of 116 rules in 145 ms. Remains 930 /984 variables (removed 54) and now considering 1165/1238 (removed 73) transitions.
// Phase 1: matrix 1165 rows 930 cols
[2024-05-26 02:20:37] [INFO ] Computed 42 invariants in 11 ms
[2024-05-26 02:20:37] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-26 02:20:37] [INFO ] Invariant cache hit.
[2024-05-26 02:20:38] [INFO ] Implicit Places using invariants and state equation in 633 ms returned [776]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 867 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/984 places, 1165/1238 transitions.
Applied a total of 0 rules in 18 ms. Remains 929 /929 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1031 ms. Remains : 929/984 places, 1165/1238 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s414 0) (EQ s242 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-07 finished in 1131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 966 transition count 1220
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 966 transition count 1220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 966 transition count 1217
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 956 transition count 1204
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 956 transition count 1204
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 947 transition count 1192
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 947 transition count 1192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 942 transition count 1186
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 942 transition count 1186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 942 transition count 1185
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 938 transition count 1178
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 938 transition count 1178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 934 transition count 1173
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 934 transition count 1173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 930 transition count 1169
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 930 transition count 1169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 930 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 929 transition count 1165
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 929 transition count 1165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 929 transition count 1164
Applied a total of 118 rules in 147 ms. Remains 929 /984 variables (removed 55) and now considering 1164/1238 (removed 74) transitions.
// Phase 1: matrix 1164 rows 929 cols
[2024-05-26 02:20:38] [INFO ] Computed 42 invariants in 13 ms
[2024-05-26 02:20:38] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-26 02:20:38] [INFO ] Invariant cache hit.
[2024-05-26 02:20:39] [INFO ] Implicit Places using invariants and state equation in 633 ms returned [775]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 863 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/984 places, 1164/1238 transitions.
Applied a total of 0 rules in 16 ms. Remains 928 /928 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1028 ms. Remains : 928/984 places, 1164/1238 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s746 0) (EQ s30 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 730 reset in 183 ms.
Stack based approach found an accepted trace after 9415 steps with 71 reset with depth 21 and stack size 21 in 22 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-08 finished in 1392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(G(p2))))'
Support contains 5 out of 984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 971 transition count 1225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 971 transition count 1225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 971 transition count 1222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 964 transition count 1213
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 964 transition count 1213
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 960 transition count 1207
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 960 transition count 1207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 957 transition count 1204
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 957 transition count 1204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 957 transition count 1203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 955 transition count 1199
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 955 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 953 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 953 transition count 1197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 951 transition count 1195
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 951 transition count 1195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 951 transition count 1193
Applied a total of 72 rules in 135 ms. Remains 951 /984 variables (removed 33) and now considering 1193/1238 (removed 45) transitions.
// Phase 1: matrix 1193 rows 951 cols
[2024-05-26 02:20:40] [INFO ] Computed 42 invariants in 12 ms
[2024-05-26 02:20:40] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-26 02:20:40] [INFO ] Invariant cache hit.
[2024-05-26 02:20:41] [INFO ] Implicit Places using invariants and state equation in 667 ms returned [789]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 906 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 950/984 places, 1193/1238 transitions.
Applied a total of 0 rules in 17 ms. Remains 950 /950 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1059 ms. Remains : 950/984 places, 1193/1238 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (EQ s903 0) (EQ s83 1)), p1:(EQ s791 1), p0:(OR (EQ s638 0) (EQ s457 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33240 reset in 564 ms.
Product exploration explored 100000 steps with 33421 reset in 589 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Computed a total of 66 stabilizing places and 66 stable transitions
Detected a total of 66/950 stabilizing places and 66/1193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (OR (AND p1 p2) (AND p0 p2))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (OR (AND p1 p2) (AND p0 p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 249 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1193 rows 950 cols
[2024-05-26 02:20:43] [INFO ] Computed 42 invariants in 5 ms
[2024-05-26 02:20:43] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-26 02:20:43] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned sat
[2024-05-26 02:20:44] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-26 02:20:44] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 1 ms to minimize.
[2024-05-26 02:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2024-05-26 02:20:44] [INFO ] After 1249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 261 ms.
[2024-05-26 02:20:45] [INFO ] After 1784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 78 ms.
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Graph (trivial) has 760 edges and 950 vertex of which 72 / 950 are part of one of the 9 SCC in 6 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 887 transition count 997
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 249 place count 763 transition count 997
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 249 place count 763 transition count 909
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 425 place count 675 transition count 909
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 447 place count 653 transition count 853
Iterating global reduction 2 with 22 rules applied. Total rules applied 469 place count 653 transition count 853
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1151 place count 312 transition count 512
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1162 place count 301 transition count 492
Iterating global reduction 2 with 11 rules applied. Total rules applied 1173 place count 301 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1175 place count 301 transition count 490
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1177 place count 299 transition count 486
Iterating global reduction 3 with 2 rules applied. Total rules applied 1179 place count 299 transition count 486
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1181 place count 297 transition count 482
Iterating global reduction 3 with 2 rules applied. Total rules applied 1183 place count 297 transition count 482
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1217 place count 280 transition count 521
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1237 place count 280 transition count 501
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1264 place count 260 transition count 494
Free-agglomeration rule (complex) applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1312 place count 260 transition count 460
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 1370 place count 212 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1371 place count 212 transition count 450
Applied a total of 1371 rules in 104 ms. Remains 212 /950 variables (removed 738) and now considering 450/1193 (removed 743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 212/950 places, 450/1193 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 02:20:45] [INFO ] Flow matrix only has 445 transitions (discarded 5 similar events)
// Phase 1: matrix 445 rows 212 cols
[2024-05-26 02:20:45] [INFO ] Computed 42 invariants in 1 ms
[2024-05-26 02:20:45] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:20:45] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2024-05-26 02:20:45] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:45] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-26 02:20:45] [INFO ] After 82ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:45] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-26 02:20:46] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 450/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 212/212 places, 450/450 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 890996 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 890996 steps, saw 111627 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-26 02:20:49] [INFO ] Flow matrix only has 445 transitions (discarded 5 similar events)
[2024-05-26 02:20:49] [INFO ] Invariant cache hit.
[2024-05-26 02:20:49] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:20:49] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2024-05-26 02:20:49] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:49] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-26 02:20:49] [INFO ] After 91ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:49] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-26 02:20:49] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 450/450 transitions.
Applied a total of 0 rules in 5 ms. Remains 212 /212 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 212/212 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 450/450 transitions.
Applied a total of 0 rules in 5 ms. Remains 212 /212 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2024-05-26 02:20:49] [INFO ] Flow matrix only has 445 transitions (discarded 5 similar events)
[2024-05-26 02:20:49] [INFO ] Invariant cache hit.
[2024-05-26 02:20:49] [INFO ] Implicit Places using invariants in 122 ms returned [8, 29, 52, 71, 98, 136, 158, 201]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 123 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 204/212 places, 450/450 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 183 transition count 429
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 63 place count 183 transition count 408
Applied a total of 63 rules in 8 ms. Remains 183 /204 variables (removed 21) and now considering 408/450 (removed 42) transitions.
[2024-05-26 02:20:49] [INFO ] Flow matrix only has 403 transitions (discarded 5 similar events)
// Phase 1: matrix 403 rows 183 cols
[2024-05-26 02:20:49] [INFO ] Computed 34 invariants in 2 ms
[2024-05-26 02:20:49] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 02:20:49] [INFO ] Flow matrix only has 403 transitions (discarded 5 similar events)
[2024-05-26 02:20:49] [INFO ] Invariant cache hit.
[2024-05-26 02:20:49] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-26 02:20:50] [INFO ] Implicit Places using invariants and state equation in 349 ms returned [39, 73, 110, 129]
Discarding 4 places :
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Implicit Place search using SMT with State Equation took 449 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 179/212 places, 398/450 transitions.
Applied a total of 0 rules in 8 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 593 ms. Remains : 179/212 places, 398/450 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 846990 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 846990 steps, saw 123777 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-26 02:20:53] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
// Phase 1: matrix 393 rows 179 cols
[2024-05-26 02:20:53] [INFO ] Computed 30 invariants in 5 ms
[2024-05-26 02:20:53] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:20:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-26 02:20:53] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-26 02:20:53] [INFO ] After 42ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:53] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-26 02:20:53] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 398/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 179/179 places, 398/398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 398/398 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 398/398 (removed 0) transitions.
[2024-05-26 02:20:53] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2024-05-26 02:20:53] [INFO ] Invariant cache hit.
[2024-05-26 02:20:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-26 02:20:53] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2024-05-26 02:20:53] [INFO ] Invariant cache hit.
[2024-05-26 02:20:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-26 02:20:54] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-26 02:20:54] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-26 02:20:54] [INFO ] Flow matrix only has 393 transitions (discarded 5 similar events)
[2024-05-26 02:20:54] [INFO ] Invariant cache hit.
[2024-05-26 02:20:54] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 526 ms. Remains : 179/179 places, 398/398 transitions.
Graph (trivial) has 69 edges and 179 vertex of which 48 / 179 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 476 edges and 155 vertex of which 79 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.0 ms
Discarding 76 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 85 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 79 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 78 transition count 151
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 78 transition count 150
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 131 place count 78 transition count 150
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 78 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 77 transition count 148
Applied a total of 133 rules in 10 ms. Remains 77 /179 variables (removed 102) and now considering 148/398 (removed 250) transitions.
Running SMT prover for 2 properties.
[2024-05-26 02:20:54] [INFO ] Flow matrix only has 142 transitions (discarded 6 similar events)
// Phase 1: matrix 142 rows 77 cols
[2024-05-26 02:20:54] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 02:20:54] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:20:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2024-05-26 02:20:54] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-26 02:20:54] [INFO ] After 17ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:20:54] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-26 02:20:54] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (OR (AND p1 p2) (AND p0 p2))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (OR (AND p1 p2) (AND p0 p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (F (NOT (OR (AND p1 p2) (AND p2 p0)))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 17 factoid took 573 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Applied a total of 0 rules in 20 ms. Remains 950 /950 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
// Phase 1: matrix 1193 rows 950 cols
[2024-05-26 02:20:55] [INFO ] Computed 42 invariants in 10 ms
[2024-05-26 02:20:55] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-26 02:20:55] [INFO ] Invariant cache hit.
[2024-05-26 02:20:56] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2024-05-26 02:20:56] [INFO ] Invariant cache hit.
[2024-05-26 02:20:56] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1345 ms. Remains : 950/950 places, 1193/1193 transitions.
Computed a total of 66 stabilizing places and 66 stable transitions
Computed a total of 66 stabilizing places and 66 stable transitions
Detected a total of 66/950 stabilizing places and 66/1193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (AND (NOT p1) p0)), (X (OR (AND p1 p2) (AND p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))))), (X (X (AND (NOT p1) p0))), (X (X (OR (AND p1 p2) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 326 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-26 02:20:57] [INFO ] Invariant cache hit.
[2024-05-26 02:20:57] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-26 02:20:57] [INFO ] [Nat]Absence check using 42 positive place invariants in 17 ms returned sat
[2024-05-26 02:20:58] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-26 02:20:59] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 235 ms.
[2024-05-26 02:20:59] [INFO ] After 1494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 326 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=54 )
Parikh walk visited 6 properties in 20 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (AND (NOT p1) p0)), (X (OR (AND p1 p2) (AND p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))))), (X (X (AND (NOT p1) p0))), (X (X (OR (AND p1 p2) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (NOT p2)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 17 factoid took 688 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Product exploration explored 100000 steps with 33244 reset in 568 ms.
Product exploration explored 100000 steps with 33198 reset in 562 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Graph (trivial) has 760 edges and 950 vertex of which 72 / 950 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 887 transition count 1130
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 125 place count 887 transition count 1174
Deduced a syphon composed of 170 places in 2 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 171 place count 887 transition count 1174
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 196 place count 862 transition count 1124
Deduced a syphon composed of 164 places in 2 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 221 place count 862 transition count 1124
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 221 place count 862 transition count 1130
Deduced a syphon composed of 167 places in 2 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 224 place count 862 transition count 1130
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 243 place count 843 transition count 1083
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 262 place count 843 transition count 1083
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 262 place count 843 transition count 1088
Deduced a syphon composed of 153 places in 2 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 267 place count 843 transition count 1088
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: -210
Deduced a syphon composed of 504 places in 1 ms
Iterating global reduction 1 with 351 rules applied. Total rules applied 618 place count 843 transition count 1298
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 687 place count 774 transition count 1202
Deduced a syphon composed of 449 places in 0 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 756 place count 774 transition count 1202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 760 place count 774 transition count 1198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 765 place count 769 transition count 1191
Deduced a syphon composed of 446 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 770 place count 769 transition count 1191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 772 place count 767 transition count 1186
Deduced a syphon composed of 446 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 774 place count 767 transition count 1186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 447 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 775 place count 767 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 776 place count 766 transition count 1185
Deduced a syphon composed of 446 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 777 place count 766 transition count 1185
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -238
Deduced a syphon composed of 481 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 812 place count 766 transition count 1423
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 835 place count 743 transition count 1322
Deduced a syphon composed of 458 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 858 place count 743 transition count 1322
Deduced a syphon composed of 458 places in 0 ms
Applied a total of 858 rules in 328 ms. Remains 743 /950 variables (removed 207) and now considering 1322/1193 (removed -129) transitions.
[2024-05-26 02:21:02] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-26 02:21:02] [INFO ] Flow matrix only has 1314 transitions (discarded 8 similar events)
// Phase 1: matrix 1314 rows 743 cols
[2024-05-26 02:21:02] [INFO ] Computed 42 invariants in 14 ms
[2024-05-26 02:21:02] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 743/950 places, 1322/1193 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 806 ms. Remains : 743/950 places, 1322/1193 transitions.
Built C files in :
/tmp/ltsmin5051999717383242105
[2024-05-26 02:21:02] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5051999717383242105
Running compilation step : cd /tmp/ltsmin5051999717383242105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1883 ms.
Running link step : cd /tmp/ltsmin5051999717383242105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5051999717383242105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1614379701769172790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 950 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1193/1193 transitions.
Applied a total of 0 rules in 23 ms. Remains 950 /950 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
// Phase 1: matrix 1193 rows 950 cols
[2024-05-26 02:21:17] [INFO ] Computed 42 invariants in 8 ms
[2024-05-26 02:21:18] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-26 02:21:18] [INFO ] Invariant cache hit.
[2024-05-26 02:21:18] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2024-05-26 02:21:18] [INFO ] Invariant cache hit.
[2024-05-26 02:21:19] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1335 ms. Remains : 950/950 places, 1193/1193 transitions.
Built C files in :
/tmp/ltsmin11821560449456110190
[2024-05-26 02:21:19] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11821560449456110190
Running compilation step : cd /tmp/ltsmin11821560449456110190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1789 ms.
Running link step : cd /tmp/ltsmin11821560449456110190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11821560449456110190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12545248842479797354.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 02:21:34] [INFO ] Flatten gal took : 45 ms
[2024-05-26 02:21:34] [INFO ] Flatten gal took : 45 ms
[2024-05-26 02:21:34] [INFO ] Time to serialize gal into /tmp/LTL3116473799414782040.gal : 12 ms
[2024-05-26 02:21:34] [INFO ] Time to serialize properties into /tmp/LTL16127742751501640830.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3116473799414782040.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11691890478471730131.hoa' '-atoms' '/tmp/LTL16127742751501640830.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16127742751501640830.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11691890478471730131.hoa
Detected timeout of ITS tools.
[2024-05-26 02:21:49] [INFO ] Flatten gal took : 38 ms
[2024-05-26 02:21:49] [INFO ] Flatten gal took : 40 ms
[2024-05-26 02:21:49] [INFO ] Time to serialize gal into /tmp/LTL7314139561230752910.gal : 6 ms
[2024-05-26 02:21:49] [INFO ] Time to serialize properties into /tmp/LTL17096865145880605052.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7314139561230752910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17096865145880605052.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("((p1324==0)||(p865==1))")U("(p1710==1)"))U(X(G("((p2012==0)||(p93==1))")))))
Formula 0 simplified : (!"((p1324==0)||(p865==1))" R !"(p1710==1)") R XF!"((p2012==0)||(p93==1))"
Detected timeout of ITS tools.
[2024-05-26 02:22:04] [INFO ] Flatten gal took : 38 ms
[2024-05-26 02:22:04] [INFO ] Applying decomposition
[2024-05-26 02:22:04] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3937573405636165677.txt' '-o' '/tmp/graph3937573405636165677.bin' '-w' '/tmp/graph3937573405636165677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3937573405636165677.bin' '-l' '-1' '-v' '-w' '/tmp/graph3937573405636165677.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:22:05] [INFO ] Decomposing Gal with order
[2024-05-26 02:22:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:22:05] [INFO ] Removed a total of 484 redundant transitions.
[2024-05-26 02:22:05] [INFO ] Flatten gal took : 101 ms
[2024-05-26 02:22:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 24 ms.
[2024-05-26 02:22:05] [INFO ] Time to serialize gal into /tmp/LTL2150051815758750493.gal : 16 ms
[2024-05-26 02:22:05] [INFO ] Time to serialize properties into /tmp/LTL12093549211582062265.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2150051815758750493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12093549211582062265.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((("((i13.u250.p1324==0)||(i7.u182.p865==1))")U("(i15.u321.p1710==1)"))U(X(G("((i17.i0.i3.u356.p2012==0)||(i0.i0.i0.u35.p93==1))")))...157
Formula 0 simplified : (!"((i13.u250.p1324==0)||(i7.u182.p865==1))" R !"(i15.u321.p1710==1)") R XF!"((i17.i0.i3.u356.p2012==0)||(i0.i0.i0.u35.p93==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15707624429164869471
[2024-05-26 02:22:20] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15707624429164869471
Running compilation step : cd /tmp/ltsmin15707624429164869471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1816 ms.
Running link step : cd /tmp/ltsmin15707624429164869471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15707624429164869471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true)) U X([]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-3B-LTLCardinality-10 finished in 115523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(X(G(p1))))))))'
Support contains 4 out of 984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 969 transition count 1223
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 969 transition count 1223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 969 transition count 1220
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 961 transition count 1211
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 961 transition count 1211
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 954 transition count 1201
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 954 transition count 1201
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 950 transition count 1196
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 950 transition count 1196
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 946 transition count 1189
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 946 transition count 1189
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 942 transition count 1184
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 942 transition count 1184
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 938 transition count 1180
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 938 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 98 place count 938 transition count 1177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 937 transition count 1176
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 937 transition count 1176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 937 transition count 1175
Applied a total of 101 rules in 189 ms. Remains 937 /984 variables (removed 47) and now considering 1175/1238 (removed 63) transitions.
// Phase 1: matrix 1175 rows 937 cols
[2024-05-26 02:22:35] [INFO ] Computed 42 invariants in 7 ms
[2024-05-26 02:22:35] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-26 02:22:35] [INFO ] Invariant cache hit.
[2024-05-26 02:22:36] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2024-05-26 02:22:36] [INFO ] Invariant cache hit.
[2024-05-26 02:22:37] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 937/984 places, 1175/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1488 ms. Remains : 937/984 places, 1175/1238 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (EQ s899 0) (EQ s779 1)), p1:(OR (EQ s899 0) (EQ s779 1) (EQ s580 0) (EQ s777 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 160 reset in 243 ms.
Product exploration explored 100000 steps with 160 reset in 261 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:22:38] [INFO ] Invariant cache hit.
[2024-05-26 02:22:38] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:22:38] [INFO ] [Nat]Absence check using 42 positive place invariants in 18 ms returned sat
[2024-05-26 02:22:38] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:22:38] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-26 02:22:38] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 795 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=198 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 937 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 937/937 places, 1175/1175 transitions.
Applied a total of 0 rules in 19 ms. Remains 937 /937 variables (removed 0) and now considering 1175/1175 (removed 0) transitions.
[2024-05-26 02:22:39] [INFO ] Invariant cache hit.
[2024-05-26 02:22:39] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-26 02:22:39] [INFO ] Invariant cache hit.
[2024-05-26 02:22:40] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2024-05-26 02:22:40] [INFO ] Invariant cache hit.
[2024-05-26 02:22:40] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1321 ms. Remains : 937/937 places, 1175/1175 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 296931 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{0=1}
Probabilistic random walk after 296931 steps, saw 145445 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-26 02:22:44] [INFO ] Invariant cache hit.
[2024-05-26 02:22:44] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:22:44] [INFO ] [Nat]Absence check using 42 positive place invariants in 18 ms returned sat
[2024-05-26 02:22:44] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:22:45] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-26 02:22:45] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 292 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=146 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 327 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 221 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 158 reset in 216 ms.
Product exploration explored 100000 steps with 158 reset in 238 ms.
Applying partial POR strategy [true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 246 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 937 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 937/937 places, 1175/1175 transitions.
Graph (trivial) has 750 edges and 937 vertex of which 72 / 937 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 874 transition count 1112
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 124 place count 874 transition count 1156
Deduced a syphon composed of 169 places in 2 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 170 place count 874 transition count 1156
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 194 place count 850 transition count 1109
Deduced a syphon composed of 163 places in 2 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 218 place count 850 transition count 1109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 218 place count 850 transition count 1115
Deduced a syphon composed of 166 places in 2 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 221 place count 850 transition count 1115
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 239 place count 832 transition count 1071
Deduced a syphon composed of 148 places in 2 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 257 place count 832 transition count 1071
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 257 place count 832 transition count 1076
Deduced a syphon composed of 153 places in 2 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 262 place count 832 transition count 1076
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: -205
Deduced a syphon composed of 497 places in 1 ms
Iterating global reduction 1 with 344 rules applied. Total rules applied 606 place count 832 transition count 1281
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 675 place count 763 transition count 1185
Deduced a syphon composed of 442 places in 0 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 744 place count 763 transition count 1185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 748 place count 763 transition count 1181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 753 place count 758 transition count 1174
Deduced a syphon composed of 439 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 758 place count 758 transition count 1174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 760 place count 756 transition count 1167
Deduced a syphon composed of 439 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 762 place count 756 transition count 1167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 440 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 763 place count 756 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 764 place count 755 transition count 1166
Deduced a syphon composed of 439 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 765 place count 755 transition count 1166
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -244
Deduced a syphon composed of 474 places in 1 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 800 place count 755 transition count 1410
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 823 place count 732 transition count 1310
Deduced a syphon composed of 451 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 846 place count 732 transition count 1310
Deduced a syphon composed of 451 places in 0 ms
Applied a total of 846 rules in 203 ms. Remains 732 /937 variables (removed 205) and now considering 1310/1175 (removed -135) transitions.
[2024-05-26 02:22:47] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-26 02:22:47] [INFO ] Flow matrix only has 1300 transitions (discarded 10 similar events)
// Phase 1: matrix 1300 rows 732 cols
[2024-05-26 02:22:47] [INFO ] Computed 42 invariants in 21 ms
[2024-05-26 02:22:47] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 732/937 places, 1310/1175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 737 ms. Remains : 732/937 places, 1310/1175 transitions.
Built C files in :
/tmp/ltsmin15209736925465219868
[2024-05-26 02:22:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15209736925465219868
Running compilation step : cd /tmp/ltsmin15209736925465219868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1839 ms.
Running link step : cd /tmp/ltsmin15209736925465219868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15209736925465219868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased777748392205560650.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 937 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 937/937 places, 1175/1175 transitions.
Applied a total of 0 rules in 22 ms. Remains 937 /937 variables (removed 0) and now considering 1175/1175 (removed 0) transitions.
// Phase 1: matrix 1175 rows 937 cols
[2024-05-26 02:23:02] [INFO ] Computed 42 invariants in 8 ms
[2024-05-26 02:23:02] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-26 02:23:02] [INFO ] Invariant cache hit.
[2024-05-26 02:23:03] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2024-05-26 02:23:03] [INFO ] Invariant cache hit.
[2024-05-26 02:23:04] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1290 ms. Remains : 937/937 places, 1175/1175 transitions.
Built C files in :
/tmp/ltsmin5042742603711162497
[2024-05-26 02:23:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5042742603711162497
Running compilation step : cd /tmp/ltsmin5042742603711162497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1809 ms.
Running link step : cd /tmp/ltsmin5042742603711162497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5042742603711162497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9049934213439527626.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 02:23:19] [INFO ] Flatten gal took : 25 ms
[2024-05-26 02:23:19] [INFO ] Flatten gal took : 25 ms
[2024-05-26 02:23:19] [INFO ] Time to serialize gal into /tmp/LTL1650867864553569461.gal : 4 ms
[2024-05-26 02:23:19] [INFO ] Time to serialize properties into /tmp/LTL15679630652535989637.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1650867864553569461.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11495324208408381293.hoa' '-atoms' '/tmp/LTL15679630652535989637.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15679630652535989637.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11495324208408381293.hoa
Detected timeout of ITS tools.
[2024-05-26 02:23:34] [INFO ] Flatten gal took : 27 ms
[2024-05-26 02:23:34] [INFO ] Flatten gal took : 26 ms
[2024-05-26 02:23:34] [INFO ] Time to serialize gal into /tmp/LTL2464191353613059043.gal : 4 ms
[2024-05-26 02:23:34] [INFO ] Time to serialize properties into /tmp/LTL1939807939766452927.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2464191353613059043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1939807939766452927.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X(X(G("(((p2031==0)||(p1705==1))||((p1203==0)||(p1702==1)))"))))&&("((p2031==0)||(p1705==1))"))))))
Formula 0 simplified : XXX(!"((p2031==0)||(p1705==1))" | XXF!"(((p2031==0)||(p1705==1))||((p1203==0)||(p1702==1)))")
Detected timeout of ITS tools.
[2024-05-26 02:23:49] [INFO ] Flatten gal took : 25 ms
[2024-05-26 02:23:49] [INFO ] Applying decomposition
[2024-05-26 02:23:49] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3976815521720070900.txt' '-o' '/tmp/graph3976815521720070900.bin' '-w' '/tmp/graph3976815521720070900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3976815521720070900.bin' '-l' '-1' '-v' '-w' '/tmp/graph3976815521720070900.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:23:49] [INFO ] Decomposing Gal with order
[2024-05-26 02:23:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:23:49] [INFO ] Removed a total of 470 redundant transitions.
[2024-05-26 02:23:49] [INFO ] Flatten gal took : 50 ms
[2024-05-26 02:23:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 16 ms.
[2024-05-26 02:23:49] [INFO ] Time to serialize gal into /tmp/LTL16921911653582369695.gal : 11 ms
[2024-05-26 02:23:49] [INFO ] Time to serialize properties into /tmp/LTL6953639564221595252.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16921911653582369695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6953639564221595252.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X(X(G("(((i15.i1.i1.u357.p2031==0)||(i12.u307.p1705==1))||((i9.u233.p1203==0)||(i12.u307.p1702==1)))"))))&&("((i15.i1.i1.u35...195
Formula 0 simplified : XXX(!"((i15.i1.i1.u357.p2031==0)||(i12.u307.p1705==1))" | XXF!"(((i15.i1.i1.u357.p2031==0)||(i12.u307.p1705==1))||((i9.u233.p1203==0...181
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17947608925438953931
[2024-05-26 02:24:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17947608925438953931
Running compilation step : cd /tmp/ltsmin17947608925438953931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1887 ms.
Running link step : cd /tmp/ltsmin17947608925438953931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17947608925438953931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((X(X([]((LTLAPp0==true))))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-3B-LTLCardinality-11 finished in 104335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Graph (trivial) has 795 edges and 984 vertex of which 72 / 984 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 920 transition count 1039
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 272 place count 785 transition count 1038
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 272 place count 785 transition count 961
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 426 place count 708 transition count 961
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 458 place count 676 transition count 897
Iterating global reduction 2 with 32 rules applied. Total rules applied 490 place count 676 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 491 place count 676 transition count 896
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 491 place count 676 transition count 894
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 495 place count 674 transition count 894
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 501 place count 668 transition count 884
Iterating global reduction 3 with 6 rules applied. Total rules applied 507 place count 668 transition count 884
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 509 place count 668 transition count 882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 510 place count 667 transition count 882
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 511 place count 666 transition count 881
Iterating global reduction 5 with 1 rules applied. Total rules applied 512 place count 666 transition count 881
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 513 place count 665 transition count 879
Iterating global reduction 5 with 1 rules applied. Total rules applied 514 place count 665 transition count 879
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 515 place count 665 transition count 878
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 516 place count 664 transition count 878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 517 place count 663 transition count 877
Iterating global reduction 7 with 1 rules applied. Total rules applied 518 place count 663 transition count 877
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 519 place count 663 transition count 876
Performed 348 Post agglomeration using F-continuation condition.Transition count delta: 348
Deduced a syphon composed of 348 places in 0 ms
Reduce places removed 348 places and 0 transitions.
Iterating global reduction 8 with 696 rules applied. Total rules applied 1215 place count 315 transition count 528
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1231 place count 299 transition count 498
Iterating global reduction 8 with 16 rules applied. Total rules applied 1247 place count 299 transition count 498
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1249 place count 299 transition count 496
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1254 place count 294 transition count 486
Iterating global reduction 9 with 5 rules applied. Total rules applied 1259 place count 294 transition count 486
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1262 place count 294 transition count 483
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1264 place count 292 transition count 479
Iterating global reduction 10 with 2 rules applied. Total rules applied 1266 place count 292 transition count 479
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1292 place count 279 transition count 478
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 1299 place count 279 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1300 place count 278 transition count 477
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1305 place count 273 transition count 477
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 11 with 28 rules applied. Total rules applied 1333 place count 259 transition count 463
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1347 place count 259 transition count 449
Applied a total of 1347 rules in 133 ms. Remains 259 /984 variables (removed 725) and now considering 449/1238 (removed 789) transitions.
[2024-05-26 02:24:19] [INFO ] Flow matrix only has 441 transitions (discarded 8 similar events)
// Phase 1: matrix 441 rows 259 cols
[2024-05-26 02:24:19] [INFO ] Computed 37 invariants in 2 ms
[2024-05-26 02:24:20] [INFO ] Implicit Places using invariants in 135 ms returned [7, 32, 65, 88]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 137 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/984 places, 449/1238 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 245 transition count 439
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 29 place count 245 transition count 430
Applied a total of 29 rules in 6 ms. Remains 245 /255 variables (removed 10) and now considering 430/449 (removed 19) transitions.
[2024-05-26 02:24:20] [INFO ] Flow matrix only has 422 transitions (discarded 8 similar events)
// Phase 1: matrix 422 rows 245 cols
[2024-05-26 02:24:20] [INFO ] Computed 33 invariants in 1 ms
[2024-05-26 02:24:20] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-26 02:24:20] [INFO ] Flow matrix only has 422 transitions (discarded 8 similar events)
[2024-05-26 02:24:20] [INFO ] Invariant cache hit.
[2024-05-26 02:24:20] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:24:20] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [205]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 363 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 244/984 places, 430/1238 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 243 transition count 429
Applied a total of 2 rules in 7 ms. Remains 243 /244 variables (removed 1) and now considering 429/430 (removed 1) transitions.
[2024-05-26 02:24:20] [INFO ] Flow matrix only has 421 transitions (discarded 8 similar events)
// Phase 1: matrix 421 rows 243 cols
[2024-05-26 02:24:20] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:24:20] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-26 02:24:20] [INFO ] Flow matrix only has 421 transitions (discarded 8 similar events)
[2024-05-26 02:24:20] [INFO ] Invariant cache hit.
[2024-05-26 02:24:20] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:24:20] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 243/984 places, 429/1238 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1012 ms. Remains : 243/984 places, 429/1238 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s7 1), p1:(AND (NEQ s172 0) (NEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-12 finished in 1130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 984 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Graph (trivial) has 797 edges and 984 vertex of which 72 / 984 are part of one of the 9 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 920 transition count 1039
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 273 place count 785 transition count 1037
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 273 place count 785 transition count 960
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 427 place count 708 transition count 960
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 459 place count 676 transition count 896
Iterating global reduction 2 with 32 rules applied. Total rules applied 491 place count 676 transition count 896
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 492 place count 676 transition count 895
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 492 place count 676 transition count 893
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 496 place count 674 transition count 893
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 501 place count 669 transition count 884
Iterating global reduction 3 with 5 rules applied. Total rules applied 506 place count 669 transition count 884
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 507 place count 669 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 508 place count 668 transition count 883
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 509 place count 667 transition count 882
Iterating global reduction 5 with 1 rules applied. Total rules applied 510 place count 667 transition count 882
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 511 place count 666 transition count 880
Iterating global reduction 5 with 1 rules applied. Total rules applied 512 place count 666 transition count 880
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 513 place count 666 transition count 879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 514 place count 665 transition count 879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 515 place count 664 transition count 878
Iterating global reduction 7 with 1 rules applied. Total rules applied 516 place count 664 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 517 place count 664 transition count 877
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 351
Deduced a syphon composed of 351 places in 0 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 8 with 702 rules applied. Total rules applied 1219 place count 313 transition count 526
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1235 place count 297 transition count 496
Iterating global reduction 8 with 16 rules applied. Total rules applied 1251 place count 297 transition count 496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1253 place count 297 transition count 494
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1258 place count 292 transition count 484
Iterating global reduction 9 with 5 rules applied. Total rules applied 1263 place count 292 transition count 484
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1266 place count 292 transition count 481
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1268 place count 290 transition count 477
Iterating global reduction 10 with 2 rules applied. Total rules applied 1270 place count 290 transition count 477
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 1298 place count 276 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1299 place count 275 transition count 475
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1308 place count 266 transition count 475
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 11 with 48 rules applied. Total rules applied 1356 place count 242 transition count 451
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 1380 place count 242 transition count 427
Applied a total of 1380 rules in 120 ms. Remains 242 /984 variables (removed 742) and now considering 427/1238 (removed 811) transitions.
[2024-05-26 02:24:21] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
// Phase 1: matrix 419 rows 242 cols
[2024-05-26 02:24:21] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:24:21] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-26 02:24:21] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2024-05-26 02:24:21] [INFO ] Invariant cache hit.
[2024-05-26 02:24:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:24:21] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [200]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 358 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/984 places, 427/1238 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 240 transition count 426
Applied a total of 2 rules in 8 ms. Remains 240 /241 variables (removed 1) and now considering 426/427 (removed 1) transitions.
[2024-05-26 02:24:21] [INFO ] Flow matrix only has 418 transitions (discarded 8 similar events)
// Phase 1: matrix 418 rows 240 cols
[2024-05-26 02:24:21] [INFO ] Computed 33 invariants in 2 ms
[2024-05-26 02:24:21] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-26 02:24:21] [INFO ] Flow matrix only has 418 transitions (discarded 8 similar events)
[2024-05-26 02:24:21] [INFO ] Invariant cache hit.
[2024-05-26 02:24:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:24:21] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 240/984 places, 426/1238 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 799 ms. Remains : 240/984 places, 426/1238 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s233 0) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-13 finished in 872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 967 transition count 1221
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 967 transition count 1221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 967 transition count 1219
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 957 transition count 1206
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 957 transition count 1206
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 948 transition count 1194
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 948 transition count 1194
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 943 transition count 1188
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 943 transition count 1188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 943 transition count 1187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 939 transition count 1180
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 939 transition count 1180
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 935 transition count 1175
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 935 transition count 1175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 931 transition count 1171
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 931 transition count 1171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 931 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 930 transition count 1167
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 930 transition count 1167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 930 transition count 1166
Applied a total of 115 rules in 131 ms. Remains 930 /984 variables (removed 54) and now considering 1166/1238 (removed 72) transitions.
// Phase 1: matrix 1166 rows 930 cols
[2024-05-26 02:24:22] [INFO ] Computed 42 invariants in 9 ms
[2024-05-26 02:24:22] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-26 02:24:22] [INFO ] Invariant cache hit.
[2024-05-26 02:24:22] [INFO ] Implicit Places using invariants and state equation in 636 ms returned [776]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 858 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/984 places, 1166/1238 transitions.
Applied a total of 0 rules in 17 ms. Remains 929 /929 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1006 ms. Remains : 929/984 places, 1166/1238 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s534 0) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4753 steps with 7 reset in 15 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLCardinality-15 finished in 1108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(G(p2))))'
Found a Lengthening insensitive property : NoC3x3-PT-3B-LTLCardinality-10
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 5 out of 984 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 984/984 places, 1238/1238 transitions.
Graph (trivial) has 793 edges and 984 vertex of which 72 / 984 are part of one of the 9 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 920 transition count 1040
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 271 place count 786 transition count 1038
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 271 place count 786 transition count 961
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 425 place count 709 transition count 961
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 453 place count 681 transition count 901
Iterating global reduction 2 with 28 rules applied. Total rules applied 481 place count 681 transition count 901
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 681 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 482 place count 681 transition count 899
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 680 transition count 899
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 489 place count 675 transition count 891
Iterating global reduction 3 with 5 rules applied. Total rules applied 494 place count 675 transition count 891
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 495 place count 675 transition count 890
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 4 with 710 rules applied. Total rules applied 1205 place count 320 transition count 535
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1219 place count 306 transition count 509
Iterating global reduction 4 with 14 rules applied. Total rules applied 1233 place count 306 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1235 place count 306 transition count 507
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1239 place count 302 transition count 499
Iterating global reduction 5 with 4 rules applied. Total rules applied 1243 place count 302 transition count 499
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1245 place count 302 transition count 497
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1247 place count 300 transition count 493
Iterating global reduction 6 with 2 rules applied. Total rules applied 1249 place count 300 transition count 493
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1275 place count 287 transition count 492
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1276 place count 287 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1277 place count 286 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1278 place count 285 transition count 491
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 7 with 4 rules applied. Total rules applied 1282 place count 283 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1284 place count 283 transition count 487
Applied a total of 1284 rules in 96 ms. Remains 283 /984 variables (removed 701) and now considering 487/1238 (removed 751) transitions.
[2024-05-26 02:24:23] [INFO ] Flow matrix only has 479 transitions (discarded 8 similar events)
// Phase 1: matrix 479 rows 283 cols
[2024-05-26 02:24:23] [INFO ] Computed 41 invariants in 2 ms
[2024-05-26 02:24:23] [INFO ] Implicit Places using invariants in 136 ms returned [7, 31, 64, 87, 122, 178, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 138 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 276/984 places, 487/1238 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 257 transition count 468
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 57 place count 257 transition count 449
Applied a total of 57 rules in 6 ms. Remains 257 /276 variables (removed 19) and now considering 449/487 (removed 38) transitions.
[2024-05-26 02:24:23] [INFO ] Flow matrix only has 441 transitions (discarded 8 similar events)
// Phase 1: matrix 441 rows 257 cols
[2024-05-26 02:24:23] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:24:23] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-26 02:24:23] [INFO ] Flow matrix only has 441 transitions (discarded 8 similar events)
[2024-05-26 02:24:23] [INFO ] Invariant cache hit.
[2024-05-26 02:24:23] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-26 02:24:23] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [208]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 410 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 256/984 places, 449/1238 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 448
Applied a total of 2 rules in 6 ms. Remains 255 /256 variables (removed 1) and now considering 448/449 (removed 1) transitions.
[2024-05-26 02:24:23] [INFO ] Flow matrix only has 440 transitions (discarded 8 similar events)
// Phase 1: matrix 440 rows 255 cols
[2024-05-26 02:24:23] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:24:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-26 02:24:23] [INFO ] Flow matrix only has 440 transitions (discarded 8 similar events)
[2024-05-26 02:24:23] [INFO ] Invariant cache hit.
[2024-05-26 02:24:24] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-26 02:24:24] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 255/984 places, 448/1238 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 1050 ms. Remains : 255/984 places, 448/1238 transitions.
Running random walk in product with property : NoC3x3-PT-3B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (EQ s243 0) (EQ s7 1)), p1:(EQ s209 1), p0:(OR (EQ s166 0) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 42639 steps with 6434 reset in 208 ms.
Treatment of property NoC3x3-PT-3B-LTLCardinality-10 finished in 1507 ms.
FORMULA NoC3x3-PT-3B-LTLCardinality-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(X(G(p1))))))))'
[2024-05-26 02:24:24] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin616190877532164691
[2024-05-26 02:24:24] [INFO ] Computing symmetric may disable matrix : 1238 transitions.
[2024-05-26 02:24:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:24:24] [INFO ] Computing symmetric may enable matrix : 1238 transitions.
[2024-05-26 02:24:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:24:24] [INFO ] Applying decomposition
[2024-05-26 02:24:24] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4340171248521429845.txt' '-o' '/tmp/graph4340171248521429845.bin' '-w' '/tmp/graph4340171248521429845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4340171248521429845.bin' '-l' '-1' '-v' '-w' '/tmp/graph4340171248521429845.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:24:24] [INFO ] Decomposing Gal with order
[2024-05-26 02:24:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:24:24] [INFO ] Removed a total of 511 redundant transitions.
[2024-05-26 02:24:24] [INFO ] Flatten gal took : 47 ms
[2024-05-26 02:24:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 17 ms.
[2024-05-26 02:24:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality6136762899111026995.gal : 8 ms
[2024-05-26 02:24:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality16359325415758311499.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6136762899111026995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16359325415758311499.ltl' '-c' '-stutter-deadlock'
[2024-05-26 02:24:24] [INFO ] Computing Do-Not-Accords matrix : 1238 transitions.

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2024-05-26 02:24:24] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:24:24] [INFO ] Built C files in 377ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin616190877532164691
Running compilation step : cd /tmp/ltsmin616190877532164691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X(X(X(("((i16.i1.i1.u375.p2031==0)||(i14.i2.i1.u322.p1705==1))")&&(X(X(G("(((i16.i1.i1.u375.p2031==0)||(i14.i2.i1.u322.p1705==1))||...214
Formula 0 simplified : XXX(!"((i16.i1.i1.u375.p2031==0)||(i14.i2.i1.u322.p1705==1))" | XXF!"(((i16.i1.i1.u375.p2031==0)||(i14.i2.i1.u322.p1705==1))||((i10....200
Compilation finished in 3615 ms.
Running link step : cd /tmp/ltsmin616190877532164691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin616190877532164691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(((LTLAPp3==true)&&X(X([]((LTLAPp4==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.151: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.151: LTL layer: formula: X(X(X(((LTLAPp3==true)&&X(X([]((LTLAPp4==true))))))))
pins2lts-mc-linux64( 5/ 8), 0.151: "X(X(X(((LTLAPp3==true)&&X(X([]((LTLAPp4==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.161: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.162: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.164: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.166: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.174: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.218: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.219: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.569: DFS-FIFO for weak LTL, using special progress label 1244
pins2lts-mc-linux64( 0/ 8), 0.569: There are 1245 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.569: State length is 985, there are 1247 groups
pins2lts-mc-linux64( 0/ 8), 0.569: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.569: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.569: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.569: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.601: ~1 levels ~960 states ~3288 transitions
pins2lts-mc-linux64( 6/ 8), 0.630: ~1 levels ~1920 states ~7392 transitions
pins2lts-mc-linux64( 6/ 8), 0.743: ~1 levels ~3840 states ~16568 transitions
pins2lts-mc-linux64( 6/ 8), 0.998: ~1 levels ~7680 states ~40696 transitions
pins2lts-mc-linux64( 6/ 8), 1.596: ~1 levels ~15360 states ~87040 transitions
pins2lts-mc-linux64( 6/ 8), 2.679: ~1 levels ~30720 states ~183152 transitions
pins2lts-mc-linux64( 6/ 8), 4.670: ~1 levels ~61440 states ~397448 transitions
pins2lts-mc-linux64( 7/ 8), 8.689: ~1 levels ~122880 states ~796960 transitions
pins2lts-mc-linux64( 7/ 8), 16.183: ~1 levels ~245760 states ~1698752 transitions
pins2lts-mc-linux64( 7/ 8), 31.298: ~1 levels ~491520 states ~3671800 transitions
pins2lts-mc-linux64( 7/ 8), 60.705: ~1 levels ~983040 states ~7610272 transitions
pins2lts-mc-linux64( 7/ 8), 119.869: ~1 levels ~1966080 states ~16124120 transitions
pins2lts-mc-linux64( 5/ 8), 242.903: ~1 levels ~3932160 states ~35693568 transitions
pins2lts-mc-linux64( 7/ 8), 492.911: ~1 levels ~7864320 states ~74291616 transitions
pins2lts-mc-linux64( 7/ 8), 1002.859: ~1 levels ~15728640 states ~155669456 transitions
pins2lts-mc-linux64( 5/ 8), 1284.591: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1284.726:
pins2lts-mc-linux64( 0/ 8), 1284.726: mean standard work distribution: 3.1% (states) 5.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1284.727:
pins2lts-mc-linux64( 0/ 8), 1284.727: Explored 18856567 states 212521652 transitions, fanout: 11.270
pins2lts-mc-linux64( 0/ 8), 1284.727: Total exploration time 1284.110 sec (1284.010 sec minimum, 1284.070 sec on average)
pins2lts-mc-linux64( 0/ 8), 1284.727: States per second: 14685, Transitions per second: 165501
pins2lts-mc-linux64( 0/ 8), 1284.727:
pins2lts-mc-linux64( 0/ 8), 1284.727: Progress states detected: 31729159
pins2lts-mc-linux64( 0/ 8), 1284.727: Redundant explorations: -40.5704
pins2lts-mc-linux64( 0/ 8), 1284.727:
pins2lts-mc-linux64( 0/ 8), 1284.727: Queue width: 8B, total height: 22400809, memory: 170.90MB
pins2lts-mc-linux64( 0/ 8), 1284.727: Tree memory: 498.1MB, 16.5 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1284.727: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1284.727: Stored 1266 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1284.762: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1284.762: Est. total memory use: 669.0MB (~1194.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin616190877532164691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(((LTLAPp3==true)&&X(X([]((LTLAPp4==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin616190877532164691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(((LTLAPp3==true)&&X(X([]((LTLAPp4==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-26 02:45:58] [INFO ] Applying decomposition
[2024-05-26 02:45:58] [INFO ] Flatten gal took : 137 ms
[2024-05-26 02:45:58] [INFO ] Decomposing Gal with order
[2024-05-26 02:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:45:59] [INFO ] Removed a total of 271 redundant transitions.
[2024-05-26 02:45:59] [INFO ] Flatten gal took : 99 ms
[2024-05-26 02:45:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 966 labels/synchronizations in 334 ms.
[2024-05-26 02:45:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality12165415796461329000.gal : 16 ms
[2024-05-26 02:45:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality14467478401378373926.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12165415796461329000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14467478401378373926.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((i0.u129.p2031==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u119.p1705==1))")&&(X(X(G("(((i0.u129.p2031==0)||(i0.i0.i0.i0.i0.i0....349
Formula 0 simplified : XXX(!"((i0.u129.p2031==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u119.p1705==1))" | XXF!"(((i0.u129.p2031==0)||(i0.i0.i0.i0.i0.i0.i0.i0....335
Detected timeout of ITS tools.
[2024-05-26 03:07:49] [INFO ] Flatten gal took : 367 ms
[2024-05-26 03:07:51] [INFO ] Input system was already deterministic with 1238 transitions.
[2024-05-26 03:07:51] [INFO ] Transformed 984 places.
[2024-05-26 03:07:51] [INFO ] Transformed 1238 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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
[2024-05-26 03:07:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality5680551753354636202.gal : 36 ms
[2024-05-26 03:07:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality3674786563932481874.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5680551753354636202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3674786563932481874.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(("((p2031==0)||(p1705==1))")&&(X(X(G("(((p2031==0)||(p1705==1))||((p1203==0)||(p1702==1)))")))))))))
Formula 0 simplified : XXX(!"((p2031==0)||(p1705==1))" | XXF!"(((p2031==0)||(p1705==1))||((p1203==0)||(p1702==1)))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 152700 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16226284 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="NoC3x3-PT-3B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-3B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372700372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;