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.r105-tall-167814481500692.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 ltsminxred
Input is DLCround-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481500692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:20 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.8K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 963K 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 DLCround-PT-07b-LTLFireability-00
FORMULA_NAME DLCround-PT-07b-LTLFireability-01
FORMULA_NAME DLCround-PT-07b-LTLFireability-02
FORMULA_NAME DLCround-PT-07b-LTLFireability-03
FORMULA_NAME DLCround-PT-07b-LTLFireability-04
FORMULA_NAME DLCround-PT-07b-LTLFireability-05
FORMULA_NAME DLCround-PT-07b-LTLFireability-06
FORMULA_NAME DLCround-PT-07b-LTLFireability-07
FORMULA_NAME DLCround-PT-07b-LTLFireability-08
FORMULA_NAME DLCround-PT-07b-LTLFireability-09
FORMULA_NAME DLCround-PT-07b-LTLFireability-10
FORMULA_NAME DLCround-PT-07b-LTLFireability-11
FORMULA_NAME DLCround-PT-07b-LTLFireability-12
FORMULA_NAME DLCround-PT-07b-LTLFireability-13
FORMULA_NAME DLCround-PT-07b-LTLFireability-14
FORMULA_NAME DLCround-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678361836057

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 11:37:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 11:37:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:37:17] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-09 11:37:17] [INFO ] Transformed 2703 places.
[2023-03-09 11:37:18] [INFO ] Transformed 4071 transitions.
[2023-03-09 11:37:18] [INFO ] Found NUPN structural information;
[2023-03-09 11:37:18] [INFO ] Parsed PT model containing 2703 places and 4071 transitions and 11073 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DLCround-PT-07b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Discarding 471 places :
Symmetric choice reduction at 0 with 471 rule applications. Total rules 471 place count 2232 transition count 3600
Iterating global reduction 0 with 471 rules applied. Total rules applied 942 place count 2232 transition count 3600
Discarding 372 places :
Symmetric choice reduction at 0 with 372 rule applications. Total rules 1314 place count 1860 transition count 3228
Iterating global reduction 0 with 372 rules applied. Total rules applied 1686 place count 1860 transition count 3228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 1694 place count 1860 transition count 3220
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 1747 place count 1807 transition count 3113
Iterating global reduction 1 with 53 rules applied. Total rules applied 1800 place count 1807 transition count 3113
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 1833 place count 1774 transition count 3080
Iterating global reduction 1 with 33 rules applied. Total rules applied 1866 place count 1774 transition count 3080
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1870 place count 1774 transition count 3076
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1887 place count 1757 transition count 3059
Iterating global reduction 2 with 17 rules applied. Total rules applied 1904 place count 1757 transition count 3059
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1921 place count 1740 transition count 3042
Iterating global reduction 2 with 17 rules applied. Total rules applied 1938 place count 1740 transition count 3042
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1955 place count 1723 transition count 3025
Iterating global reduction 2 with 17 rules applied. Total rules applied 1972 place count 1723 transition count 3025
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1983 place count 1712 transition count 3014
Iterating global reduction 2 with 11 rules applied. Total rules applied 1994 place count 1712 transition count 3014
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2002 place count 1704 transition count 3006
Iterating global reduction 2 with 8 rules applied. Total rules applied 2010 place count 1704 transition count 3006
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2018 place count 1696 transition count 2998
Iterating global reduction 2 with 8 rules applied. Total rules applied 2026 place count 1696 transition count 2998
Applied a total of 2026 rules in 1414 ms. Remains 1696 /2703 variables (removed 1007) and now considering 2998/4071 (removed 1073) transitions.
// Phase 1: matrix 2998 rows 1696 cols
[2023-03-09 11:37:19] [INFO ] Computed 132 place invariants in 39 ms
[2023-03-09 11:37:20] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-09 11:37:20] [INFO ] Invariant cache hit.
[2023-03-09 11:37:21] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
[2023-03-09 11:37:21] [INFO ] Invariant cache hit.
[2023-03-09 11:37:23] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1696/2703 places, 2998/4071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4795 ms. Remains : 1696/2703 places, 2998/4071 transitions.
Support contains 36 out of 1696 places after structural reductions.
[2023-03-09 11:37:23] [INFO ] Flatten gal took : 203 ms
[2023-03-09 11:37:23] [INFO ] Flatten gal took : 126 ms
[2023-03-09 11:37:23] [INFO ] Input system was already deterministic with 2998 transitions.
Support contains 32 out of 1696 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 26) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 11:37:24] [INFO ] Invariant cache hit.
[2023-03-09 11:37:25] [INFO ] [Real]Absence check using 132 positive place invariants in 91 ms returned sat
[2023-03-09 11:37:25] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 11:37:25] [INFO ] [Nat]Absence check using 132 positive place invariants in 86 ms returned sat
[2023-03-09 11:37:27] [INFO ] After 1546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 11:37:29] [INFO ] After 2966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 678 ms.
[2023-03-09 11:37:29] [INFO ] After 4405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 3 different solutions.
Finished Parikh walk after 449 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=112 )
Parikh walk visited 9 properties in 29 ms.
FORMULA DLCround-PT-07b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 261 stabilizing places and 261 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' '!(((p0 U p1)||X((G(p0) U (p2&&G(p0))))))'
Support contains 3 out of 1696 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1686 transition count 2958
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1686 transition count 2958
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1682 transition count 2954
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1682 transition count 2954
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1680 transition count 2952
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1680 transition count 2952
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1678 transition count 2950
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1678 transition count 2950
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1676 transition count 2948
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1676 transition count 2948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1674 transition count 2946
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1674 transition count 2946
Applied a total of 44 rules in 317 ms. Remains 1674 /1696 variables (removed 22) and now considering 2946/2998 (removed 52) transitions.
// Phase 1: matrix 2946 rows 1674 cols
[2023-03-09 11:37:30] [INFO ] Computed 132 place invariants in 22 ms
[2023-03-09 11:37:31] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-09 11:37:31] [INFO ] Invariant cache hit.
[2023-03-09 11:37:32] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
[2023-03-09 11:37:32] [INFO ] Invariant cache hit.
[2023-03-09 11:37:33] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1674/1696 places, 2946/2998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3406 ms. Remains : 1674/1696 places, 2946/2998 transitions.
Stuttering acceptance computed with spot in 322 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(EQ s307 1), p0:(EQ s669 1), p2:(EQ s1256 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-00 finished in 3891 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 U G(p1))))'
Support contains 3 out of 1696 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1684 transition count 2956
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1684 transition count 2956
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 1677 transition count 2949
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 1677 transition count 2949
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1674 transition count 2946
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1674 transition count 2946
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1671 transition count 2943
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1671 transition count 2943
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1668 transition count 2940
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1668 transition count 2940
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1665 transition count 2937
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1665 transition count 2937
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1664 transition count 2936
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1664 transition count 2936
Applied a total of 64 rules in 369 ms. Remains 1664 /1696 variables (removed 32) and now considering 2936/2998 (removed 62) transitions.
// Phase 1: matrix 2936 rows 1664 cols
[2023-03-09 11:37:34] [INFO ] Computed 132 place invariants in 21 ms
[2023-03-09 11:37:34] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-09 11:37:34] [INFO ] Invariant cache hit.
[2023-03-09 11:37:36] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2023-03-09 11:37:36] [INFO ] Invariant cache hit.
[2023-03-09 11:37:37] [INFO ] Dead Transitions using invariants and state equation in 1276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1664/1696 places, 2936/2998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3606 ms. Remains : 1664/1696 places, 2936/2998 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s702 1), p0:(AND (EQ s341 1) (EQ s1589 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10288 steps with 0 reset in 106 ms.
FORMULA DLCround-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-02 finished in 3875 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((F(G(p1))&&p0))))'
Support contains 2 out of 1696 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1683 transition count 2955
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1683 transition count 2955
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1676 transition count 2948
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1676 transition count 2948
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 1673 transition count 2945
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 1673 transition count 2945
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1670 transition count 2942
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1670 transition count 2942
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1667 transition count 2939
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1667 transition count 2939
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1664 transition count 2936
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1664 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1663 transition count 2935
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1663 transition count 2935
Applied a total of 66 rules in 354 ms. Remains 1663 /1696 variables (removed 33) and now considering 2935/2998 (removed 63) transitions.
// Phase 1: matrix 2935 rows 1663 cols
[2023-03-09 11:37:38] [INFO ] Computed 132 place invariants in 18 ms
[2023-03-09 11:37:38] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-09 11:37:38] [INFO ] Invariant cache hit.
[2023-03-09 11:37:40] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1939 ms to find 0 implicit places.
[2023-03-09 11:37:40] [INFO ] Invariant cache hit.
[2023-03-09 11:37:41] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1663/1696 places, 2935/2998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3566 ms. Remains : 1663/1696 places, 2935/2998 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s718 1) (EQ s1613 1)), p1:(AND (EQ s718 1) (EQ s1613 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 585 ms.
Product exploration explored 100000 steps with 0 reset in 739 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 249773 steps, run timeout after 3002 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249773 steps, saw 246190 distinct states, run finished after 3003 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 11:37:46] [INFO ] Invariant cache hit.
[2023-03-09 11:37:46] [INFO ] [Real]Absence check using 132 positive place invariants in 82 ms returned sat
[2023-03-09 11:37:47] [INFO ] After 1332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:37:48] [INFO ] [Nat]Absence check using 132 positive place invariants in 82 ms returned sat
[2023-03-09 11:37:49] [INFO ] After 987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:37:49] [INFO ] After 1274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-09 11:37:49] [INFO ] After 1775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 228 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=57 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 162 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 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-09 11:37:50] [INFO ] Invariant cache hit.
[2023-03-09 11:37:51] [INFO ] [Real]Absence check using 132 positive place invariants in 185 ms returned sat
[2023-03-09 11:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:37:55] [INFO ] [Real]Absence check using state equation in 4217 ms returned sat
[2023-03-09 11:37:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:37:56] [INFO ] [Nat]Absence check using 132 positive place invariants in 184 ms returned sat
[2023-03-09 11:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:01] [INFO ] [Nat]Absence check using state equation in 4574 ms returned sat
[2023-03-09 11:38:01] [INFO ] Computed and/alt/rep : 2734/4626/2734 causal constraints (skipped 200 transitions) in 143 ms.
[2023-03-09 11:38:11] [INFO ] Deduced a trap composed of 10 places in 789 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 11:38:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2023-03-09 11:38:11] [INFO ] Invariant cache hit.
[2023-03-09 11:38:12] [INFO ] [Real]Absence check using 132 positive place invariants in 165 ms returned sat
[2023-03-09 11:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:16] [INFO ] [Real]Absence check using state equation in 4114 ms returned sat
[2023-03-09 11:38:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:38:18] [INFO ] [Nat]Absence check using 132 positive place invariants in 183 ms returned sat
[2023-03-09 11:38:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:22] [INFO ] [Nat]Absence check using state equation in 4420 ms returned sat
[2023-03-09 11:38:22] [INFO ] Computed and/alt/rep : 2734/4626/2734 causal constraints (skipped 200 transitions) in 140 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 11:38:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 2935/2935 transitions.
Applied a total of 0 rules in 41 ms. Remains 1663 /1663 variables (removed 0) and now considering 2935/2935 (removed 0) transitions.
[2023-03-09 11:38:32] [INFO ] Invariant cache hit.
[2023-03-09 11:38:32] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-09 11:38:32] [INFO ] Invariant cache hit.
[2023-03-09 11:38:33] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-09 11:38:33] [INFO ] Invariant cache hit.
[2023-03-09 11:38:34] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3009 ms. Remains : 1663/1663 places, 2935/2935 transitions.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 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 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 253590 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253590 steps, saw 249939 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 11:38:38] [INFO ] Invariant cache hit.
[2023-03-09 11:38:38] [INFO ] [Real]Absence check using 132 positive place invariants in 84 ms returned sat
[2023-03-09 11:38:39] [INFO ] After 1290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:38:40] [INFO ] [Nat]Absence check using 132 positive place invariants in 82 ms returned sat
[2023-03-09 11:38:41] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:38:41] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-09 11:38:41] [INFO ] After 1698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 182 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=60 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 230 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 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-09 11:38:41] [INFO ] Invariant cache hit.
[2023-03-09 11:38:43] [INFO ] [Real]Absence check using 132 positive place invariants in 169 ms returned sat
[2023-03-09 11:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:47] [INFO ] [Real]Absence check using state equation in 4383 ms returned sat
[2023-03-09 11:38:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:38:48] [INFO ] [Nat]Absence check using 132 positive place invariants in 180 ms returned sat
[2023-03-09 11:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:38:53] [INFO ] [Nat]Absence check using state equation in 4544 ms returned sat
[2023-03-09 11:38:53] [INFO ] Computed and/alt/rep : 2734/4626/2734 causal constraints (skipped 200 transitions) in 135 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 11:39:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2023-03-09 11:39:02] [INFO ] Invariant cache hit.
[2023-03-09 11:39:03] [INFO ] [Real]Absence check using 132 positive place invariants in 177 ms returned sat
[2023-03-09 11:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:39:07] [INFO ] [Real]Absence check using state equation in 4073 ms returned sat
[2023-03-09 11:39:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:39:09] [INFO ] [Nat]Absence check using 132 positive place invariants in 174 ms returned sat
[2023-03-09 11:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:39:13] [INFO ] [Nat]Absence check using state equation in 4390 ms returned sat
[2023-03-09 11:39:13] [INFO ] Computed and/alt/rep : 2734/4626/2734 causal constraints (skipped 200 transitions) in 135 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 11:39:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 491 ms.
Product exploration explored 100000 steps with 0 reset in 635 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 2 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 2935/2935 transitions.
Graph (trivial) has 1490 edges and 1663 vertex of which 436 / 1663 are part of one of the 36 SCC in 8 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Performed 259 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 259 rules applied. Total rules applied 260 place count 1263 transition count 2503
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 284 place count 1263 transition count 2491
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 284 place count 1263 transition count 2495
Deduced a syphon composed of 279 places in 7 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 292 place count 1263 transition count 2495
Discarding 130 places :
Symmetric choice reduction at 2 with 130 rule applications. Total rules 422 place count 1133 transition count 2027
Deduced a syphon composed of 204 places in 6 ms
Iterating global reduction 2 with 130 rules applied. Total rules applied 552 place count 1133 transition count 2027
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 556 place count 1133 transition count 2023
Performed 422 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 626 places in 1 ms
Iterating global reduction 3 with 422 rules applied. Total rules applied 978 place count 1133 transition count 2031
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 986 place count 1133 transition count 2023
Renaming transitions due to excessive name length > 1024 char.
Discarding 312 places :
Symmetric choice reduction at 4 with 312 rule applications. Total rules 1298 place count 821 transition count 1523
Deduced a syphon composed of 334 places in 1 ms
Iterating global reduction 4 with 312 rules applied. Total rules applied 1610 place count 821 transition count 1523
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1630 place count 821 transition count 1503
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1638 place count 813 transition count 1495
Deduced a syphon composed of 326 places in 0 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 1646 place count 813 transition count 1495
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -181
Deduced a syphon composed of 353 places in 1 ms
Iterating global reduction 5 with 27 rules applied. Total rules applied 1673 place count 813 transition count 1676
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1689 place count 813 transition count 1660
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1728 place count 774 transition count 1518
Deduced a syphon composed of 318 places in 1 ms
Iterating global reduction 6 with 39 rules applied. Total rules applied 1767 place count 774 transition count 1518
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1775 place count 774 transition count 1510
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1783 place count 766 transition count 1494
Deduced a syphon composed of 310 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1791 place count 766 transition count 1494
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 314 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1795 place count 766 transition count 1526
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1799 place count 762 transition count 1518
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1803 place count 762 transition count 1518
Deduced a syphon composed of 310 places in 1 ms
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 7 with 36 rules applied. Total rules applied 1839 place count 762 transition count 1482
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1854 place count 747 transition count 1452
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1869 place count 747 transition count 1452
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1884 place count 732 transition count 1281
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1899 place count 732 transition count 1281
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1921 place count 732 transition count 1259
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1935 place count 718 transition count 1238
Deduced a syphon composed of 296 places in 1 ms
Iterating global reduction 8 with 14 rules applied. Total rules applied 1949 place count 718 transition count 1238
Deduced a syphon composed of 296 places in 1 ms
Applied a total of 1949 rules in 1115 ms. Remains 718 /1663 variables (removed 945) and now considering 1238/2935 (removed 1697) transitions.
[2023-03-09 11:39:25] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-09 11:39:25] [INFO ] Flow matrix only has 1214 transitions (discarded 24 similar events)
// Phase 1: matrix 1214 rows 718 cols
[2023-03-09 11:39:25] [INFO ] Computed 132 place invariants in 23 ms
[2023-03-09 11:39:26] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 718/1663 places, 1238/2935 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1774 ms. Remains : 718/1663 places, 1238/2935 transitions.
Support contains 2 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 2935/2935 transitions.
Applied a total of 0 rules in 38 ms. Remains 1663 /1663 variables (removed 0) and now considering 2935/2935 (removed 0) transitions.
// Phase 1: matrix 2935 rows 1663 cols
[2023-03-09 11:39:26] [INFO ] Computed 132 place invariants in 12 ms
[2023-03-09 11:39:26] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-09 11:39:26] [INFO ] Invariant cache hit.
[2023-03-09 11:39:28] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2023-03-09 11:39:28] [INFO ] Invariant cache hit.
[2023-03-09 11:39:29] [INFO ] Dead Transitions using invariants and state equation in 1156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2988 ms. Remains : 1663/1663 places, 2935/2935 transitions.
Treatment of property DLCround-PT-07b-LTLFireability-03 finished in 111730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))||X(p2)))'
Support contains 5 out of 1696 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1686 transition count 2978
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1686 transition count 2978
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 1680 transition count 2972
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 1680 transition count 2972
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1677 transition count 2969
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1677 transition count 2969
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1674 transition count 2966
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1674 transition count 2966
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1671 transition count 2963
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1671 transition count 2963
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1668 transition count 2960
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1668 transition count 2960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1667 transition count 2959
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1667 transition count 2959
Applied a total of 58 rules in 346 ms. Remains 1667 /1696 variables (removed 29) and now considering 2959/2998 (removed 39) transitions.
// Phase 1: matrix 2959 rows 1667 cols
[2023-03-09 11:39:30] [INFO ] Computed 132 place invariants in 13 ms
[2023-03-09 11:39:30] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-09 11:39:30] [INFO ] Invariant cache hit.
[2023-03-09 11:39:31] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2023-03-09 11:39:31] [INFO ] Invariant cache hit.
[2023-03-09 11:39:32] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1667/1696 places, 2959/2998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3263 ms. Remains : 1667/1696 places, 2959/2998 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(OR p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s619 1) (EQ s1545 1)), p0:(AND (EQ s228 1) (EQ s1347 1)), p2:(EQ s125 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 964 ms.
Product exploration explored 100000 steps with 50000 reset in 1015 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))
Knowledge based reduction with 9 factoid took 143 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-07b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-07b-LTLFireability-05 finished in 5632 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(p0)&&((p1||X(p2)) U (G((p1||X(p2)))||(p3&&(p1||X(p2))))))))'
Support contains 2 out of 1696 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1684 transition count 2956
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1684 transition count 2956
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 1677 transition count 2949
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 1677 transition count 2949
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1674 transition count 2946
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1674 transition count 2946
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1671 transition count 2943
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1671 transition count 2943
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1668 transition count 2940
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1668 transition count 2940
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1665 transition count 2937
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1665 transition count 2937
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1664 transition count 2936
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1664 transition count 2936
Applied a total of 64 rules in 291 ms. Remains 1664 /1696 variables (removed 32) and now considering 2936/2998 (removed 62) transitions.
// Phase 1: matrix 2936 rows 1664 cols
[2023-03-09 11:39:35] [INFO ] Computed 132 place invariants in 6 ms
[2023-03-09 11:39:35] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-09 11:39:35] [INFO ] Invariant cache hit.
[2023-03-09 11:39:37] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
[2023-03-09 11:39:37] [INFO ] Invariant cache hit.
[2023-03-09 11:39:38] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1664/1696 places, 2936/2998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3127 ms. Remains : 1664/1696 places, 2936/2998 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s191 1), p0:(EQ s562 0), p2:(AND (EQ s191 1) (EQ s562 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1611 steps with 0 reset in 11 ms.
FORMULA DLCround-PT-07b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-07 finished in 3306 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 1696 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Graph (trivial) has 1520 edges and 1696 vertex of which 449 / 1696 are part of one of the 36 SCC in 3 ms
Free SCC test removed 413 places
Ensure Unique test removed 445 transitions
Reduce isomorphic transitions removed 445 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 274 place count 1282 transition count 2279
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 309 rules applied. Total rules applied 583 place count 1009 transition count 2243
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 607 place count 985 transition count 2243
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 607 place count 985 transition count 2114
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 865 place count 856 transition count 2114
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 925 place count 796 transition count 1703
Iterating global reduction 3 with 60 rules applied. Total rules applied 985 place count 796 transition count 1703
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 988 place count 796 transition count 1700
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 988 place count 796 transition count 1698
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 992 place count 794 transition count 1698
Performed 301 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 301 places in 0 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 4 with 602 rules applied. Total rules applied 1594 place count 493 transition count 1389
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1602 place count 493 transition count 1381
Renaming transitions due to excessive name length > 1024 char.
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1624 place count 471 transition count 1154
Iterating global reduction 5 with 22 rules applied. Total rules applied 1646 place count 471 transition count 1154
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1667 place count 471 transition count 1133
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1691 place count 459 transition count 1224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1695 place count 459 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1699 place count 455 transition count 1152
Iterating global reduction 7 with 4 rules applied. Total rules applied 1703 place count 455 transition count 1152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1707 place count 455 transition count 1148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1715 place count 451 transition count 1174
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 8 with 33 rules applied. Total rules applied 1748 place count 451 transition count 1141
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1763 place count 436 transition count 1111
Iterating global reduction 8 with 15 rules applied. Total rules applied 1778 place count 436 transition count 1111
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1793 place count 421 transition count 942
Iterating global reduction 8 with 15 rules applied. Total rules applied 1808 place count 421 transition count 942
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1823 place count 421 transition count 927
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1824 place count 420 transition count 926
Applied a total of 1824 rules in 266 ms. Remains 420 /1696 variables (removed 1276) and now considering 926/2998 (removed 2072) transitions.
[2023-03-09 11:39:38] [INFO ] Flow matrix only has 901 transitions (discarded 25 similar events)
// Phase 1: matrix 901 rows 420 cols
[2023-03-09 11:39:38] [INFO ] Computed 132 place invariants in 1 ms
[2023-03-09 11:39:39] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-09 11:39:39] [INFO ] Flow matrix only has 901 transitions (discarded 25 similar events)
[2023-03-09 11:39:39] [INFO ] Invariant cache hit.
[2023-03-09 11:39:39] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-09 11:39:39] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-09 11:39:39] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-09 11:39:39] [INFO ] Flow matrix only has 901 transitions (discarded 25 similar events)
[2023-03-09 11:39:39] [INFO ] Invariant cache hit.
[2023-03-09 11:39:39] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/1696 places, 926/2998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1398 ms. Remains : 420/1696 places, 926/2998 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s44 1) (EQ s356 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 DLCround-PT-07b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-09 finished in 1443 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 p1)||((!p0 U p2)&&F(p3))))'
Support contains 5 out of 1696 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Graph (trivial) has 1513 edges and 1696 vertex of which 449 / 1696 are part of one of the 36 SCC in 2 ms
Free SCC test removed 413 places
Ensure Unique test removed 445 transitions
Reduce isomorphic transitions removed 445 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 270 place count 1282 transition count 2283
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 305 rules applied. Total rules applied 575 place count 1013 transition count 2247
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 600 place count 989 transition count 2246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 988 transition count 2246
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 130 Pre rules applied. Total rules applied 601 place count 988 transition count 2116
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 4 with 260 rules applied. Total rules applied 861 place count 858 transition count 2116
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 919 place count 800 transition count 1707
Iterating global reduction 4 with 58 rules applied. Total rules applied 977 place count 800 transition count 1707
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 980 place count 800 transition count 1704
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 980 place count 800 transition count 1703
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 982 place count 799 transition count 1703
Performed 300 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 300 places in 0 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 5 with 600 rules applied. Total rules applied 1582 place count 499 transition count 1396
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1589 place count 499 transition count 1389
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1610 place count 478 transition count 1170
Iterating global reduction 6 with 21 rules applied. Total rules applied 1631 place count 478 transition count 1170
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 1651 place count 478 transition count 1150
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1675 place count 466 transition count 1242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1679 place count 466 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1683 place count 462 transition count 1170
Iterating global reduction 8 with 4 rules applied. Total rules applied 1687 place count 462 transition count 1170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1691 place count 462 transition count 1166
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1699 place count 458 transition count 1192
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 9 with 33 rules applied. Total rules applied 1732 place count 458 transition count 1159
Discarding 14 places :
Symmetric choice reduction at 9 with 14 rule applications. Total rules 1746 place count 444 transition count 1131
Iterating global reduction 9 with 14 rules applied. Total rules applied 1760 place count 444 transition count 1131
Discarding 14 places :
Symmetric choice reduction at 9 with 14 rule applications. Total rules 1774 place count 430 transition count 973
Iterating global reduction 9 with 14 rules applied. Total rules applied 1788 place count 430 transition count 973
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1802 place count 430 transition count 959
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1803 place count 430 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1804 place count 429 transition count 958
Applied a total of 1804 rules in 279 ms. Remains 429 /1696 variables (removed 1267) and now considering 958/2998 (removed 2040) transitions.
[2023-03-09 11:39:40] [INFO ] Flow matrix only has 932 transitions (discarded 26 similar events)
// Phase 1: matrix 932 rows 429 cols
[2023-03-09 11:39:40] [INFO ] Computed 132 place invariants in 14 ms
[2023-03-09 11:39:40] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 11:39:40] [INFO ] Flow matrix only has 932 transitions (discarded 26 similar events)
[2023-03-09 11:39:40] [INFO ] Invariant cache hit.
[2023-03-09 11:39:40] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-09 11:39:40] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-09 11:39:41] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-09 11:39:41] [INFO ] Flow matrix only has 932 transitions (discarded 26 similar events)
[2023-03-09 11:39:41] [INFO ] Invariant cache hit.
[2023-03-09 11:39:41] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 429/1696 places, 958/2998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1304 ms. Remains : 429/1696 places, 958/2998 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3)), true]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (EQ s54 1) (EQ s380 1)) (EQ s44 1)), p0:(EQ s299 1), p2:(EQ s2 1), p3:(AND (EQ s54 1) (EQ s380 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-11 finished in 1504 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(G(p0)))'
Support contains 1 out of 1696 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Graph (trivial) has 1520 edges and 1696 vertex of which 429 / 1696 are part of one of the 37 SCC in 1 ms
Free SCC test removed 392 places
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 283 place count 1303 transition count 2294
Reduce places removed 282 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 318 rules applied. Total rules applied 601 place count 1021 transition count 2258
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 625 place count 997 transition count 2258
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 625 place count 997 transition count 2126
Deduced a syphon composed of 132 places in 6 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 889 place count 865 transition count 2126
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 947 place count 807 transition count 1717
Iterating global reduction 3 with 58 rules applied. Total rules applied 1005 place count 807 transition count 1717
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1008 place count 807 transition count 1714
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1008 place count 807 transition count 1712
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1012 place count 805 transition count 1712
Performed 306 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 306 places in 0 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 4 with 612 rules applied. Total rules applied 1624 place count 499 transition count 1398
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1632 place count 499 transition count 1390
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1653 place count 478 transition count 1174
Iterating global reduction 5 with 21 rules applied. Total rules applied 1674 place count 478 transition count 1174
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1693 place count 478 transition count 1155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1695 place count 477 transition count 1154
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1721 place count 464 transition count 1257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1726 place count 464 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1730 place count 460 transition count 1184
Iterating global reduction 7 with 4 rules applied. Total rules applied 1734 place count 460 transition count 1184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1738 place count 460 transition count 1180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1746 place count 456 transition count 1206
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1778 place count 456 transition count 1174
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1792 place count 442 transition count 1146
Iterating global reduction 8 with 14 rules applied. Total rules applied 1806 place count 442 transition count 1146
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1820 place count 428 transition count 988
Iterating global reduction 8 with 14 rules applied. Total rules applied 1834 place count 428 transition count 988
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1848 place count 428 transition count 974
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1849 place count 427 transition count 973
Applied a total of 1849 rules in 225 ms. Remains 427 /1696 variables (removed 1269) and now considering 973/2998 (removed 2025) transitions.
[2023-03-09 11:39:41] [INFO ] Flow matrix only has 946 transitions (discarded 27 similar events)
// Phase 1: matrix 946 rows 427 cols
[2023-03-09 11:39:41] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-09 11:39:42] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-09 11:39:42] [INFO ] Flow matrix only has 946 transitions (discarded 27 similar events)
[2023-03-09 11:39:42] [INFO ] Invariant cache hit.
[2023-03-09 11:39:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-09 11:39:42] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2023-03-09 11:39:42] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-09 11:39:42] [INFO ] Flow matrix only has 946 transitions (discarded 27 similar events)
[2023-03-09 11:39:42] [INFO ] Invariant cache hit.
[2023-03-09 11:39:42] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/1696 places, 973/2998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1369 ms. Remains : 427/1696 places, 973/2998 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 272 steps with 0 reset in 8 ms.
FORMULA DLCround-PT-07b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-12 finished in 1418 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)))'
Support contains 1 out of 1696 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Graph (trivial) has 1521 edges and 1696 vertex of which 449 / 1696 are part of one of the 36 SCC in 1 ms
Free SCC test removed 413 places
Ensure Unique test removed 445 transitions
Reduce isomorphic transitions removed 445 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 274 place count 1282 transition count 2279
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 309 rules applied. Total rules applied 583 place count 1009 transition count 2243
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 607 place count 985 transition count 2243
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 607 place count 985 transition count 2114
Deduced a syphon composed of 129 places in 6 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 865 place count 856 transition count 2114
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 926 place count 795 transition count 1692
Iterating global reduction 3 with 61 rules applied. Total rules applied 987 place count 795 transition count 1692
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 990 place count 795 transition count 1689
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 990 place count 795 transition count 1687
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 994 place count 793 transition count 1687
Performed 299 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 1592 place count 494 transition count 1380
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1600 place count 494 transition count 1372
Renaming transitions due to excessive name length > 1024 char.
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1622 place count 472 transition count 1145
Iterating global reduction 5 with 22 rules applied. Total rules applied 1644 place count 472 transition count 1145
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1665 place count 472 transition count 1124
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -127
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1699 place count 455 transition count 1251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1703 place count 455 transition count 1247
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1707 place count 451 transition count 1179
Iterating global reduction 7 with 4 rules applied. Total rules applied 1711 place count 451 transition count 1179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1715 place count 451 transition count 1175
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1723 place count 447 transition count 1201
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 1767 place count 447 transition count 1157
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1783 place count 431 transition count 1125
Iterating global reduction 8 with 16 rules applied. Total rules applied 1799 place count 431 transition count 1125
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1815 place count 415 transition count 935
Iterating global reduction 8 with 16 rules applied. Total rules applied 1831 place count 415 transition count 935
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1847 place count 415 transition count 919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1848 place count 414 transition count 918
Applied a total of 1848 rules in 213 ms. Remains 414 /1696 variables (removed 1282) and now considering 918/2998 (removed 2080) transitions.
[2023-03-09 11:39:43] [INFO ] Flow matrix only has 886 transitions (discarded 32 similar events)
// Phase 1: matrix 886 rows 414 cols
[2023-03-09 11:39:43] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-09 11:39:43] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-09 11:39:43] [INFO ] Flow matrix only has 886 transitions (discarded 32 similar events)
[2023-03-09 11:39:43] [INFO ] Invariant cache hit.
[2023-03-09 11:39:43] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-09 11:39:43] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2023-03-09 11:39:43] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 11:39:43] [INFO ] Flow matrix only has 886 transitions (discarded 32 similar events)
[2023-03-09 11:39:43] [INFO ] Invariant cache hit.
[2023-03-09 11:39:44] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 414/1696 places, 918/2998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1331 ms. Remains : 414/1696 places, 918/2998 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s403 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-13 finished in 1418 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((G(!p0)||(!p0&&F(p1))))))'
Support contains 3 out of 1696 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Graph (trivial) has 1520 edges and 1696 vertex of which 449 / 1696 are part of one of the 36 SCC in 2 ms
Free SCC test removed 413 places
Ensure Unique test removed 445 transitions
Reduce isomorphic transitions removed 445 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 274 place count 1282 transition count 2279
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 309 rules applied. Total rules applied 583 place count 1009 transition count 2243
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 607 place count 985 transition count 2243
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 607 place count 985 transition count 2114
Deduced a syphon composed of 129 places in 6 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 865 place count 856 transition count 2114
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 925 place count 796 transition count 1703
Iterating global reduction 3 with 60 rules applied. Total rules applied 985 place count 796 transition count 1703
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 988 place count 796 transition count 1700
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 988 place count 796 transition count 1698
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 992 place count 794 transition count 1698
Performed 298 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 298 places in 0 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 4 with 596 rules applied. Total rules applied 1588 place count 496 transition count 1393
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1596 place count 496 transition count 1385
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1618 place count 474 transition count 1158
Iterating global reduction 5 with 22 rules applied. Total rules applied 1640 place count 474 transition count 1158
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1661 place count 474 transition count 1137
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1695 place count 457 transition count 1269
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1699 place count 457 transition count 1265
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1703 place count 453 transition count 1193
Iterating global reduction 7 with 4 rules applied. Total rules applied 1707 place count 453 transition count 1193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1711 place count 453 transition count 1189
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1719 place count 449 transition count 1218
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 8 with 46 rules applied. Total rules applied 1765 place count 449 transition count 1172
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1780 place count 434 transition count 1142
Iterating global reduction 8 with 15 rules applied. Total rules applied 1795 place count 434 transition count 1142
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1810 place count 419 transition count 967
Iterating global reduction 8 with 15 rules applied. Total rules applied 1825 place count 419 transition count 967
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1840 place count 419 transition count 952
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1841 place count 419 transition count 952
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1842 place count 419 transition count 951
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1843 place count 418 transition count 949
Iterating global reduction 9 with 1 rules applied. Total rules applied 1844 place count 418 transition count 949
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1845 place count 417 transition count 938
Iterating global reduction 9 with 1 rules applied. Total rules applied 1846 place count 417 transition count 938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1847 place count 417 transition count 937
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1848 place count 416 transition count 936
Applied a total of 1848 rules in 236 ms. Remains 416 /1696 variables (removed 1280) and now considering 936/2998 (removed 2062) transitions.
[2023-03-09 11:39:44] [INFO ] Flow matrix only has 897 transitions (discarded 39 similar events)
// Phase 1: matrix 897 rows 416 cols
[2023-03-09 11:39:44] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-09 11:39:44] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-09 11:39:44] [INFO ] Flow matrix only has 897 transitions (discarded 39 similar events)
[2023-03-09 11:39:44] [INFO ] Invariant cache hit.
[2023-03-09 11:39:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 11:39:45] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-09 11:39:45] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 11:39:45] [INFO ] Flow matrix only has 897 transitions (discarded 39 similar events)
[2023-03-09 11:39:45] [INFO ] Invariant cache hit.
[2023-03-09 11:39:45] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 416/1696 places, 936/2998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1199 ms. Remains : 416/1696 places, 936/2998 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s64 1), p0:(AND (EQ s39 1) (EQ s325 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 512 steps with 0 reset in 13 ms.
FORMULA DLCround-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-14 finished in 1332 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((F(G(p1))&&p0))))'
Found a Shortening insensitive property : DLCround-PT-07b-LTLFireability-03
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 1696 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1696/1696 places, 2998/2998 transitions.
Graph (trivial) has 1520 edges and 1696 vertex of which 449 / 1696 are part of one of the 36 SCC in 2 ms
Free SCC test removed 413 places
Ensure Unique test removed 445 transitions
Reduce isomorphic transitions removed 445 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 273 place count 1282 transition count 2280
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 308 rules applied. Total rules applied 581 place count 1010 transition count 2244
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 605 place count 986 transition count 2244
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 605 place count 986 transition count 2115
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 863 place count 857 transition count 2115
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 923 place count 797 transition count 1704
Iterating global reduction 3 with 60 rules applied. Total rules applied 983 place count 797 transition count 1704
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 986 place count 797 transition count 1701
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 986 place count 797 transition count 1699
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 990 place count 795 transition count 1699
Performed 301 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 301 places in 0 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 4 with 602 rules applied. Total rules applied 1592 place count 494 transition count 1390
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1600 place count 494 transition count 1382
Renaming transitions due to excessive name length > 1024 char.
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1622 place count 472 transition count 1155
Iterating global reduction 5 with 22 rules applied. Total rules applied 1644 place count 472 transition count 1155
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1665 place count 472 transition count 1134
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1689 place count 460 transition count 1225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1693 place count 460 transition count 1221
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1697 place count 456 transition count 1153
Iterating global reduction 7 with 4 rules applied. Total rules applied 1701 place count 456 transition count 1153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1705 place count 456 transition count 1149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1713 place count 452 transition count 1175
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1717 place count 452 transition count 1171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1718 place count 451 transition count 1170
Applied a total of 1718 rules in 168 ms. Remains 451 /1696 variables (removed 1245) and now considering 1170/2998 (removed 1828) transitions.
[2023-03-09 11:39:46] [INFO ] Flow matrix only has 1128 transitions (discarded 42 similar events)
// Phase 1: matrix 1128 rows 451 cols
[2023-03-09 11:39:46] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-09 11:39:46] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-09 11:39:46] [INFO ] Flow matrix only has 1128 transitions (discarded 42 similar events)
[2023-03-09 11:39:46] [INFO ] Invariant cache hit.
[2023-03-09 11:39:46] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-09 11:39:46] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-09 11:39:46] [INFO ] Flow matrix only has 1128 transitions (discarded 42 similar events)
[2023-03-09 11:39:46] [INFO ] Invariant cache hit.
[2023-03-09 11:39:47] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 451/1696 places, 1170/2998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1338 ms. Remains : 451/1696 places, 1170/2998 transitions.
Running random walk in product with property : DLCround-PT-07b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s426 1)), p1:(AND (EQ s82 1) (EQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property DLCround-PT-07b-LTLFireability-03 finished in 1549 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 11:39:47] [INFO ] Flatten gal took : 89 ms
[2023-03-09 11:39:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-09 11:39:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1696 places, 2998 transitions and 8817 arcs took 33 ms.
Total runtime 149802 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1068/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DLCround-PT-07b-LTLFireability-03

BK_STOP 1678361989912

--------------------
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
mcc2023
ltl formula name DLCround-PT-07b-LTLFireability-03
ltl formula formula --ltl=/tmp/1068/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1696 places, 2998 transitions and 8817 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.060 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1068/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1068/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1068/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1068/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-07b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DLCround-PT-07b, 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 r105-tall-167814481500692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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