Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478800804.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DLCshifumi-PT-2b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478800804
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K Feb 26 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 07:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 07:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 26 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 26 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 729K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678280194871

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-2b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 12:56:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 12:56:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:56:36] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-08 12:56:36] [INFO ] Transformed 2483 places.
[2023-03-08 12:56:36] [INFO ] Transformed 3183 transitions.
[2023-03-08 12:56:36] [INFO ] Found NUPN structural information;
[2023-03-08 12:56:36] [INFO ] Parsed PT model containing 2483 places and 3183 transitions and 7756 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCshifumi-PT-2b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Discarding 389 places :
Symmetric choice reduction at 0 with 389 rule applications. Total rules 389 place count 2094 transition count 2794
Iterating global reduction 0 with 389 rules applied. Total rules applied 778 place count 2094 transition count 2794
Discarding 305 places :
Symmetric choice reduction at 0 with 305 rule applications. Total rules 1083 place count 1789 transition count 2489
Iterating global reduction 0 with 305 rules applied. Total rules applied 1388 place count 1789 transition count 2489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 1390 place count 1789 transition count 2487
Discarding 108 places :
Symmetric choice reduction at 1 with 108 rule applications. Total rules 1498 place count 1681 transition count 2334
Iterating global reduction 1 with 108 rules applied. Total rules applied 1606 place count 1681 transition count 2334
Discarding 102 places :
Symmetric choice reduction at 1 with 102 rule applications. Total rules 1708 place count 1579 transition count 2232
Iterating global reduction 1 with 102 rules applied. Total rules applied 1810 place count 1579 transition count 2232
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 1824 place count 1579 transition count 2218
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1870 place count 1533 transition count 2172
Iterating global reduction 2 with 46 rules applied. Total rules applied 1916 place count 1533 transition count 2172
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1962 place count 1487 transition count 2126
Iterating global reduction 2 with 46 rules applied. Total rules applied 2008 place count 1487 transition count 2126
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 2054 place count 1441 transition count 2080
Iterating global reduction 2 with 46 rules applied. Total rules applied 2100 place count 1441 transition count 2080
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 2142 place count 1399 transition count 2038
Iterating global reduction 2 with 42 rules applied. Total rules applied 2184 place count 1399 transition count 2038
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 2210 place count 1373 transition count 2012
Iterating global reduction 2 with 26 rules applied. Total rules applied 2236 place count 1373 transition count 2012
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 2262 place count 1347 transition count 1986
Iterating global reduction 2 with 26 rules applied. Total rules applied 2288 place count 1347 transition count 1986
Applied a total of 2288 rules in 1123 ms. Remains 1347 /2483 variables (removed 1136) and now considering 1986/3183 (removed 1197) transitions.
// Phase 1: matrix 1986 rows 1347 cols
[2023-03-08 12:56:37] [INFO ] Computed 79 place invariants in 31 ms
[2023-03-08 12:56:38] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-08 12:56:38] [INFO ] Invariant cache hit.
[2023-03-08 12:56:39] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2023-03-08 12:56:39] [INFO ] Invariant cache hit.
[2023-03-08 12:56:40] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1347/2483 places, 1986/3183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3288 ms. Remains : 1347/2483 places, 1986/3183 transitions.
Support contains 39 out of 1347 places after structural reductions.
[2023-03-08 12:56:40] [INFO ] Flatten gal took : 133 ms
[2023-03-08 12:56:40] [INFO ] Flatten gal took : 93 ms
[2023-03-08 12:56:40] [INFO ] Input system was already deterministic with 1986 transitions.
Support contains 38 out of 1347 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 12:56:41] [INFO ] Invariant cache hit.
[2023-03-08 12:56:41] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 12:56:42] [INFO ] [Nat]Absence check using 79 positive place invariants in 33 ms returned sat
[2023-03-08 12:56:43] [INFO ] After 865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 12:56:43] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 5 ms to minimize.
[2023-03-08 12:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-08 12:56:43] [INFO ] After 1749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 352 ms.
[2023-03-08 12:56:44] [INFO ] After 2547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 254 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=84 )
Parikh walk visited 7 properties in 13 ms.
Computed a total of 148 stabilizing places and 148 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(G((G(p2)||p1)))))))))'
Support contains 4 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1333 transition count 1972
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1333 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1333 transition count 1971
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 1324 transition count 1962
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 1324 transition count 1962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 1318 transition count 1956
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1316 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1316 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1315 transition count 1953
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1314 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1313 transition count 1951
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1313 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1312 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1312 transition count 1950
Applied a total of 71 rules in 248 ms. Remains 1312 /1347 variables (removed 35) and now considering 1950/1986 (removed 36) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2023-03-08 12:56:44] [INFO ] Computed 79 place invariants in 20 ms
[2023-03-08 12:56:45] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-08 12:56:45] [INFO ] Invariant cache hit.
[2023-03-08 12:56:46] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-08 12:56:46] [INFO ] Invariant cache hit.
[2023-03-08 12:56:46] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1312/1347 places, 1950/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2111 ms. Remains : 1312/1347 places, 1950/1986 transitions.
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}, { cond=p0, acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={1} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s12 0), p1:(OR (EQ s498 0) (EQ s1064 0)), p2:(EQ s196 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 499 ms.
Product exploration explored 100000 steps with 11 reset in 498 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Detected a total of 142/1312 stabilizing places and 142/1950 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 12:56:49] [INFO ] Invariant cache hit.
[2023-03-08 12:56:49] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 12:56:49] [INFO ] [Nat]Absence check using 79 positive place invariants in 30 ms returned sat
[2023-03-08 12:56:50] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-08 12:56:50] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 1 ms to minimize.
[2023-03-08 12:56:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-08 12:56:50] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-08 12:56:50] [INFO ] After 1342ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 1312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1312/1312 places, 1950/1950 transitions.
Graph (trivial) has 1244 edges and 1312 vertex of which 319 / 1312 are part of one of the 23 SCC in 5 ms
Free SCC test removed 296 places
Drop transitions removed 338 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 355 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 1016 transition count 1316
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 327 rules applied. Total rules applied 607 place count 737 transition count 1268
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 639 place count 705 transition count 1268
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 639 place count 705 transition count 1160
Deduced a syphon composed of 108 places in 2 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 855 place count 597 transition count 1160
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 897 place count 555 transition count 983
Iterating global reduction 3 with 42 rules applied. Total rules applied 939 place count 555 transition count 983
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 954 place count 555 transition count 968
Performed 192 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 192 places in 1 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 4 with 384 rules applied. Total rules applied 1338 place count 363 transition count 774
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1340 place count 363 transition count 772
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1359 place count 344 transition count 678
Iterating global reduction 5 with 19 rules applied. Total rules applied 1378 place count 344 transition count 678
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1397 place count 344 transition count 659
Performed 48 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 1493 place count 296 transition count 726
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1503 place count 296 transition count 716
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1517 place count 282 transition count 657
Iterating global reduction 7 with 14 rules applied. Total rules applied 1531 place count 282 transition count 657
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1560 place count 282 transition count 628
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1588 place count 282 transition count 600
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1592 place count 278 transition count 596
Iterating global reduction 8 with 4 rules applied. Total rules applied 1596 place count 278 transition count 596
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1600 place count 274 transition count 530
Iterating global reduction 8 with 4 rules applied. Total rules applied 1604 place count 274 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1608 place count 274 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1612 place count 272 transition count 524
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1614 place count 270 transition count 491
Iterating global reduction 9 with 2 rules applied. Total rules applied 1616 place count 270 transition count 491
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1618 place count 270 transition count 489
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1624 place count 267 transition count 512
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1628 place count 267 transition count 508
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 1641 place count 267 transition count 495
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1643 place count 266 transition count 506
Free-agglomeration rule applied 156 times with reduction of 77 identical transitions.
Iterating global reduction 11 with 156 rules applied. Total rules applied 1799 place count 266 transition count 273
Reduce places removed 156 places and 0 transitions.
Drop transitions removed 152 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 153 transitions.
Graph (complete) has 229 edges and 110 vertex of which 23 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.1 ms
Discarding 87 places :
Also discarding 67 output transitions
Drop transitions removed 67 transitions
Iterating post reduction 11 with 310 rules applied. Total rules applied 2109 place count 23 transition count 53
Drop transitions removed 6 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 2129 place count 23 transition count 33
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 2130 place count 22 transition count 31
Iterating global reduction 13 with 1 rules applied. Total rules applied 2131 place count 22 transition count 31
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 2133 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2134 place count 21 transition count 28
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 5 / 16 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 6 rules applied. Total rules applied 2140 place count 13 transition count 28
Drop transitions removed 8 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 19 edges and 13 vertex of which 11 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 14 with 13 rules applied. Total rules applied 2153 place count 11 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2154 place count 11 transition count 14
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 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 2157 place count 9 transition count 13
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 2160 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2160 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2162 place count 8 transition count 9
Applied a total of 2162 rules in 330 ms. Remains 8 /1312 variables (removed 1304) and now considering 9/1950 (removed 1941) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 8/1312 places, 9/1950 transitions.
Finished random walk after 3344 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=836 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 517 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 1312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1312/1312 places, 1950/1950 transitions.
Applied a total of 0 rules in 28 ms. Remains 1312 /1312 variables (removed 0) and now considering 1950/1950 (removed 0) transitions.
[2023-03-08 12:56:51] [INFO ] Invariant cache hit.
[2023-03-08 12:56:52] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-08 12:56:52] [INFO ] Invariant cache hit.
[2023-03-08 12:56:53] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2023-03-08 12:56:53] [INFO ] Invariant cache hit.
[2023-03-08 12:56:53] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1876 ms. Remains : 1312/1312 places, 1950/1950 transitions.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Detected a total of 142/1312 stabilizing places and 142/1950 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 12:56:54] [INFO ] Invariant cache hit.
[2023-03-08 12:56:54] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 12:56:54] [INFO ] [Nat]Absence check using 79 positive place invariants in 36 ms returned sat
[2023-03-08 12:56:55] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 12:56:56] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 1 ms to minimize.
[2023-03-08 12:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-08 12:56:56] [INFO ] After 1643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-03-08 12:56:57] [INFO ] After 2323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 309 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=154 )
Parikh walk visited 6 properties in 14 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 p2)), (F (NOT (AND p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p1 (AND p0 p2)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 314 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 10 reset in 315 ms.
Product exploration explored 100000 steps with 7 reset in 363 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 1312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1312/1312 places, 1950/1950 transitions.
Graph (trivial) has 1244 edges and 1312 vertex of which 319 / 1312 are part of one of the 23 SCC in 4 ms
Free SCC test removed 296 places
Ensure Unique test removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 1016 transition count 1618
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 32 rules applied. Total rules applied 312 place count 1016 transition count 1602
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 312 place count 1016 transition count 1618
Deduced a syphon composed of 325 places in 2 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 342 place count 1016 transition count 1618
Discarding 184 places :
Symmetric choice reduction at 2 with 184 rule applications. Total rules 526 place count 832 transition count 1299
Deduced a syphon composed of 183 places in 1 ms
Iterating global reduction 2 with 184 rules applied. Total rules applied 710 place count 832 transition count 1299
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 725 place count 832 transition count 1284
Performed 282 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 465 places in 0 ms
Iterating global reduction 3 with 282 rules applied. Total rules applied 1007 place count 832 transition count 1286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1009 place count 832 transition count 1284
Renaming transitions due to excessive name length > 1024 char.
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 1264 place count 577 transition count 954
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 255 rules applied. Total rules applied 1519 place count 577 transition count 954
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 1538 place count 577 transition count 935
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1540 place count 575 transition count 933
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1542 place count 575 transition count 933
Performed 51 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 278 places in 0 ms
Iterating global reduction 5 with 51 rules applied. Total rules applied 1593 place count 575 transition count 1193
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 1623 place count 575 transition count 1163
Discarding 67 places :
Symmetric choice reduction at 6 with 67 rule applications. Total rules 1690 place count 508 transition count 982
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 6 with 67 rules applied. Total rules applied 1757 place count 508 transition count 982
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 1799 place count 508 transition count 940
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 1827 place count 480 transition count 884
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 7 with 28 rules applied. Total rules applied 1855 place count 480 transition count 884
Deduced a syphon composed of 197 places in 0 ms
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 1877 place count 480 transition count 862
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1881 place count 476 transition count 854
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1885 place count 476 transition count 854
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1889 place count 472 transition count 786
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1893 place count 472 transition count 786
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1899 place count 472 transition count 780
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1903 place count 468 transition count 774
Deduced a syphon composed of 193 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1907 place count 468 transition count 774
Deduced a syphon composed of 193 places in 0 ms
Applied a total of 1907 rules in 501 ms. Remains 468 /1312 variables (removed 844) and now considering 774/1950 (removed 1176) transitions.
[2023-03-08 12:56:59] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-08 12:56:59] [INFO ] Flow matrix only has 754 transitions (discarded 20 similar events)
// Phase 1: matrix 754 rows 468 cols
[2023-03-08 12:56:59] [INFO ] Computed 79 place invariants in 7 ms
[2023-03-08 12:57:00] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/1312 places, 774/1950 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 888 ms. Remains : 468/1312 places, 774/1950 transitions.
Support contains 4 out of 1312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1312/1312 places, 1950/1950 transitions.
Applied a total of 0 rules in 24 ms. Remains 1312 /1312 variables (removed 0) and now considering 1950/1950 (removed 0) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2023-03-08 12:57:00] [INFO ] Computed 79 place invariants in 11 ms
[2023-03-08 12:57:00] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-08 12:57:00] [INFO ] Invariant cache hit.
[2023-03-08 12:57:01] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2023-03-08 12:57:01] [INFO ] Invariant cache hit.
[2023-03-08 12:57:01] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1881 ms. Remains : 1312/1312 places, 1950/1950 transitions.
Treatment of property DLCshifumi-PT-2b-LTLFireability-00 finished in 17481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1334 transition count 1973
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1334 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1334 transition count 1972
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 1326 transition count 1964
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 1326 transition count 1964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 1321 transition count 1959
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 1321 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1319 transition count 1957
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1319 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1318 transition count 1956
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1318 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1317 transition count 1955
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1317 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1316 transition count 1954
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1316 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1315 transition count 1953
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1315 transition count 1953
Applied a total of 65 rules in 283 ms. Remains 1315 /1347 variables (removed 32) and now considering 1953/1986 (removed 33) transitions.
// Phase 1: matrix 1953 rows 1315 cols
[2023-03-08 12:57:02] [INFO ] Computed 79 place invariants in 8 ms
[2023-03-08 12:57:02] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-08 12:57:02] [INFO ] Invariant cache hit.
[2023-03-08 12:57:03] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2023-03-08 12:57:03] [INFO ] Invariant cache hit.
[2023-03-08 12:57:04] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1315/1347 places, 1953/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2229 ms. Remains : 1315/1347 places, 1953/1986 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s1214 0), p0:(OR (EQ s138 1) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1003 ms.
Product exploration explored 100000 steps with 50000 reset in 1008 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-2b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-2b-LTLFireability-01 finished in 4526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0)) U (X(p1)&&(G(!p0)||p2)))))'
Support contains 2 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1332 transition count 1971
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1332 transition count 1971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1332 transition count 1970
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1323 transition count 1961
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1323 transition count 1961
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 1317 transition count 1955
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1314 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1313 transition count 1951
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1313 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1312 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1312 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1311 transition count 1949
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1311 transition count 1949
Applied a total of 73 rules in 219 ms. Remains 1311 /1347 variables (removed 36) and now considering 1949/1986 (removed 37) transitions.
// Phase 1: matrix 1949 rows 1311 cols
[2023-03-08 12:57:06] [INFO ] Computed 79 place invariants in 13 ms
[2023-03-08 12:57:07] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-08 12:57:07] [INFO ] Invariant cache hit.
[2023-03-08 12:57:07] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2023-03-08 12:57:07] [INFO ] Invariant cache hit.
[2023-03-08 12:57:08] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1311/1347 places, 1949/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2005 ms. Remains : 1311/1347 places, 1949/1986 transitions.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (NOT p0), (OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), false, (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), true, p0, (AND p0 (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(OR p2 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=8 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (EQ s682 1) (EQ s814 1)), p0:(NEQ s682 1), p1:(EQ s814 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 174 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-02 finished in 2489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1333 transition count 1972
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1333 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1333 transition count 1971
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 1324 transition count 1962
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 1324 transition count 1962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 1318 transition count 1956
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1316 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1316 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1315 transition count 1953
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1314 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1313 transition count 1951
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1313 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1312 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1312 transition count 1950
Applied a total of 71 rules in 209 ms. Remains 1312 /1347 variables (removed 35) and now considering 1950/1986 (removed 36) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2023-03-08 12:57:09] [INFO ] Computed 79 place invariants in 13 ms
[2023-03-08 12:57:09] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-08 12:57:09] [INFO ] Invariant cache hit.
[2023-03-08 12:57:10] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2023-03-08 12:57:10] [INFO ] Invariant cache hit.
[2023-03-08 12:57:11] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1312/1347 places, 1950/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2027 ms. Remains : 1312/1347 places, 1950/1986 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1077 0), p0:(EQ s227 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 683 steps with 0 reset in 4 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-03 finished in 2140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1&&G(p2))) U X((!p2||X(p0)))))'
Support contains 4 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1334 transition count 1973
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1334 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1334 transition count 1972
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 1327 transition count 1965
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 1327 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 1321 transition count 1959
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 1321 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1319 transition count 1957
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1319 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1318 transition count 1956
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1318 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1317 transition count 1955
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1317 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1316 transition count 1954
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1316 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1315 transition count 1953
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1315 transition count 1953
Applied a total of 65 rules in 213 ms. Remains 1315 /1347 variables (removed 32) and now considering 1953/1986 (removed 33) transitions.
// Phase 1: matrix 1953 rows 1315 cols
[2023-03-08 12:57:11] [INFO ] Computed 79 place invariants in 6 ms
[2023-03-08 12:57:11] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-08 12:57:11] [INFO ] Invariant cache hit.
[2023-03-08 12:57:12] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2023-03-08 12:57:12] [INFO ] Invariant cache hit.
[2023-03-08 12:57:13] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1315/1347 places, 1953/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1966 ms. Remains : 1315/1347 places, 1953/1986 transitions.
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p0) p2), (AND p2 (NOT p0)), false, (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p2) (NOT p0)), (AND (NOT p0) p2), false, (AND (NOT p0) p2), (NOT p2)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR p0 (AND p1 p2)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 8}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=3 dest: 9}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={} source=10 dest: 5}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (EQ s275 1) (EQ s1192 1)), p1:(EQ s984 1), p2:(NEQ s441 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-04 finished in 2347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Graph (trivial) has 1282 edges and 1347 vertex of which 319 / 1347 are part of one of the 23 SCC in 4 ms
Free SCC test removed 296 places
Ensure Unique test removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 299 place count 1050 transition count 1357
Reduce places removed 298 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 351 rules applied. Total rules applied 650 place count 752 transition count 1304
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 685 place count 717 transition count 1304
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 685 place count 717 transition count 1195
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 903 place count 608 transition count 1195
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 948 place count 563 transition count 1018
Iterating global reduction 3 with 45 rules applied. Total rules applied 993 place count 563 transition count 1018
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1005 place count 563 transition count 1006
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1005 place count 563 transition count 1003
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1011 place count 560 transition count 1003
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1013 place count 558 transition count 999
Iterating global reduction 4 with 2 rules applied. Total rules applied 1015 place count 558 transition count 999
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1017 place count 558 transition count 997
Performed 194 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 5 with 388 rules applied. Total rules applied 1405 place count 364 transition count 801
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 364 transition count 797
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1428 place count 345 transition count 717
Iterating global reduction 6 with 19 rules applied. Total rules applied 1447 place count 345 transition count 717
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1466 place count 345 transition count 698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1470 place count 343 transition count 696
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1568 place count 294 transition count 764
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1583 place count 279 transition count 698
Iterating global reduction 7 with 15 rules applied. Total rules applied 1598 place count 279 transition count 698
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1629 place count 279 transition count 667
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 1644 place count 279 transition count 652
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1648 place count 275 transition count 644
Iterating global reduction 8 with 4 rules applied. Total rules applied 1652 place count 275 transition count 644
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1656 place count 271 transition count 578
Iterating global reduction 8 with 4 rules applied. Total rules applied 1660 place count 271 transition count 578
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1664 place count 271 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1665 place count 270 transition count 573
Applied a total of 1665 rules in 138 ms. Remains 270 /1347 variables (removed 1077) and now considering 573/1986 (removed 1413) transitions.
[2023-03-08 12:57:13] [INFO ] Flow matrix only has 550 transitions (discarded 23 similar events)
// Phase 1: matrix 550 rows 270 cols
[2023-03-08 12:57:13] [INFO ] Computed 79 place invariants in 3 ms
[2023-03-08 12:57:14] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-08 12:57:14] [INFO ] Flow matrix only has 550 transitions (discarded 23 similar events)
[2023-03-08 12:57:14] [INFO ] Invariant cache hit.
[2023-03-08 12:57:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-08 12:57:14] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-03-08 12:57:14] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 12:57:14] [INFO ] Flow matrix only has 550 transitions (discarded 23 similar events)
[2023-03-08 12:57:14] [INFO ] Invariant cache hit.
[2023-03-08 12:57:14] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 270/1347 places, 573/1986 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 953 ms. Remains : 270/1347 places, 573/1986 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s79 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-06 finished in 996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G((p1||F(p2))))))))'
Support contains 4 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1332 transition count 1971
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1332 transition count 1971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1332 transition count 1970
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1323 transition count 1961
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1323 transition count 1961
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 1317 transition count 1955
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1314 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1313 transition count 1951
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1313 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1312 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1312 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1311 transition count 1949
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1311 transition count 1949
Applied a total of 73 rules in 215 ms. Remains 1311 /1347 variables (removed 36) and now considering 1949/1986 (removed 37) transitions.
// Phase 1: matrix 1949 rows 1311 cols
[2023-03-08 12:57:14] [INFO ] Computed 79 place invariants in 7 ms
[2023-03-08 12:57:15] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-08 12:57:15] [INFO ] Invariant cache hit.
[2023-03-08 12:57:15] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
[2023-03-08 12:57:15] [INFO ] Invariant cache hit.
[2023-03-08 12:57:16] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1311/1347 places, 1949/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1988 ms. Remains : 1311/1347 places, 1949/1986 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s846 0) (EQ s1165 0)), p1:(AND (EQ s563 1) (EQ s1075 1)), p2:(AND (EQ s846 1) (EQ s1165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9577 steps with 1 reset in 31 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-08 finished in 2200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 1347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Graph (trivial) has 1280 edges and 1347 vertex of which 319 / 1347 are part of one of the 23 SCC in 3 ms
Free SCC test removed 296 places
Ensure Unique test removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 299 place count 1050 transition count 1357
Reduce places removed 298 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 351 rules applied. Total rules applied 650 place count 752 transition count 1304
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 685 place count 717 transition count 1304
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 685 place count 717 transition count 1195
Deduced a syphon composed of 109 places in 2 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 903 place count 608 transition count 1195
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 946 place count 565 transition count 1021
Iterating global reduction 3 with 43 rules applied. Total rules applied 989 place count 565 transition count 1021
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1000 place count 565 transition count 1010
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1000 place count 565 transition count 1008
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1004 place count 563 transition count 1008
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1006 place count 561 transition count 1004
Iterating global reduction 4 with 2 rules applied. Total rules applied 1008 place count 561 transition count 1004
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1010 place count 561 transition count 1002
Performed 195 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 5 with 390 rules applied. Total rules applied 1400 place count 366 transition count 805
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1404 place count 366 transition count 801
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1424 place count 346 transition count 705
Iterating global reduction 6 with 20 rules applied. Total rules applied 1444 place count 346 transition count 705
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 1464 place count 346 transition count 685
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1468 place count 344 transition count 683
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 1568 place count 294 transition count 758
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1583 place count 279 transition count 692
Iterating global reduction 7 with 15 rules applied. Total rules applied 1598 place count 279 transition count 692
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1630 place count 279 transition count 660
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1648 place count 279 transition count 642
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1652 place count 275 transition count 634
Iterating global reduction 8 with 4 rules applied. Total rules applied 1656 place count 275 transition count 634
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1660 place count 271 transition count 566
Iterating global reduction 8 with 4 rules applied. Total rules applied 1664 place count 271 transition count 566
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1668 place count 271 transition count 562
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1669 place count 270 transition count 561
Applied a total of 1669 rules in 134 ms. Remains 270 /1347 variables (removed 1077) and now considering 561/1986 (removed 1425) transitions.
[2023-03-08 12:57:16] [INFO ] Flow matrix only has 538 transitions (discarded 23 similar events)
// Phase 1: matrix 538 rows 270 cols
[2023-03-08 12:57:16] [INFO ] Computed 79 place invariants in 1 ms
[2023-03-08 12:57:17] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 12:57:17] [INFO ] Flow matrix only has 538 transitions (discarded 23 similar events)
[2023-03-08 12:57:17] [INFO ] Invariant cache hit.
[2023-03-08 12:57:17] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-08 12:57:17] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-08 12:57:17] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 12:57:17] [INFO ] Flow matrix only has 538 transitions (discarded 23 similar events)
[2023-03-08 12:57:17] [INFO ] Invariant cache hit.
[2023-03-08 12:57:17] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 270/1347 places, 561/1986 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 719 ms. Remains : 270/1347 places, 561/1986 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s69 1) (EQ s254 1)), p0:(EQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-09 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(X(F(p0))&&p1))))'
Support contains 3 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1333 transition count 1972
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1333 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1333 transition count 1971
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 1325 transition count 1963
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 1325 transition count 1963
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 1320 transition count 1958
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 1320 transition count 1958
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 1318 transition count 1956
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 1318 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1317 transition count 1955
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1317 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1316 transition count 1954
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1316 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1315 transition count 1953
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1314 transition count 1952
Applied a total of 67 rules in 222 ms. Remains 1314 /1347 variables (removed 33) and now considering 1952/1986 (removed 34) transitions.
// Phase 1: matrix 1952 rows 1314 cols
[2023-03-08 12:57:17] [INFO ] Computed 79 place invariants in 10 ms
[2023-03-08 12:57:18] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-08 12:57:18] [INFO ] Invariant cache hit.
[2023-03-08 12:57:18] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2023-03-08 12:57:18] [INFO ] Invariant cache hit.
[2023-03-08 12:57:19] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1314/1347 places, 1952/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2124 ms. Remains : 1314/1347 places, 1952/1986 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) p0), true, (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s392 1) (EQ s1035 1))) (EQ s800 1)), p0:(AND (EQ s392 1) (EQ s1035 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2732 reset in 340 ms.
Product exploration explored 100000 steps with 2675 reset in 325 ms.
Computed a total of 145 stabilizing places and 145 stable transitions
Computed a total of 145 stabilizing places and 145 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 12:57:21] [INFO ] Invariant cache hit.
[2023-03-08 12:57:21] [INFO ] [Real]Absence check using 79 positive place invariants in 34 ms returned sat
[2023-03-08 12:57:22] [INFO ] After 878ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-08 12:57:22] [INFO ] [Nat]Absence check using 79 positive place invariants in 35 ms returned sat
[2023-03-08 12:57:22] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-08 12:57:23] [INFO ] After 823ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-08 12:57:23] [INFO ] After 1172ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 232 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=58 )
Parikh walk visited 2 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 425 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, p0]
Stuttering acceptance computed with spot in 45 ms :[true, p0]
Support contains 3 out of 1314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Graph (trivial) has 1242 edges and 1314 vertex of which 304 / 1314 are part of one of the 22 SCC in 2 ms
Free SCC test removed 282 places
Ensure Unique test removed 316 transitions
Reduce isomorphic transitions removed 316 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 285 rules applied. Total rules applied 286 place count 1031 transition count 1350
Reduce places removed 285 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 336 rules applied. Total rules applied 622 place count 746 transition count 1299
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 657 place count 712 transition count 1298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 658 place count 711 transition count 1298
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 110 Pre rules applied. Total rules applied 658 place count 711 transition count 1188
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 878 place count 601 transition count 1188
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 917 place count 562 transition count 1015
Iterating global reduction 4 with 39 rules applied. Total rules applied 956 place count 562 transition count 1015
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 970 place count 562 transition count 1001
Performed 196 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 196 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 5 with 392 rules applied. Total rules applied 1362 place count 366 transition count 803
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1365 place count 366 transition count 800
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1384 place count 347 transition count 706
Iterating global reduction 6 with 19 rules applied. Total rules applied 1403 place count 347 transition count 706
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1422 place count 347 transition count 687
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 7 with 2 rules applied. Total rules applied 1424 place count 346 transition count 686
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 1524 place count 296 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1525 place count 296 transition count 753
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1541 place count 280 transition count 683
Iterating global reduction 8 with 16 rules applied. Total rules applied 1557 place count 280 transition count 683
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 1588 place count 280 transition count 652
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1603 place count 280 transition count 637
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1607 place count 276 transition count 629
Iterating global reduction 9 with 4 rules applied. Total rules applied 1611 place count 276 transition count 629
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1615 place count 272 transition count 563
Iterating global reduction 9 with 4 rules applied. Total rules applied 1619 place count 272 transition count 563
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1623 place count 272 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1624 place count 271 transition count 558
Applied a total of 1624 rules in 103 ms. Remains 271 /1314 variables (removed 1043) and now considering 558/1952 (removed 1394) transitions.
[2023-03-08 12:57:23] [INFO ] Flow matrix only has 536 transitions (discarded 22 similar events)
// Phase 1: matrix 536 rows 271 cols
[2023-03-08 12:57:23] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-08 12:57:24] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-08 12:57:24] [INFO ] Flow matrix only has 536 transitions (discarded 22 similar events)
[2023-03-08 12:57:24] [INFO ] Invariant cache hit.
[2023-03-08 12:57:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 12:57:24] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-08 12:57:24] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 12:57:24] [INFO ] Flow matrix only has 536 transitions (discarded 22 similar events)
[2023-03-08 12:57:24] [INFO ] Invariant cache hit.
[2023-03-08 12:57:24] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/1314 places, 558/1952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 784 ms. Remains : 271/1314 places, 558/1952 transitions.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, p0]
Finished random walk after 1314 steps, including 1 resets, run visited all 2 properties in 16 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, p0]
Stuttering acceptance computed with spot in 34 ms :[true, p0]
Stuttering acceptance computed with spot in 32 ms :[true, p0]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-10 finished in 7547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(p0) U p1)))))'
Support contains 2 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1334 transition count 1973
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1334 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1334 transition count 1972
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 1327 transition count 1965
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 1327 transition count 1965
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 1323 transition count 1961
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 1323 transition count 1961
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1321 transition count 1959
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1321 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1320 transition count 1958
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1320 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1319 transition count 1957
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1319 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1318 transition count 1956
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1318 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1317 transition count 1955
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1317 transition count 1955
Applied a total of 61 rules in 214 ms. Remains 1317 /1347 variables (removed 30) and now considering 1955/1986 (removed 31) transitions.
// Phase 1: matrix 1955 rows 1317 cols
[2023-03-08 12:57:25] [INFO ] Computed 79 place invariants in 7 ms
[2023-03-08 12:57:25] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-08 12:57:25] [INFO ] Invariant cache hit.
[2023-03-08 12:57:26] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
[2023-03-08 12:57:26] [INFO ] Invariant cache hit.
[2023-03-08 12:57:27] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1317/1347 places, 1955/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2141 ms. Remains : 1317/1347 places, 1955/1986 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s372 1), p0:(EQ s232 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10 reset in 283 ms.
Product exploration explored 100000 steps with 12 reset in 325 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Finished random walk after 8137 steps, including 2 resets, run visited all 2 properties in 85 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 232 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 1317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1317/1317 places, 1955/1955 transitions.
Applied a total of 0 rules in 25 ms. Remains 1317 /1317 variables (removed 0) and now considering 1955/1955 (removed 0) transitions.
[2023-03-08 12:57:28] [INFO ] Invariant cache hit.
[2023-03-08 12:57:29] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-08 12:57:29] [INFO ] Invariant cache hit.
[2023-03-08 12:57:29] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2023-03-08 12:57:29] [INFO ] Invariant cache hit.
[2023-03-08 12:57:30] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1905 ms. Remains : 1317/1317 places, 1955/1955 transitions.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:57:31] [INFO ] Invariant cache hit.
[2023-03-08 12:57:31] [INFO ] [Real]Absence check using 79 positive place invariants in 46 ms returned sat
[2023-03-08 12:57:31] [INFO ] After 564ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 12:57:32] [INFO ] After 662ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-08 12:57:32] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 224 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=112 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11 reset in 279 ms.
Product exploration explored 100000 steps with 11 reset in 362 ms.
Support contains 2 out of 1317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1317/1317 places, 1955/1955 transitions.
Applied a total of 0 rules in 33 ms. Remains 1317 /1317 variables (removed 0) and now considering 1955/1955 (removed 0) transitions.
[2023-03-08 12:57:33] [INFO ] Invariant cache hit.
[2023-03-08 12:57:33] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-08 12:57:33] [INFO ] Invariant cache hit.
[2023-03-08 12:57:34] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2023-03-08 12:57:34] [INFO ] Invariant cache hit.
[2023-03-08 12:57:35] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1942 ms. Remains : 1317/1317 places, 1955/1955 transitions.
Treatment of property DLCshifumi-PT-2b-LTLFireability-11 finished in 10239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Graph (trivial) has 1280 edges and 1347 vertex of which 319 / 1347 are part of one of the 23 SCC in 1 ms
Free SCC test removed 296 places
Ensure Unique test removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 296 place count 1050 transition count 1360
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 348 rules applied. Total rules applied 644 place count 755 transition count 1307
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 679 place count 720 transition count 1307
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 679 place count 720 transition count 1196
Deduced a syphon composed of 111 places in 2 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 901 place count 609 transition count 1196
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 944 place count 566 transition count 1021
Iterating global reduction 3 with 43 rules applied. Total rules applied 987 place count 566 transition count 1021
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 999 place count 566 transition count 1009
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 999 place count 566 transition count 1006
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1005 place count 563 transition count 1006
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1007 place count 561 transition count 1002
Iterating global reduction 4 with 2 rules applied. Total rules applied 1009 place count 561 transition count 1002
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1011 place count 561 transition count 1000
Performed 194 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 5 with 388 rules applied. Total rules applied 1399 place count 367 transition count 804
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1403 place count 367 transition count 800
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1422 place count 348 transition count 706
Iterating global reduction 6 with 19 rules applied. Total rules applied 1441 place count 348 transition count 706
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1460 place count 348 transition count 687
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1464 place count 346 transition count 685
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1562 place count 297 transition count 752
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1577 place count 282 transition count 686
Iterating global reduction 7 with 15 rules applied. Total rules applied 1592 place count 282 transition count 686
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1623 place count 282 transition count 655
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 1638 place count 282 transition count 640
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1642 place count 278 transition count 632
Iterating global reduction 8 with 4 rules applied. Total rules applied 1646 place count 278 transition count 632
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1650 place count 274 transition count 566
Iterating global reduction 8 with 4 rules applied. Total rules applied 1654 place count 274 transition count 566
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1658 place count 274 transition count 562
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1659 place count 273 transition count 561
Applied a total of 1659 rules in 112 ms. Remains 273 /1347 variables (removed 1074) and now considering 561/1986 (removed 1425) transitions.
[2023-03-08 12:57:35] [INFO ] Flow matrix only has 538 transitions (discarded 23 similar events)
// Phase 1: matrix 538 rows 273 cols
[2023-03-08 12:57:35] [INFO ] Computed 79 place invariants in 4 ms
[2023-03-08 12:57:35] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-08 12:57:35] [INFO ] Flow matrix only has 538 transitions (discarded 23 similar events)
[2023-03-08 12:57:35] [INFO ] Invariant cache hit.
[2023-03-08 12:57:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 12:57:35] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-08 12:57:35] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 12:57:35] [INFO ] Flow matrix only has 538 transitions (discarded 23 similar events)
[2023-03-08 12:57:35] [INFO ] Invariant cache hit.
[2023-03-08 12:57:36] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/1347 places, 561/1986 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 703 ms. Remains : 273/1347 places, 561/1986 transitions.
Stuttering acceptance computed with spot in 1330 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-12 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s22 0), p1:(EQ s65 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 223 steps with 0 reset in 4 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-12 finished in 2058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0) U X(p1))) U p2)))'
Support contains 4 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1334 transition count 1973
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1334 transition count 1973
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1326 transition count 1965
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1326 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1320 transition count 1959
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1320 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1318 transition count 1957
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1318 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1317 transition count 1956
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1317 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1316 transition count 1955
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1316 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1315 transition count 1954
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1315 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1314 transition count 1953
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1314 transition count 1953
Applied a total of 66 rules in 209 ms. Remains 1314 /1347 variables (removed 33) and now considering 1953/1986 (removed 33) transitions.
// Phase 1: matrix 1953 rows 1314 cols
[2023-03-08 12:57:37] [INFO ] Computed 79 place invariants in 14 ms
[2023-03-08 12:57:37] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-08 12:57:37] [INFO ] Invariant cache hit.
[2023-03-08 12:57:38] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2023-03-08 12:57:38] [INFO ] Invariant cache hit.
[2023-03-08 12:57:39] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1314/1347 places, 1953/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2123 ms. Remains : 1314/1347 places, 1953/1986 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s264 1) (EQ s1006 1)), p0:(EQ s259 1), p1:(EQ s152 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25622 steps with 4 reset in 112 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-13 finished in 2479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1332 transition count 1971
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1332 transition count 1971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1332 transition count 1970
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1323 transition count 1961
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1323 transition count 1961
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 1317 transition count 1955
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1314 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1313 transition count 1951
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1313 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1312 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1312 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1311 transition count 1949
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1311 transition count 1949
Applied a total of 73 rules in 216 ms. Remains 1311 /1347 variables (removed 36) and now considering 1949/1986 (removed 37) transitions.
// Phase 1: matrix 1949 rows 1311 cols
[2023-03-08 12:57:40] [INFO ] Computed 79 place invariants in 9 ms
[2023-03-08 12:57:40] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-08 12:57:40] [INFO ] Invariant cache hit.
[2023-03-08 12:57:41] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2023-03-08 12:57:41] [INFO ] Invariant cache hit.
[2023-03-08 12:57:41] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1311/1347 places, 1949/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2052 ms. Remains : 1311/1347 places, 1949/1986 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s657 1) (EQ s1279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 8410 steps with 0 reset in 27 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-14 finished in 2176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 3 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1333 transition count 1972
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1333 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1333 transition count 1971
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 1324 transition count 1962
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 1324 transition count 1962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 1318 transition count 1956
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1316 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1316 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1315 transition count 1953
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1315 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1314 transition count 1952
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1314 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1313 transition count 1951
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1313 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1312 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1312 transition count 1950
Applied a total of 71 rules in 215 ms. Remains 1312 /1347 variables (removed 35) and now considering 1950/1986 (removed 36) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2023-03-08 12:57:42] [INFO ] Computed 79 place invariants in 13 ms
[2023-03-08 12:57:42] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-08 12:57:42] [INFO ] Invariant cache hit.
[2023-03-08 12:57:43] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-03-08 12:57:43] [INFO ] Invariant cache hit.
[2023-03-08 12:57:44] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1312/1347 places, 1950/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2110 ms. Remains : 1312/1347 places, 1950/1986 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s769 1) (EQ s1082 1)), p0:(EQ s308 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-15 finished in 2247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(G((G(p2)||p1)))))))))'
Found a Shortening insensitive property : DLCshifumi-PT-2b-LTLFireability-00
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Graph (trivial) has 1280 edges and 1347 vertex of which 319 / 1347 are part of one of the 23 SCC in 2 ms
Free SCC test removed 296 places
Ensure Unique test removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 299 place count 1050 transition count 1357
Reduce places removed 298 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 348 rules applied. Total rules applied 647 place count 752 transition count 1307
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 680 place count 719 transition count 1307
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 680 place count 719 transition count 1197
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 900 place count 609 transition count 1197
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 945 place count 564 transition count 1020
Iterating global reduction 3 with 45 rules applied. Total rules applied 990 place count 564 transition count 1020
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1002 place count 564 transition count 1008
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1002 place count 564 transition count 1005
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1008 place count 561 transition count 1005
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1010 place count 559 transition count 1001
Iterating global reduction 4 with 2 rules applied. Total rules applied 1012 place count 559 transition count 1001
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1014 place count 559 transition count 999
Performed 192 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 5 with 384 rules applied. Total rules applied 1398 place count 367 transition count 805
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1402 place count 367 transition count 801
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1422 place count 347 transition count 705
Iterating global reduction 6 with 20 rules applied. Total rules applied 1442 place count 347 transition count 705
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 1462 place count 347 transition count 685
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1466 place count 345 transition count 683
Performed 48 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1562 place count 297 transition count 750
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1576 place count 283 transition count 688
Iterating global reduction 7 with 14 rules applied. Total rules applied 1590 place count 283 transition count 688
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1619 place count 283 transition count 659
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1623 place count 283 transition count 655
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1624 place count 282 transition count 654
Applied a total of 1624 rules in 98 ms. Remains 282 /1347 variables (removed 1065) and now considering 654/1986 (removed 1332) transitions.
[2023-03-08 12:57:44] [INFO ] Flow matrix only has 627 transitions (discarded 27 similar events)
// Phase 1: matrix 627 rows 282 cols
[2023-03-08 12:57:44] [INFO ] Computed 79 place invariants in 3 ms
[2023-03-08 12:57:44] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 12:57:44] [INFO ] Flow matrix only has 627 transitions (discarded 27 similar events)
[2023-03-08 12:57:44] [INFO ] Invariant cache hit.
[2023-03-08 12:57:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-08 12:57:45] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-08 12:57:45] [INFO ] Flow matrix only has 627 transitions (discarded 27 similar events)
[2023-03-08 12:57:45] [INFO ] Invariant cache hit.
[2023-03-08 12:57:45] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 282/1347 places, 654/1986 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 715 ms. Remains : 282/1347 places, 654/1986 transitions.
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}, { cond=p0, acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={1} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1 0), p1:(OR (EQ s55 0) (EQ s158 0)), p2:(EQ s21 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1830 steps with 0 reset in 8 ms.
Treatment of property DLCshifumi-PT-2b-LTLFireability-00 finished in 1106 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(p0) U p1)))))'
Found a Lengthening insensitive property : DLCshifumi-PT-2b-LTLFireability-11
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 1347 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1347/1347 places, 1986/1986 transitions.
Graph (trivial) has 1280 edges and 1347 vertex of which 313 / 1347 are part of one of the 23 SCC in 1 ms
Free SCC test removed 290 places
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 299 transitions
Trivial Post-agglo rules discarded 299 transitions
Performed 299 trivial Post agglomeration. Transition count delta: 299
Iterating post reduction 0 with 299 rules applied. Total rules applied 300 place count 1056 transition count 1363
Reduce places removed 299 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 352 rules applied. Total rules applied 652 place count 757 transition count 1310
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 687 place count 722 transition count 1310
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 687 place count 722 transition count 1199
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 909 place count 611 transition count 1199
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 953 place count 567 transition count 1023
Iterating global reduction 3 with 44 rules applied. Total rules applied 997 place count 567 transition count 1023
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1009 place count 567 transition count 1011
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1009 place count 567 transition count 1008
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1015 place count 564 transition count 1008
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1016 place count 563 transition count 1006
Iterating global reduction 4 with 1 rules applied. Total rules applied 1017 place count 563 transition count 1006
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1018 place count 563 transition count 1005
Performed 194 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 5 with 388 rules applied. Total rules applied 1406 place count 369 transition count 809
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1410 place count 369 transition count 805
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1429 place count 350 transition count 711
Iterating global reduction 6 with 19 rules applied. Total rules applied 1448 place count 350 transition count 711
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1467 place count 350 transition count 692
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1471 place count 348 transition count 690
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 1571 place count 298 transition count 758
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1586 place count 283 transition count 692
Iterating global reduction 7 with 15 rules applied. Total rules applied 1601 place count 283 transition count 692
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1632 place count 283 transition count 661
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1636 place count 283 transition count 657
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1637 place count 282 transition count 656
Applied a total of 1637 rules in 89 ms. Remains 282 /1347 variables (removed 1065) and now considering 656/1986 (removed 1330) transitions.
[2023-03-08 12:57:45] [INFO ] Flow matrix only has 627 transitions (discarded 29 similar events)
// Phase 1: matrix 627 rows 282 cols
[2023-03-08 12:57:45] [INFO ] Computed 79 place invariants in 3 ms
[2023-03-08 12:57:45] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-08 12:57:45] [INFO ] Flow matrix only has 627 transitions (discarded 29 similar events)
[2023-03-08 12:57:45] [INFO ] Invariant cache hit.
[2023-03-08 12:57:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 12:57:46] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-08 12:57:46] [INFO ] Flow matrix only has 627 transitions (discarded 29 similar events)
[2023-03-08 12:57:46] [INFO ] Invariant cache hit.
[2023-03-08 12:57:46] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 282/1347 places, 656/1986 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 686 ms. Remains : 282/1347 places, 656/1986 transitions.
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s41 1), p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 566 steps with 0 reset in 3 ms.
Treatment of property DLCshifumi-PT-2b-LTLFireability-11 finished in 836 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 12:57:46] [INFO ] Flatten gal took : 55 ms
[2023-03-08 12:57:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 12:57:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1347 places, 1986 transitions and 5298 arcs took 10 ms.
Total runtime 70045 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DLCshifumi-PT-2b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678280328738

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DLCshifumi-PT-2b-LTLFireability-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 6/32 DLCshifumi-PT-2b-LTLFireability-00 473554 m, 94710 m/sec, 509056 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 12/32 DLCshifumi-PT-2b-LTLFireability-00 977790 m, 100847 m/sec, 1051163 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 18/32 DLCshifumi-PT-2b-LTLFireability-00 1500210 m, 104484 m/sec, 1612738 t fired, .

Time elapsed: 15 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 24/32 DLCshifumi-PT-2b-LTLFireability-00 2004662 m, 100890 m/sec, 2155264 t fired, .

Time elapsed: 20 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 30/32 DLCshifumi-PT-2b-LTLFireability-00 2506571 m, 100381 m/sec, 2694567 t fired, .

Time elapsed: 25 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for DLCshifumi-PT-2b-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 DLCshifumi-PT-2b-LTLFireability-11
lola: time limit : 3570 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3570 7/32 DLCshifumi-PT-2b-LTLFireability-11 524953 m, 104990 m/sec, 564338 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3570 13/32 DLCshifumi-PT-2b-LTLFireability-11 1033963 m, 101802 m/sec, 1111553 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3570 19/32 DLCshifumi-PT-2b-LTLFireability-11 1557310 m, 104669 m/sec, 1674120 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3570 25/32 DLCshifumi-PT-2b-LTLFireability-11 2076124 m, 103762 m/sec, 2232091 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3570 31/32 DLCshifumi-PT-2b-LTLFireability-11 2591999 m, 103175 m/sec, 2786839 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for DLCshifumi-PT-2b-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DLCshifumi-PT-2b-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
DLCshifumi-PT-2b-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DLCshifumi-PT-2b-LTLFireability-00: LTL unknown AGGR
DLCshifumi-PT-2b-LTLFireability-11: LTL unknown AGGR


Time elapsed: 60 secs. Pages in use: 32

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="DLCshifumi-PT-2b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DLCshifumi-PT-2b, 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 r103-tall-167814478800804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-2b.tgz
mv DLCshifumi-PT-2b 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 ;