About the Execution of GreatSPN+red for Ring-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3615.147 | 1109395.00 | 1191590.00 | 3610.10 | FFFFFFFFFFF?FFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r333-tall-171679077500004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Ring-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077500004
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 03:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 47K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Ring-PT-none-LTLFireability-00
FORMULA_NAME Ring-PT-none-LTLFireability-01
FORMULA_NAME Ring-PT-none-LTLFireability-02
FORMULA_NAME Ring-PT-none-LTLFireability-03
FORMULA_NAME Ring-PT-none-LTLFireability-04
FORMULA_NAME Ring-PT-none-LTLFireability-05
FORMULA_NAME Ring-PT-none-LTLFireability-06
FORMULA_NAME Ring-PT-none-LTLFireability-07
FORMULA_NAME Ring-PT-none-LTLFireability-08
FORMULA_NAME Ring-PT-none-LTLFireability-09
FORMULA_NAME Ring-PT-none-LTLFireability-10
FORMULA_NAME Ring-PT-none-LTLFireability-11
FORMULA_NAME Ring-PT-none-LTLFireability-12
FORMULA_NAME Ring-PT-none-LTLFireability-13
FORMULA_NAME Ring-PT-none-LTLFireability-14
FORMULA_NAME Ring-PT-none-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716791982175
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Ring-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:39:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 06:39:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:39:43] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-27 06:39:43] [INFO ] Transformed 139 places.
[2024-05-27 06:39:43] [INFO ] Transformed 87 transitions.
[2024-05-27 06:39:43] [INFO ] Found NUPN structural information;
[2024-05-27 06:39:43] [INFO ] Parsed PT model containing 139 places and 87 transitions and 410 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 6 places and 0 transitions.
FORMULA Ring-PT-none-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 87/87 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 133 cols
[2024-05-27 06:39:44] [INFO ] Computed 58 invariants in 6 ms
[2024-05-27 06:39:44] [INFO ] Implicit Places using invariants in 260 ms returned [3, 19, 22, 28, 30, 33, 34, 35, 36, 37, 38, 39, 40, 87, 92]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 291 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/133 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 118/133 places, 87/87 transitions.
Support contains 45 out of 118 places after structural reductions.
[2024-05-27 06:39:44] [INFO ] Flatten gal took : 30 ms
[2024-05-27 06:39:44] [INFO ] Flatten gal took : 12 ms
[2024-05-27 06:39:44] [INFO ] Input system was already deterministic with 87 transitions.
RANDOM walk for 17060 steps (3 resets) in 449 ms. (37 steps per ms) remains 0/20 properties
FORMULA Ring-PT-none-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(!p1))))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 118 cols
[2024-05-27 06:39:45] [INFO ] Computed 43 invariants in 6 ms
[2024-05-27 06:39:45] [INFO ] Implicit Places using invariants in 113 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 118 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 1061 reset in 405 ms.
Stack based approach found an accepted trace after 2264 steps with 23 reset with depth 75 and stack size 75 in 7 ms.
FORMULA Ring-PT-none-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-00 finished in 972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 115 transition count 84
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 115 transition count 80
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 111 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 106 transition count 76
Applied a total of 23 rules in 31 ms. Remains 106 /118 variables (removed 12) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 106 cols
[2024-05-27 06:39:46] [INFO ] Computed 42 invariants in 1 ms
[2024-05-27 06:39:46] [INFO ] Implicit Places using invariants in 97 ms returned [23, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/118 places, 76/87 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 74
Applied a total of 4 rules in 9 ms. Remains 102 /104 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 102 cols
[2024-05-27 06:39:46] [INFO ] Computed 40 invariants in 0 ms
[2024-05-27 06:39:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 06:39:46] [INFO ] Invariant cache hit.
[2024-05-27 06:39:46] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/118 places, 74/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 360 ms. Remains : 102/118 places, 74/87 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-04
Product exploration explored 100000 steps with 962 reset in 231 ms.
Stack based approach found an accepted trace after 2752 steps with 24 reset with depth 77 and stack size 77 in 8 ms.
FORMULA Ring-PT-none-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-04 finished in 691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 118 cols
[2024-05-27 06:39:46] [INFO ] Computed 43 invariants in 4 ms
[2024-05-27 06:39:46] [INFO ] Implicit Places using invariants in 102 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 104 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-06
Product exploration explored 100000 steps with 2871 reset in 191 ms.
Stack based approach found an accepted trace after 727 steps with 24 reset with depth 67 and stack size 67 in 2 ms.
FORMULA Ring-PT-none-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-06 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-27 06:39:47] [INFO ] Invariant cache hit.
[2024-05-27 06:39:47] [INFO ] Implicit Places using invariants in 79 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 81 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-07
Product exploration explored 100000 steps with 893 reset in 220 ms.
Stack based approach found an accepted trace after 6806 steps with 71 reset with depth 28 and stack size 28 in 17 ms.
FORMULA Ring-PT-none-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-07 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (X((p1 U (p2||F(p3))))&&F(p0))))'
Support contains 10 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-27 06:39:47] [INFO ] Invariant cache hit.
[2024-05-27 06:39:47] [INFO ] Implicit Places using invariants in 77 ms returned [27, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 116/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : Ring-PT-none-LTLFireability-08
Product exploration explored 100000 steps with 1240 reset in 260 ms.
Stack based approach found an accepted trace after 2073 steps with 28 reset with depth 13 and stack size 13 in 6 ms.
FORMULA Ring-PT-none-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-08 finished in 617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p0||G(p1)))) U G(p2))))'
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-27 06:39:48] [INFO ] Invariant cache hit.
[2024-05-27 06:39:48] [INFO ] Implicit Places using invariants in 77 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Ring-PT-none-LTLFireability-09
Product exploration explored 100000 steps with 1376 reset in 236 ms.
Stack based approach found an accepted trace after 619 steps with 10 reset with depth 196 and stack size 196 in 2 ms.
FORMULA Ring-PT-none-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-09 finished in 543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U p1))))'
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-27 06:39:48] [INFO ] Invariant cache hit.
[2024-05-27 06:39:48] [INFO ] Implicit Places using invariants in 84 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 230 ms.
Stack based approach found an accepted trace after 1888 steps with 0 reset with depth 1889 and stack size 1888 in 5 ms.
FORMULA Ring-PT-none-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-10 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-27 06:39:49] [INFO ] Invariant cache hit.
[2024-05-27 06:39:49] [INFO ] Implicit Places using invariants in 81 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 117/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-11
Product exploration explored 100000 steps with 131 reset in 220 ms.
Product exploration explored 100000 steps with 93 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 4 factoid took 244 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 8356 steps (1 resets) in 50 ms. (163 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 117 cols
[2024-05-27 06:39:50] [INFO ] Computed 42 invariants in 1 ms
[2024-05-27 06:39:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 06:39:50] [INFO ] Invariant cache hit.
[2024-05-27 06:39:51] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-27 06:39:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 10/117 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 87/204 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 276 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1782 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 10/117 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 87/204 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 75/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 351 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1721 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 3538ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3547ms
Finished structural reductions in LTL mode , in 1 iterations and 3725 ms. Remains : 117/117 places, 87/87 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 1974 steps (0 resets) in 27 ms. (70 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 271 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 135 reset in 225 ms.
Product exploration explored 100000 steps with 127 reset in 258 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 87/87 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 4 place count 117 transition count 87
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 117 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 115 transition count 85
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 115 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 115 transition count 85
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 16 rules in 23 ms. Remains 115 /117 variables (removed 2) and now considering 85/87 (removed 2) transitions.
[2024-05-27 06:39:56] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
// Phase 1: matrix 85 rows 115 cols
[2024-05-27 06:39:56] [INFO ] Computed 42 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-27 06:39:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2024-05-27 06:39:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-27 06:39:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 3/33 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 10/115 variables, 12/45 constraints. Problems are: Problem set: 3 solved, 70 unsolved
[2024-05-27 06:39:57] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 16 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-27 06:39:57] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 4 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-27 06:39:57] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-27 06:39:57] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-27 06:39:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-27 06:39:58] [INFO ] Deduced a trap composed of 11 places in 460 ms of which 23 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 6/51 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/51 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 85/200 variables, 115/166 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/166 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/166 constraints. Problems are: Problem set: 10 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 166 constraints, problems are : Problem set: 10 solved, 63 unsolved in 2552 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 10 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 26/26 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/27 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/30 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/30 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 20/115 variables, 15/45 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 6/51 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/51 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 85/200 variables, 115/166 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 63/229 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/229 constraints. Problems are: Problem set: 10 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/229 constraints. Problems are: Problem set: 10 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 229 constraints, problems are : Problem set: 10 solved, 63 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 63/73 constraints, Known Traps: 9/9 constraints]
After SMT, in 4793ms problems are : Problem set: 10 solved, 63 unsolved
Search for dead transitions found 10 dead transitions in 4794ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 75/87 transitions.
Graph (complete) has 299 edges and 115 vertex of which 105 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 105 /115 variables (removed 10) and now considering 75/75 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 105/117 places, 75/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4852 ms. Remains : 105/117 places, 75/87 transitions.
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 117 cols
[2024-05-27 06:40:01] [INFO ] Computed 42 invariants in 1 ms
[2024-05-27 06:40:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 06:40:01] [INFO ] Invariant cache hit.
[2024-05-27 06:40:01] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-27 06:40:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 10/117 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 87/204 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 276 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1563 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 10/117 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 87/204 variables, 117/276 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 75/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 351 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1605 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 3192ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3193ms
Finished structural reductions in LTL mode , in 1 iterations and 3378 ms. Remains : 117/117 places, 87/87 transitions.
Treatment of property Ring-PT-none-LTLFireability-11 finished in 15567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(X(X(!p0))&&F(!p1)))))))'
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 118 cols
[2024-05-27 06:40:04] [INFO ] Computed 43 invariants in 2 ms
[2024-05-27 06:40:04] [INFO ] Implicit Places using invariants in 149 ms returned [19, 27, 76]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 158 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/118 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 115/118 places, 87/87 transitions.
Stuttering acceptance computed with spot in 357 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Running random walk in product with property : Ring-PT-none-LTLFireability-12
Product exploration explored 100000 steps with 19935 reset in 173 ms.
Product exploration explored 100000 steps with 19909 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
RANDOM walk for 612 steps (0 resets) in 11 ms. (51 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 226 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 115 cols
[2024-05-27 06:40:06] [INFO ] Computed 40 invariants in 1 ms
[2024-05-27 06:40:06] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-27 06:40:06] [INFO ] Invariant cache hit.
[2024-05-27 06:40:07] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-27 06:40:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 9/115 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 87/202 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 270 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1477 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 9/115 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 87/202 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 75/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 345 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1583 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 3076ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3077ms
Finished structural reductions in LTL mode , in 1 iterations and 3341 ms. Remains : 115/115 places, 87/87 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 419 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
RANDOM walk for 844 steps (0 resets) in 8 ms. (93 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 240 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 229 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 252 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Product exploration explored 100000 steps with 19943 reset in 156 ms.
Product exploration explored 100000 steps with 19927 reset in 184 ms.
Applying partial POR strategy [false, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 255 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 87/87 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 87
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 115 transition count 87
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 115 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 113 transition count 85
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 113 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 113 transition count 85
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 19 rules in 16 ms. Remains 113 /115 variables (removed 2) and now considering 85/87 (removed 2) transitions.
[2024-05-27 06:40:12] [INFO ] Redundant transitions in 2 ms returned []
Running 73 sub problems to find dead transitions.
// Phase 1: matrix 85 rows 113 cols
[2024-05-27 06:40:12] [INFO ] Computed 40 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-27 06:40:12] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-27 06:40:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-27 06:40:13] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/31 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 9/113 variables, 12/43 constraints. Problems are: Problem set: 3 solved, 70 unsolved
[2024-05-27 06:40:13] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-27 06:40:13] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-27 06:40:13] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD28 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/46 constraints. Problems are: Problem set: 9 solved, 64 unsolved
[2024-05-27 06:40:13] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-27 06:40:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-27 06:40:13] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/49 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/49 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 85/198 variables, 113/162 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/162 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/162 constraints. Problems are: Problem set: 13 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 162 constraints, problems are : Problem set: 13 solved, 60 unsolved in 2098 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 13 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 25/25 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 3/28 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/28 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 22/113 variables, 15/43 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 6/49 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/49 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 85/198 variables, 113/162 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 60/222 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/222 constraints. Problems are: Problem set: 13 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/222 constraints. Problems are: Problem set: 13 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 222 constraints, problems are : Problem set: 13 solved, 60 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 60/73 constraints, Known Traps: 9/9 constraints]
After SMT, in 3374ms problems are : Problem set: 13 solved, 60 unsolved
Search for dead transitions found 13 dead transitions in 3375ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/115 places, 72/87 transitions.
Graph (complete) has 285 edges and 113 vertex of which 100 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 100 /113 variables (removed 13) and now considering 72/72 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/115 places, 72/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3401 ms. Remains : 100/115 places, 72/87 transitions.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 87/87 transitions.
Applied a total of 0 rules in 0 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 115 cols
[2024-05-27 06:40:16] [INFO ] Computed 40 invariants in 0 ms
[2024-05-27 06:40:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-27 06:40:16] [INFO ] Invariant cache hit.
[2024-05-27 06:40:16] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-27 06:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 9/115 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 87/202 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 270 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1394 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 9/115 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 87/202 variables, 115/270 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 75/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 345 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1601 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 3017ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3019ms
Finished structural reductions in LTL mode , in 1 iterations and 3204 ms. Remains : 115/115 places, 87/87 transitions.
Treatment of property Ring-PT-none-LTLFireability-12 finished in 14508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 118 transition count 83
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 114 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 113 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 113 transition count 78
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 109 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 27 place count 104 transition count 74
Applied a total of 27 rules in 24 ms. Remains 104 /118 variables (removed 14) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 104 cols
[2024-05-27 06:40:19] [INFO ] Computed 42 invariants in 1 ms
[2024-05-27 06:40:19] [INFO ] Implicit Places using invariants in 92 ms returned [23, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/118 places, 74/87 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 100 transition count 72
Applied a total of 4 rules in 4 ms. Remains 100 /102 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 100 cols
[2024-05-27 06:40:19] [INFO ] Computed 40 invariants in 0 ms
[2024-05-27 06:40:19] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-27 06:40:19] [INFO ] Invariant cache hit.
[2024-05-27 06:40:19] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/118 places, 72/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 461 ms. Remains : 100/118 places, 72/87 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 226 ms.
Stack based approach found an accepted trace after 349 steps with 0 reset with depth 350 and stack size 349 in 1 ms.
FORMULA Ring-PT-none-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-13 finished in 740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 87/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 118 transition count 82
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 113 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 113 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 110 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 25 place count 105 transition count 75
Applied a total of 25 rules in 9 ms. Remains 105 /118 variables (removed 13) and now considering 75/87 (removed 12) transitions.
// Phase 1: matrix 75 rows 105 cols
[2024-05-27 06:40:20] [INFO ] Computed 42 invariants in 0 ms
[2024-05-27 06:40:20] [INFO ] Implicit Places using invariants in 214 ms returned [24, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 219 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/118 places, 75/87 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 73
Applied a total of 4 rules in 7 ms. Remains 101 /103 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 101 cols
[2024-05-27 06:40:20] [INFO ] Computed 40 invariants in 1 ms
[2024-05-27 06:40:20] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-27 06:40:20] [INFO ] Invariant cache hit.
[2024-05-27 06:40:20] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/118 places, 73/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 463 ms. Remains : 101/118 places, 73/87 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 218 ms.
Stack based approach found an accepted trace after 610 steps with 0 reset with depth 611 and stack size 611 in 1 ms.
FORMULA Ring-PT-none-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-14 finished in 773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(X(X(!p0))&&F(!p1)))))))'
[2024-05-27 06:40:21] [INFO ] Flatten gal took : 12 ms
[2024-05-27 06:40:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-27 06:40:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 118 places, 87 transitions and 340 arcs took 3 ms.
Total runtime 37544 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Ring-PT-none
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 118
TRANSITIONS: 87
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1406
MODEL NAME: /home/mcc/execution/414/model
118 places, 87 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Ring-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Ring-PT-none-LTLFireability-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716793091570
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
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="Ring-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Ring-PT-none, 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 r333-tall-171679077500004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Ring-PT-none.tgz
mv Ring-PT-none 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 '
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 ;