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.r131-smll-171624288300098.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 DLCround-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288300098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 13 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 145K Apr 13 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 674K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716391251400

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-05b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 15:20:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 15:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:20:54] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2024-05-22 15:20:54] [INFO ] Transformed 1999 places.
[2024-05-22 15:20:54] [INFO ] Transformed 2887 transitions.
[2024-05-22 15:20:54] [INFO ] Found NUPN structural information;
[2024-05-22 15:20:54] [INFO ] Parsed PT model containing 1999 places and 2887 transitions and 7649 arcs in 531 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-05b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1999/1999 places, 2887/2887 transitions.
Discarding 339 places :
Symmetric choice reduction at 0 with 339 rule applications. Total rules 339 place count 1660 transition count 2548
Iterating global reduction 0 with 339 rules applied. Total rules applied 678 place count 1660 transition count 2548
Discarding 259 places :
Symmetric choice reduction at 0 with 259 rule applications. Total rules 937 place count 1401 transition count 2289
Iterating global reduction 0 with 259 rules applied. Total rules applied 1196 place count 1401 transition count 2289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1202 place count 1401 transition count 2283
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 1250 place count 1353 transition count 2199
Iterating global reduction 1 with 48 rules applied. Total rules applied 1298 place count 1353 transition count 2199
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 1331 place count 1320 transition count 2166
Iterating global reduction 1 with 33 rules applied. Total rules applied 1364 place count 1320 transition count 2166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1368 place count 1320 transition count 2162
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1385 place count 1303 transition count 2145
Iterating global reduction 2 with 17 rules applied. Total rules applied 1402 place count 1303 transition count 2145
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1419 place count 1286 transition count 2128
Iterating global reduction 2 with 17 rules applied. Total rules applied 1436 place count 1286 transition count 2128
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1453 place count 1269 transition count 2111
Iterating global reduction 2 with 17 rules applied. Total rules applied 1470 place count 1269 transition count 2111
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1480 place count 1259 transition count 2101
Iterating global reduction 2 with 10 rules applied. Total rules applied 1490 place count 1259 transition count 2101
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1495 place count 1254 transition count 2096
Iterating global reduction 2 with 5 rules applied. Total rules applied 1500 place count 1254 transition count 2096
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1505 place count 1249 transition count 2091
Iterating global reduction 2 with 5 rules applied. Total rules applied 1510 place count 1249 transition count 2091
Applied a total of 1510 rules in 1337 ms. Remains 1249 /1999 variables (removed 750) and now considering 2091/2887 (removed 796) transitions.
// Phase 1: matrix 2091 rows 1249 cols
[2024-05-22 15:20:56] [INFO ] Computed 88 invariants in 46 ms
[2024-05-22 15:20:57] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-05-22 15:20:57] [INFO ] Invariant cache hit.
[2024-05-22 15:20:59] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2827 ms to find 0 implicit places.
[2024-05-22 15:20:59] [INFO ] Invariant cache hit.
[2024-05-22 15:21:01] [INFO ] Dead Transitions using invariants and state equation in 2165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1249/1999 places, 2091/2887 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6332 ms. Remains : 1249/1999 places, 2091/2887 transitions.
Support contains 43 out of 1249 places after structural reductions.
[2024-05-22 15:21:01] [INFO ] Flatten gal took : 252 ms
[2024-05-22 15:21:01] [INFO ] Flatten gal took : 132 ms
[2024-05-22 15:21:02] [INFO ] Input system was already deterministic with 2091 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 35) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2024-05-22 15:21:03] [INFO ] Invariant cache hit.
[2024-05-22 15:21:03] [INFO ] [Real]Absence check using 88 positive place invariants in 77 ms returned sat
[2024-05-22 15:21:03] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 15:21:04] [INFO ] [Nat]Absence check using 88 positive place invariants in 64 ms returned sat
[2024-05-22 15:21:05] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 15:21:06] [INFO ] After 1849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 382 ms.
[2024-05-22 15:21:06] [INFO ] After 2782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 399 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=133 )
Parikh walk visited 5 properties in 43 ms.
Computed a total of 178 stabilizing places and 178 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Graph (trivial) has 1142 edges and 1249 vertex of which 328 / 1249 are part of one of the 27 SCC in 6 ms
Free SCC test removed 301 places
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 325 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 217 place count 947 transition count 1549
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 246 rules applied. Total rules applied 463 place count 731 transition count 1519
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 484 place count 711 transition count 1518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 485 place count 710 transition count 1518
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 485 place count 710 transition count 1429
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 663 place count 621 transition count 1429
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 708 place count 576 transition count 1225
Iterating global reduction 4 with 45 rules applied. Total rules applied 753 place count 576 transition count 1225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 756 place count 576 transition count 1222
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 756 place count 576 transition count 1215
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 770 place count 569 transition count 1215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 771 place count 568 transition count 1209
Iterating global reduction 5 with 1 rules applied. Total rules applied 772 place count 568 transition count 1209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 773 place count 568 transition count 1208
Performed 213 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 213 places in 1 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 6 with 426 rules applied. Total rules applied 1199 place count 355 transition count 990
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1206 place count 355 transition count 983
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 1228 place count 333 transition count 794
Iterating global reduction 7 with 22 rules applied. Total rules applied 1250 place count 333 transition count 794
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1265 place count 333 transition count 779
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1267 place count 332 transition count 778
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1301 place count 315 transition count 894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1302 place count 315 transition count 893
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1307 place count 310 transition count 825
Iterating global reduction 9 with 5 rules applied. Total rules applied 1312 place count 310 transition count 825
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1337 place count 310 transition count 800
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1363 place count 310 transition count 774
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1375 place count 298 transition count 750
Iterating global reduction 10 with 12 rules applied. Total rules applied 1387 place count 298 transition count 750
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1399 place count 286 transition count 640
Iterating global reduction 10 with 12 rules applied. Total rules applied 1411 place count 286 transition count 640
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1423 place count 286 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1424 place count 285 transition count 627
Applied a total of 1424 rules in 466 ms. Remains 285 /1249 variables (removed 964) and now considering 627/2091 (removed 1464) transitions.
[2024-05-22 15:21:07] [INFO ] Flow matrix only has 607 transitions (discarded 20 similar events)
// Phase 1: matrix 607 rows 285 cols
[2024-05-22 15:21:07] [INFO ] Computed 88 invariants in 4 ms
[2024-05-22 15:21:07] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-22 15:21:07] [INFO ] Flow matrix only has 607 transitions (discarded 20 similar events)
[2024-05-22 15:21:07] [INFO ] Invariant cache hit.
[2024-05-22 15:21:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:21:08] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2024-05-22 15:21:08] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-22 15:21:08] [INFO ] Flow matrix only has 607 transitions (discarded 20 similar events)
[2024-05-22 15:21:08] [INFO ] Invariant cache hit.
[2024-05-22 15:21:08] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/1249 places, 627/2091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1719 ms. Remains : 285/1249 places, 627/2091 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 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s41 1) (EQ s134 1)), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-00 finished in 2012 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 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1228 transition count 2054
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1228 transition count 2054
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 1220 transition count 2046
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1218 transition count 2044
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1212 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1211 transition count 2037
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1211 transition count 2037
Applied a total of 76 rules in 415 ms. Remains 1211 /1249 variables (removed 38) and now considering 2037/2091 (removed 54) transitions.
// Phase 1: matrix 2037 rows 1211 cols
[2024-05-22 15:21:09] [INFO ] Computed 88 invariants in 10 ms
[2024-05-22 15:21:10] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-22 15:21:10] [INFO ] Invariant cache hit.
[2024-05-22 15:21:11] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2024-05-22 15:21:11] [INFO ] Invariant cache hit.
[2024-05-22 15:21:13] [INFO ] Dead Transitions using invariants and state equation in 1780 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1211/1249 places, 2037/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4106 ms. Remains : 1211/1249 places, 2037/2091 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-01 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:(EQ s1127 0)], 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 251 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-01 finished in 4223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G(p0)&&X(G(p1))))))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1228 transition count 2054
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1228 transition count 2054
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 1220 transition count 2046
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1218 transition count 2044
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1212 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1211 transition count 2037
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1211 transition count 2037
Applied a total of 76 rules in 380 ms. Remains 1211 /1249 variables (removed 38) and now considering 2037/2091 (removed 54) transitions.
[2024-05-22 15:21:13] [INFO ] Invariant cache hit.
[2024-05-22 15:21:14] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-22 15:21:14] [INFO ] Invariant cache hit.
[2024-05-22 15:21:15] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
[2024-05-22 15:21:15] [INFO ] Invariant cache hit.
[2024-05-22 15:21:18] [INFO ] Dead Transitions using invariants and state equation in 2402 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1211/1249 places, 2037/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4790 ms. Remains : 1211/1249 places, 2037/2091 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(OR p0 p1), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}]], initial=0, aps=[p0:(NEQ s410 1), p1:(AND (EQ s448 1) (EQ s890 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9042 steps with 0 reset in 115 ms.
FORMULA DLCround-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-02 finished in 5308 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)&&F((G(p1)||(p1&&F(G(!p2))))))))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Graph (trivial) has 1141 edges and 1249 vertex of which 343 / 1249 are part of one of the 28 SCC in 3 ms
Free SCC test removed 315 places
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 213 place count 933 transition count 1537
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 242 rules applied. Total rules applied 455 place count 721 transition count 1507
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 475 place count 701 transition count 1507
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 475 place count 701 transition count 1419
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 651 place count 613 transition count 1419
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 697 place count 567 transition count 1201
Iterating global reduction 3 with 46 rules applied. Total rules applied 743 place count 567 transition count 1201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 747 place count 567 transition count 1197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 747 place count 567 transition count 1193
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 755 place count 563 transition count 1193
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 756 place count 562 transition count 1187
Iterating global reduction 4 with 1 rules applied. Total rules applied 757 place count 562 transition count 1187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 758 place count 562 transition count 1186
Performed 211 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 211 places in 0 ms
Reduce places removed 211 places and 0 transitions.
Iterating global reduction 5 with 422 rules applied. Total rules applied 1180 place count 351 transition count 969
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1186 place count 351 transition count 963
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1207 place count 330 transition count 780
Iterating global reduction 6 with 21 rules applied. Total rules applied 1228 place count 330 transition count 780
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1242 place count 330 transition count 766
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1276 place count 313 transition count 882
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1280 place count 309 transition count 826
Iterating global reduction 7 with 4 rules applied. Total rules applied 1284 place count 309 transition count 826
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1309 place count 309 transition count 801
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 1339 place count 309 transition count 771
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1351 place count 297 transition count 747
Iterating global reduction 8 with 12 rules applied. Total rules applied 1363 place count 297 transition count 747
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1375 place count 285 transition count 637
Iterating global reduction 8 with 12 rules applied. Total rules applied 1387 place count 285 transition count 637
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1399 place count 285 transition count 625
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1400 place count 284 transition count 624
Applied a total of 1400 rules in 314 ms. Remains 284 /1249 variables (removed 965) and now considering 624/2091 (removed 1467) transitions.
[2024-05-22 15:21:18] [INFO ] Flow matrix only has 601 transitions (discarded 23 similar events)
// Phase 1: matrix 601 rows 284 cols
[2024-05-22 15:21:18] [INFO ] Computed 88 invariants in 3 ms
[2024-05-22 15:21:19] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-22 15:21:19] [INFO ] Flow matrix only has 601 transitions (discarded 23 similar events)
[2024-05-22 15:21:19] [INFO ] Invariant cache hit.
[2024-05-22 15:21:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:21:19] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-05-22 15:21:19] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-22 15:21:19] [INFO ] Flow matrix only has 601 transitions (discarded 23 similar events)
[2024-05-22 15:21:19] [INFO ] Invariant cache hit.
[2024-05-22 15:21:20] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/1249 places, 624/2091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1445 ms. Remains : 284/1249 places, 624/2091 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s251 0), p1:(EQ s99 1), p2:(AND (EQ s2 1) (EQ s149 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-03 finished in 1640 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) U X(p1))))'
Support contains 2 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1229 transition count 2055
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1229 transition count 2055
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1222 transition count 2048
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1222 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1220 transition count 2046
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Applied a total of 72 rules in 418 ms. Remains 1213 /1249 variables (removed 36) and now considering 2039/2091 (removed 52) transitions.
// Phase 1: matrix 2039 rows 1213 cols
[2024-05-22 15:21:20] [INFO ] Computed 88 invariants in 9 ms
[2024-05-22 15:21:21] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-22 15:21:21] [INFO ] Invariant cache hit.
[2024-05-22 15:21:22] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
[2024-05-22 15:21:22] [INFO ] Invariant cache hit.
[2024-05-22 15:21:25] [INFO ] Dead Transitions using invariants and state equation in 2304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1213/1249 places, 2039/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4767 ms. Remains : 1213/1249 places, 2039/2091 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s809 1), p1:(NEQ s971 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 990 ms.
Product exploration explored 100000 steps with 33333 reset in 951 ms.
Computed a total of 173 stabilizing places and 173 stable transitions
Computed a total of 173 stabilizing places and 173 stable transitions
Detected a total of 173/1213 stabilizing places and 173/2039 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-04 finished in 7084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1229 transition count 2055
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1229 transition count 2055
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1222 transition count 2048
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1222 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1220 transition count 2046
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Applied a total of 72 rules in 398 ms. Remains 1213 /1249 variables (removed 36) and now considering 2039/2091 (removed 52) transitions.
// Phase 1: matrix 2039 rows 1213 cols
[2024-05-22 15:21:27] [INFO ] Computed 88 invariants in 9 ms
[2024-05-22 15:21:28] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-22 15:21:28] [INFO ] Invariant cache hit.
[2024-05-22 15:21:29] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2024-05-22 15:21:29] [INFO ] Invariant cache hit.
[2024-05-22 15:21:32] [INFO ] Dead Transitions using invariants and state equation in 2421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1213/1249 places, 2039/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5029 ms. Remains : 1213/1249 places, 2039/2091 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s456 1) (EQ s1127 1)), p0:(EQ s560 0)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 485 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-05 finished in 5330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F((p0||G(p1)))) U p2))))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Graph (trivial) has 1140 edges and 1249 vertex of which 329 / 1249 are part of one of the 29 SCC in 3 ms
Free SCC test removed 300 places
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 948 transition count 1550
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 247 rules applied. Total rules applied 465 place count 731 transition count 1520
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 486 place count 711 transition count 1519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 487 place count 710 transition count 1519
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 487 place count 710 transition count 1430
Deduced a syphon composed of 89 places in 6 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 665 place count 621 transition count 1430
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 710 place count 576 transition count 1221
Iterating global reduction 4 with 45 rules applied. Total rules applied 755 place count 576 transition count 1221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 759 place count 576 transition count 1217
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 759 place count 576 transition count 1211
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 771 place count 570 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 772 place count 569 transition count 1205
Iterating global reduction 5 with 1 rules applied. Total rules applied 773 place count 569 transition count 1205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 774 place count 569 transition count 1204
Performed 213 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 213 places in 1 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 6 with 426 rules applied. Total rules applied 1200 place count 356 transition count 985
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1206 place count 356 transition count 979
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1225 place count 337 transition count 817
Iterating global reduction 7 with 19 rules applied. Total rules applied 1244 place count 337 transition count 817
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1257 place count 337 transition count 804
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 8 with 2 rules applied. Total rules applied 1259 place count 336 transition count 803
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1293 place count 319 transition count 923
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1294 place count 319 transition count 922
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1298 place count 315 transition count 868
Iterating global reduction 9 with 4 rules applied. Total rules applied 1302 place count 315 transition count 868
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1327 place count 315 transition count 843
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 10 with 23 rules applied. Total rules applied 1350 place count 315 transition count 820
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1358 place count 307 transition count 804
Iterating global reduction 10 with 8 rules applied. Total rules applied 1366 place count 307 transition count 804
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1374 place count 299 transition count 731
Iterating global reduction 10 with 8 rules applied. Total rules applied 1382 place count 299 transition count 731
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1390 place count 299 transition count 723
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1391 place count 298 transition count 722
Applied a total of 1391 rules in 333 ms. Remains 298 /1249 variables (removed 951) and now considering 722/2091 (removed 1369) transitions.
[2024-05-22 15:21:33] [INFO ] Flow matrix only has 697 transitions (discarded 25 similar events)
// Phase 1: matrix 697 rows 298 cols
[2024-05-22 15:21:33] [INFO ] Computed 88 invariants in 4 ms
[2024-05-22 15:21:33] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-22 15:21:33] [INFO ] Flow matrix only has 697 transitions (discarded 25 similar events)
[2024-05-22 15:21:33] [INFO ] Invariant cache hit.
[2024-05-22 15:21:33] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 15:21:33] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2024-05-22 15:21:33] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-22 15:21:33] [INFO ] Flow matrix only has 697 transitions (discarded 25 similar events)
[2024-05-22 15:21:33] [INFO ] Invariant cache hit.
[2024-05-22 15:21:34] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/1249 places, 722/2091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1612 ms. Remains : 298/1249 places, 722/2091 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s32 1) (EQ s228 1)), p0:(EQ s24 1), p1:(EQ s49 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-06 finished in 1819 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(p1) U (p2&&X(p1))))||p0)))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1229 transition count 2055
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1229 transition count 2055
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 1221 transition count 2047
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1221 transition count 2047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1219 transition count 2045
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1212 transition count 2038
Applied a total of 74 rules in 384 ms. Remains 1212 /1249 variables (removed 37) and now considering 2038/2091 (removed 53) transitions.
// Phase 1: matrix 2038 rows 1212 cols
[2024-05-22 15:21:34] [INFO ] Computed 88 invariants in 8 ms
[2024-05-22 15:21:35] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-22 15:21:35] [INFO ] Invariant cache hit.
[2024-05-22 15:21:36] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2024-05-22 15:21:36] [INFO ] Invariant cache hit.
[2024-05-22 15:21:39] [INFO ] Dead Transitions using invariants and state equation in 2208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1212/1249 places, 2038/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4597 ms. Remains : 1212/1249 places, 2038/2091 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s300 0) (EQ s1072 0) (EQ s404 1)), p2:(EQ s404 1), p1:(EQ s875 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1038 ms.
Product exploration explored 100000 steps with 50000 reset in 1051 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-07 finished in 6949 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&&F((p0&&((F(p1)&&G(p2)) U p3)))))))'
Support contains 5 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1232 transition count 2066
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1232 transition count 2066
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1227 transition count 2061
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1227 transition count 2061
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1226 transition count 2060
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1226 transition count 2060
Applied a total of 46 rules in 143 ms. Remains 1226 /1249 variables (removed 23) and now considering 2060/2091 (removed 31) transitions.
// Phase 1: matrix 2060 rows 1226 cols
[2024-05-22 15:21:41] [INFO ] Computed 88 invariants in 7 ms
[2024-05-22 15:21:42] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-22 15:21:42] [INFO ] Invariant cache hit.
[2024-05-22 15:21:43] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
[2024-05-22 15:21:43] [INFO ] Invariant cache hit.
[2024-05-22 15:21:45] [INFO ] Dead Transitions using invariants and state equation in 1928 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1226/1249 places, 2060/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4161 ms. Remains : 1226/1249 places, 2060/2091 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p3) p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s115 1), p3:(EQ s33 1), p2:(NEQ s1048 1), p1:(AND (EQ s341 1) (EQ s1098 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]]
Stuttering criterion allowed to conclude after 81175 steps with 1 reset in 382 ms.
FORMULA DLCround-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-08 finished in 4832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(X(p2)||p1))))))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1230 transition count 2056
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1230 transition count 2056
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 1222 transition count 2048
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 1222 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1220 transition count 2046
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Applied a total of 72 rules in 386 ms. Remains 1213 /1249 variables (removed 36) and now considering 2039/2091 (removed 52) transitions.
// Phase 1: matrix 2039 rows 1213 cols
[2024-05-22 15:21:46] [INFO ] Computed 88 invariants in 7 ms
[2024-05-22 15:21:47] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-22 15:21:47] [INFO ] Invariant cache hit.
[2024-05-22 15:21:48] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
[2024-05-22 15:21:48] [INFO ] Invariant cache hit.
[2024-05-22 15:21:51] [INFO ] Dead Transitions using invariants and state equation in 2384 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1213/1249 places, 2039/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4763 ms. Remains : 1213/1249 places, 2039/2091 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(NEQ s228 1), p1:(OR (EQ s1130 1) (NEQ s140 1)), p2:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 817 ms.
Product exploration explored 100000 steps with 33333 reset in 773 ms.
Computed a total of 172 stabilizing places and 172 stable transitions
Computed a total of 172 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-09 finished in 6691 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((F(p1)||p0)))&&F(p2)))'
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1231 transition count 2057
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1231 transition count 2057
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 1223 transition count 2049
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 1223 transition count 2049
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1221 transition count 2047
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1221 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1220 transition count 2046
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Applied a total of 70 rules in 387 ms. Remains 1214 /1249 variables (removed 35) and now considering 2040/2091 (removed 51) transitions.
// Phase 1: matrix 2040 rows 1214 cols
[2024-05-22 15:21:53] [INFO ] Computed 88 invariants in 5 ms
[2024-05-22 15:21:53] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-22 15:21:53] [INFO ] Invariant cache hit.
[2024-05-22 15:21:55] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
[2024-05-22 15:21:55] [INFO ] Invariant cache hit.
[2024-05-22 15:21:57] [INFO ] Dead Transitions using invariants and state equation in 1826 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1214/1249 places, 2040/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4468 ms. Remains : 1214/1249 places, 2040/2091 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s301 1), p0:(OR (EQ s301 0) (EQ s88 0)), p1:(EQ s391 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 423 ms.
Product exploration explored 100000 steps with 1 reset in 667 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 15:21:59] [INFO ] Invariant cache hit.
[2024-05-22 15:21:59] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 15:22:00] [INFO ] [Nat]Absence check using 88 positive place invariants in 62 ms returned sat
[2024-05-22 15:22:01] [INFO ] After 1132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 15:22:01] [INFO ] After 1626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 278 ms.
[2024-05-22 15:22:02] [INFO ] After 2312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 530 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=132 )
Parikh walk visited 4 properties in 26 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 p2 p1)), (F (AND p0 p2 (NOT p1))), (F (NOT p1)), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
[2024-05-22 15:22:03] [INFO ] Invariant cache hit.
[2024-05-22 15:22:04] [INFO ] [Real]Absence check using 88 positive place invariants in 153 ms returned sat
[2024-05-22 15:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 15:22:07] [INFO ] [Real]Absence check using state equation in 2859 ms returned sat
[2024-05-22 15:22:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:22:09] [INFO ] [Nat]Absence check using 88 positive place invariants in 144 ms returned sat
[2024-05-22 15:22:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 15:22:12] [INFO ] [Nat]Absence check using state equation in 2946 ms returned sat
[2024-05-22 15:22:12] [INFO ] Computed and/alt/rep : 1927/3419/1927 causal constraints (skipped 112 transitions) in 150 ms.
[2024-05-22 15:22:23] [INFO ] Deduced a trap composed of 8 places in 914 ms of which 3 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-22 15:22:23] [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 3 out of 1214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1214/1214 places, 2040/2040 transitions.
Graph (trivial) has 1109 edges and 1214 vertex of which 342 / 1214 are part of one of the 28 SCC in 2 ms
Free SCC test removed 314 places
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 899 transition count 1504
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 226 rules applied. Total rules applied 423 place count 703 transition count 1474
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 443 place count 683 transition count 1474
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 443 place count 683 transition count 1384
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 623 place count 593 transition count 1384
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 665 place count 551 transition count 1146
Iterating global reduction 3 with 42 rules applied. Total rules applied 707 place count 551 transition count 1146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 711 place count 551 transition count 1142
Performed 204 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 204 places in 0 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 4 with 408 rules applied. Total rules applied 1119 place count 347 transition count 932
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1125 place count 347 transition count 926
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1141 place count 331 transition count 794
Iterating global reduction 5 with 16 rules applied. Total rules applied 1157 place count 331 transition count 794
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1173 place count 331 transition count 778
Performed 16 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1205 place count 315 transition count 887
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1209 place count 311 transition count 833
Iterating global reduction 6 with 4 rules applied. Total rules applied 1213 place count 311 transition count 833
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1238 place count 311 transition count 808
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 1263 place count 311 transition count 783
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1273 place count 301 transition count 763
Iterating global reduction 7 with 10 rules applied. Total rules applied 1283 place count 301 transition count 763
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1293 place count 291 transition count 671
Iterating global reduction 7 with 10 rules applied. Total rules applied 1303 place count 291 transition count 671
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1313 place count 291 transition count 661
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1314 place count 290 transition count 660
Applied a total of 1314 rules in 138 ms. Remains 290 /1214 variables (removed 924) and now considering 660/2040 (removed 1380) transitions.
[2024-05-22 15:22:23] [INFO ] Flow matrix only has 638 transitions (discarded 22 similar events)
// Phase 1: matrix 638 rows 290 cols
[2024-05-22 15:22:23] [INFO ] Computed 88 invariants in 2 ms
[2024-05-22 15:22:24] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-22 15:22:24] [INFO ] Flow matrix only has 638 transitions (discarded 22 similar events)
[2024-05-22 15:22:24] [INFO ] Invariant cache hit.
[2024-05-22 15:22:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:22:24] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2024-05-22 15:22:24] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-22 15:22:24] [INFO ] Flow matrix only has 638 transitions (discarded 22 similar events)
[2024-05-22 15:22:24] [INFO ] Invariant cache hit.
[2024-05-22 15:22:25] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/1214 places, 660/2040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1364 ms. Remains : 290/1214 places, 660/2040 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT (AND p0 p2 p1))), (X (NOT p2)), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 192 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
Finished random walk after 526 steps, including 0 resets, run visited all 7 properties in 33 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT (AND p0 p2 p1))), (X (NOT p2)), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (NOT p1)), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 16 factoid took 560 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
[2024-05-22 15:22:26] [INFO ] Flow matrix only has 638 transitions (discarded 22 similar events)
[2024-05-22 15:22:26] [INFO ] Invariant cache hit.
[2024-05-22 15:22:27] [INFO ] [Real]Absence check using 88 positive place invariants in 37 ms returned sat
[2024-05-22 15:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 15:22:27] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2024-05-22 15:22:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:22:28] [INFO ] [Nat]Absence check using 88 positive place invariants in 38 ms returned sat
[2024-05-22 15:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 15:22:28] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2024-05-22 15:22:28] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:22:28] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2024-05-22 15:22:28] [INFO ] Computed and/alt/rep : 407/1008/407 causal constraints (skipped 181 transitions) in 62 ms.
[2024-05-22 15:22:28] [INFO ] Added : 2 causal constraints over 1 iterations in 145 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-10 finished in 36164 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 X(p0)) U p1))'
Support contains 2 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1229 transition count 2055
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1229 transition count 2055
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 1221 transition count 2047
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1221 transition count 2047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1219 transition count 2045
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1212 transition count 2038
Applied a total of 74 rules in 384 ms. Remains 1212 /1249 variables (removed 37) and now considering 2038/2091 (removed 53) transitions.
// Phase 1: matrix 2038 rows 1212 cols
[2024-05-22 15:22:29] [INFO ] Computed 88 invariants in 6 ms
[2024-05-22 15:22:30] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-22 15:22:30] [INFO ] Invariant cache hit.
[2024-05-22 15:22:31] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2024-05-22 15:22:31] [INFO ] Invariant cache hit.
[2024-05-22 15:22:33] [INFO ] Dead Transitions using invariants and state equation in 2212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1212/1249 places, 2038/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4638 ms. Remains : 1212/1249 places, 2038/2091 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1), true]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1171 1), p0:(EQ s784 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-13 finished in 4788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Graph (trivial) has 1143 edges and 1249 vertex of which 343 / 1249 are part of one of the 28 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 214 place count 933 transition count 1536
Reduce places removed 213 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 243 rules applied. Total rules applied 457 place count 720 transition count 1506
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 477 place count 700 transition count 1506
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 477 place count 700 transition count 1419
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 651 place count 613 transition count 1419
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 698 place count 566 transition count 1200
Iterating global reduction 3 with 47 rules applied. Total rules applied 745 place count 566 transition count 1200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 749 place count 566 transition count 1196
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 749 place count 566 transition count 1191
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 759 place count 561 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 760 place count 560 transition count 1185
Iterating global reduction 4 with 1 rules applied. Total rules applied 761 place count 560 transition count 1185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 762 place count 560 transition count 1184
Performed 209 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 209 places in 1 ms
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 5 with 418 rules applied. Total rules applied 1180 place count 351 transition count 969
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1186 place count 351 transition count 963
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1207 place count 330 transition count 783
Iterating global reduction 6 with 21 rules applied. Total rules applied 1228 place count 330 transition count 783
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1243 place count 330 transition count 768
Performed 16 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1275 place count 314 transition count 878
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1279 place count 310 transition count 824
Iterating global reduction 7 with 4 rules applied. Total rules applied 1283 place count 310 transition count 824
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1308 place count 310 transition count 799
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1334 place count 310 transition count 773
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1345 place count 299 transition count 751
Iterating global reduction 8 with 11 rules applied. Total rules applied 1356 place count 299 transition count 751
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1367 place count 288 transition count 651
Iterating global reduction 8 with 11 rules applied. Total rules applied 1378 place count 288 transition count 651
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1389 place count 288 transition count 640
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1390 place count 287 transition count 639
Applied a total of 1390 rules in 160 ms. Remains 287 /1249 variables (removed 962) and now considering 639/2091 (removed 1452) transitions.
[2024-05-22 15:22:34] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
// Phase 1: matrix 618 rows 287 cols
[2024-05-22 15:22:34] [INFO ] Computed 88 invariants in 2 ms
[2024-05-22 15:22:34] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-22 15:22:34] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
[2024-05-22 15:22:34] [INFO ] Invariant cache hit.
[2024-05-22 15:22:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:22:34] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-22 15:22:34] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 15:22:34] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
[2024-05-22 15:22:34] [INFO ] Invariant cache hit.
[2024-05-22 15:22:35] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 287/1249 places, 639/2091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1583 ms. Remains : 287/1249 places, 639/2091 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s99 1), p1:(EQ s25 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-14 finished in 1651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0&&X(p1)) U p2)))'
Support contains 4 out of 1249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1249/1249 places, 2091/2091 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1230 transition count 2056
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1230 transition count 2056
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 1223 transition count 2049
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 1223 transition count 2049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1222 transition count 2048
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1222 transition count 2048
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1221 transition count 2047
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1221 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1220 transition count 2046
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1215 transition count 2041
Applied a total of 68 rules in 386 ms. Remains 1215 /1249 variables (removed 34) and now considering 2041/2091 (removed 50) transitions.
// Phase 1: matrix 2041 rows 1215 cols
[2024-05-22 15:22:35] [INFO ] Computed 88 invariants in 6 ms
[2024-05-22 15:22:36] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-05-22 15:22:36] [INFO ] Invariant cache hit.
[2024-05-22 15:22:37] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2024-05-22 15:22:37] [INFO ] Invariant cache hit.
[2024-05-22 15:22:39] [INFO ] Dead Transitions using invariants and state equation in 1952 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1215/1249 places, 2041/2091 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4346 ms. Remains : 1215/1249 places, 2041/2091 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (NEQ s329 1) (AND (EQ s177 1) (EQ s840 1))), p0:(EQ s329 1), p1:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 10012 steps with 0 reset in 50 ms.
FORMULA DLCround-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-15 finished in 4517 ms.
All properties solved by simple procedures.
Total runtime 106100 ms.

BK_STOP 1716391361088

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DLCround-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r131-smll-171624288300098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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