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.r327-tall-167889200100780.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Ring-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889200100780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 10:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 10:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 10:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 10:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 10:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 47K Mar 5 18:23 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 1679058206022

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Ring-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 13:03:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 13:03:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 13:03:27] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-17 13:03:27] [INFO ] Transformed 139 places.
[2023-03-17 13:03:27] [INFO ] Transformed 87 transitions.
[2023-03-17 13:03:27] [INFO ] Found NUPN structural information;
[2023-03-17 13:03:27] [INFO ] Parsed PT model containing 139 places and 87 transitions and 410 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 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-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 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 117 ms. Remains 133 /133 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 133 cols
[2023-03-17 13:03:28] [INFO ] Computed 58 place invariants in 12 ms
[2023-03-17 13:03:28] [INFO ] Implicit Places using invariants in 198 ms returned [3, 19, 22, 30, 32, 34, 35, 36, 37, 39, 40, 92]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 229 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/133 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 349 ms. Remains : 121/133 places, 87/87 transitions.
Support contains 50 out of 121 places after structural reductions.
[2023-03-17 13:03:28] [INFO ] Flatten gal took : 29 ms
[2023-03-17 13:03:28] [INFO ] Flatten gal took : 14 ms
[2023-03-17 13:03:28] [INFO ] Input system was already deterministic with 87 transitions.
Support contains 48 out of 121 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 121 cols
[2023-03-17 13:03:28] [INFO ] Computed 46 place invariants in 7 ms
[2023-03-17 13:03:28] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-17 13:03:28] [INFO ] [Real]Absence check using 44 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 13:03:28] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X((!p1||G(p0)))&&F(!p2))||G(!p1)))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-17 13:03:29] [INFO ] Invariant cache hit.
[2023-03-17 13:03:29] [INFO ] Implicit Places using invariants in 93 ms returned [19, 25, 28, 29, 76]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 95 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/121 places, 87/87 transitions.
Applied a total of 0 rules in 4 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 103 ms. Remains : 116/121 places, 87/87 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1 p0), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(AND (EQ s89 1) (EQ s90 1)), p1:(AND (EQ s14 1) (EQ s74 1)), p0:(AND (EQ s15 1) (EQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 353 ms.
Product exploration explored 100000 steps with 33333 reset in 202 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) (NOT p0))
Knowledge based reduction with 8 factoid took 258 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Ring-PT-none-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Ring-PT-none-LTLFireability-00 finished in 1316 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)) U G((F(p2)&&p1))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Drop transitions 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 121 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 117 transition count 78
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 19 place count 111 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 109 transition count 76
Applied a total of 23 rules in 35 ms. Remains 109 /121 variables (removed 12) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 109 cols
[2023-03-17 13:03:30] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-17 13:03:30] [INFO ] Implicit Places using invariants in 111 ms returned [24, 25, 67]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 112 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/121 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 104 transition count 74
Applied a total of 4 rules in 9 ms. Remains 104 /106 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 104 cols
[2023-03-17 13:03:30] [INFO ] Computed 42 place invariants in 3 ms
[2023-03-17 13:03:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-17 13:03:30] [INFO ] Invariant cache hit.
[2023-03-17 13:03:30] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/121 places, 74/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 344 ms. Remains : 104/121 places, 74/87 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (NOT p2)]
Running random walk in product with property : Ring-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s60 1) (EQ s75 1)), p0:(AND (EQ s15 1) (EQ s71 1) (EQ s73 1)), p2:(AND (EQ s14 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1621 reset in 222 ms.
Stack based approach found an accepted trace after 175 steps with 3 reset with depth 86 and stack size 86 in 1 ms.
FORMULA Ring-PT-none-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-01 finished in 721 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((F(p1)&&p0))||X(p2)))'
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 121 cols
[2023-03-17 13:03:31] [INFO ] Computed 46 place invariants in 7 ms
[2023-03-17 13:03:31] [INFO ] Implicit Places using invariants in 81 ms returned [19, 25, 28, 29, 76]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 82 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/121 places, 87/87 transitions.
Applied a total of 0 rules in 2 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 87 ms. Remains : 116/121 places, 87/87 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Ring-PT-none-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s14 0) (EQ s74 0)), p2:(OR (EQ s96 0) (EQ s98 0) (EQ s102 0)), p0:(AND (EQ s14 1) (EQ s74 1) (OR (EQ s20 0) (EQ s103 0)))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 162 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 p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1) (NOT p2))))
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Ring-PT-none-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Ring-PT-none-LTLFireability-02 finished in 741 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 p1)&&G(p0))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-17 13:03:31] [INFO ] Invariant cache hit.
[2023-03-17 13:03:31] [INFO ] Implicit Places using invariants in 92 ms returned [19, 25, 28, 29, 76, 79]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 93 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/121 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 99 ms. Remains : 115/121 places, 87/87 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Ring-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (EQ s30 1) (EQ s112 1)), p1:(AND (EQ s72 1) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Ring-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Ring-PT-none-LTLFireability-03 finished in 234 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 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Drop transitions 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 121 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 117 transition count 79
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 17 place count 112 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 110 transition count 77
Applied a total of 21 rules in 12 ms. Remains 110 /121 variables (removed 11) and now considering 77/87 (removed 10) transitions.
// Phase 1: matrix 77 rows 110 cols
[2023-03-17 13:03:32] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-17 13:03:32] [INFO ] Implicit Places using invariants in 95 ms returned [17, 24, 25, 65, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 96 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/121 places, 77/87 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 101 transition count 73
Applied a total of 8 rules in 5 ms. Remains 101 /105 variables (removed 4) and now considering 73/77 (removed 4) transitions.
// Phase 1: matrix 73 rows 101 cols
[2023-03-17 13:03:32] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-17 13:03:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-17 13:03:32] [INFO ] Invariant cache hit.
[2023-03-17 13:03:32] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/121 places, 73/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 101/121 places, 73/87 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s41 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 371 steps with 0 reset with depth 372 and stack size 372 in 1 ms.
FORMULA Ring-PT-none-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-05 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Drop transitions 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 121 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 117 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 19 place count 111 transition count 78
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 2 with 4 rules applied. Total rules applied 23 place count 109 transition count 76
Applied a total of 23 rules in 10 ms. Remains 109 /121 variables (removed 12) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 109 cols
[2023-03-17 13:03:32] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-17 13:03:32] [INFO ] Implicit Places using invariants in 67 ms returned [17, 24, 25, 64, 67]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 68 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/121 places, 76/87 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 100 transition count 72
Applied a total of 8 rules in 4 ms. Remains 100 /104 variables (removed 4) and now considering 72/76 (removed 4) transitions.
// Phase 1: matrix 72 rows 100 cols
[2023-03-17 13:03:32] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-17 13:03:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-17 13:03:32] [INFO ] Invariant cache hit.
[2023-03-17 13:03:32] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 72/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 223 ms. Remains : 100/121 places, 72/87 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Ring-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s92 1) (EQ s94 1)), p1:(OR (NEQ s14 1) (NEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5894 reset in 219 ms.
Stack based approach found an accepted trace after 360 steps with 21 reset with depth 72 and stack size 72 in 1 ms.
FORMULA Ring-PT-none-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-06 finished in 517 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)||G(p1)))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Drop transitions 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 121 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 116 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 116 transition count 78
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 19 place count 111 transition count 78
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 2 with 4 rules applied. Total rules applied 23 place count 109 transition count 76
Applied a total of 23 rules in 10 ms. Remains 109 /121 variables (removed 12) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 109 cols
[2023-03-17 13:03:33] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-17 13:03:33] [INFO ] Implicit Places using invariants in 65 ms returned [17, 24, 25, 64, 67]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 66 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/121 places, 76/87 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 100 transition count 72
Applied a total of 8 rules in 5 ms. Remains 100 /104 variables (removed 4) and now considering 72/76 (removed 4) transitions.
// Phase 1: matrix 72 rows 100 cols
[2023-03-17 13:03:33] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-17 13:03:33] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-17 13:03:33] [INFO ] Invariant cache hit.
[2023-03-17 13:03:33] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 72/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 100/121 places, 72/87 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Ring-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s34 1) (EQ s78 1) (EQ s86 1)), p0:(OR (EQ s39 0) (EQ s62 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 199 steps with 0 reset in 1 ms.
FORMULA Ring-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Ring-PT-none-LTLFireability-07 finished in 375 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((G((p0 U p1))||X((!p0 U (p2||G(!p0)))))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Applied a total of 0 rules in 0 ms. Remains 121 /121 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 121 cols
[2023-03-17 13:03:33] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-17 13:03:33] [INFO ] Implicit Places using invariants in 80 ms returned [19, 25, 76, 79]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/121 places, 87/87 transitions.
Applied a total of 0 rules in 0 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/121 places, 87/87 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Ring-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(OR p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s18 1) (EQ s86 1)), p0:(AND (EQ s26 1) (EQ s30 1)), p2:(AND (NOT (AND (EQ s27 1) (EQ s28 1))) (NOT (AND (EQ s26 1) (EQ s30 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 4 reset in 1 ms.
FORMULA Ring-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Ring-PT-none-LTLFireability-10 finished in 367 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&&X((F(!p1)||G(!p0)))) U (G((G(!p2)||(!p0&&X((F(!p1)||G(!p0))))))||(!p2&&(G(!p2)||(!p0&&X((F(!p1)||G(!p0)))))))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-17 13:03:33] [INFO ] Invariant cache hit.
[2023-03-17 13:03:33] [INFO ] Implicit Places using invariants in 70 ms returned [19, 25, 28, 29, 76, 79]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 71 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/121 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.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 115/121 places, 87/87 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND p0 p2), true, (AND p1 p0), p2, (AND p1 p0 p2), p1, (AND p1 p2)]
Running random walk in product with property : Ring-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s71 1) (EQ s74 1)), p2:(AND (EQ s43 1) (EQ s55 1)), p1:(AND (EQ s109 1) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 39114 reset in 191 ms.
Product exploration explored 100000 steps with 39301 reset in 247 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 p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 1091 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 115 cols
[2023-03-17 13:03:35] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-17 13:03:36] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2023-03-17 13:03:36] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p0) p1 p2)), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 22 factoid took 1096 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 170 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Support contains 6 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.
[2023-03-17 13:03:37] [INFO ] Invariant cache hit.
[2023-03-17 13:03:37] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-17 13:03:37] [INFO ] Invariant cache hit.
[2023-03-17 13:03:37] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-17 13:03:37] [INFO ] Invariant cache hit.
[2023-03-17 13:03:37] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 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) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 364 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Finished random walk after 1889 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 522 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 200 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 180 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Product exploration explored 100000 steps with 38995 reset in 166 ms.
Product exploration explored 100000 steps with 38803 reset in 177 ms.
Applying partial POR strategy [true, false, true, true, false]
Stuttering acceptance computed with spot in 311 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 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 115 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 115 transition count 87
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 115 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 113 transition count 85
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 113 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 113 transition count 85
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 18 rules in 19 ms. Remains 113 /115 variables (removed 2) and now considering 85/87 (removed 2) transitions.
[2023-03-17 13:03:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 85 rows 113 cols
[2023-03-17 13:03:40] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-17 13:03:40] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/115 places, 85/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 113/115 places, 85/87 transitions.
Support contains 6 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 1 ms. Remains 115 /115 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 115 cols
[2023-03-17 13:03:40] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-17 13:03:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-17 13:03:40] [INFO ] Invariant cache hit.
[2023-03-17 13:03:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-17 13:03:40] [INFO ] Invariant cache hit.
[2023-03-17 13:03:40] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 115/115 places, 87/87 transitions.
Treatment of property Ring-PT-none-LTLFireability-11 finished in 6826 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((X(p0)&&F(p1)))||G(p2))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Drop transitions 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 121 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 118 transition count 84
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 118 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 112 transition count 79
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 2 with 4 rules applied. Total rules applied 21 place count 110 transition count 77
Applied a total of 21 rules in 13 ms. Remains 110 /121 variables (removed 11) and now considering 77/87 (removed 10) transitions.
// Phase 1: matrix 77 rows 110 cols
[2023-03-17 13:03:40] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-17 13:03:40] [INFO ] Implicit Places using invariants in 83 ms returned [17, 24, 25, 65, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 84 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/121 places, 77/87 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 101 transition count 73
Applied a total of 8 rules in 15 ms. Remains 101 /105 variables (removed 4) and now considering 73/77 (removed 4) transitions.
// Phase 1: matrix 73 rows 101 cols
[2023-03-17 13:03:40] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-17 13:03:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-17 13:03:40] [INFO ] Invariant cache hit.
[2023-03-17 13:03:40] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/121 places, 73/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 285 ms. Remains : 101/121 places, 73/87 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Ring-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s40 0) (EQ s41 0)), p0:(AND (EQ s40 1) (EQ s41 1)), p1:(AND (EQ s30 1) (EQ s45 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 436 reset in 233 ms.
Stack based approach found an accepted trace after 7230 steps with 21 reset with depth 201 and stack size 199 in 19 ms.
FORMULA Ring-PT-none-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-12 finished in 624 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 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Drop transitions 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 121 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 116 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 116 transition count 78
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 19 place count 111 transition count 78
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 2 with 4 rules applied. Total rules applied 23 place count 109 transition count 76
Applied a total of 23 rules in 13 ms. Remains 109 /121 variables (removed 12) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 109 cols
[2023-03-17 13:03:41] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-17 13:03:41] [INFO ] Implicit Places using invariants in 70 ms returned [17, 24, 25, 64, 67]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 71 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/121 places, 76/87 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 100 transition count 72
Applied a total of 8 rules in 4 ms. Remains 100 /104 variables (removed 4) and now considering 72/76 (removed 4) transitions.
// Phase 1: matrix 72 rows 100 cols
[2023-03-17 13:03:41] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-17 13:03:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-17 13:03:41] [INFO ] Invariant cache hit.
[2023-03-17 13:03:41] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/121 places, 72/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 236 ms. Remains : 100/121 places, 72/87 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Ring-PT-none-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:(AND (EQ s25 1) (EQ s33 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]]
Product exploration explored 100000 steps with 1025 reset in 208 ms.
Stack based approach found an accepted trace after 353 steps with 5 reset with depth 128 and stack size 128 in 1 ms.
FORMULA Ring-PT-none-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Ring-PT-none-LTLFireability-13 finished in 523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 121 cols
[2023-03-17 13:03:41] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-17 13:03:41] [INFO ] Implicit Places using invariants in 71 ms returned [19, 25, 28, 29, 76, 79]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 72 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/121 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.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 115/121 places, 87/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-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s36 0) (EQ s71 0) (EQ s74 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 146 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Ring-PT-none-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Ring-PT-none-LTLFireability-15 finished in 518 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&&X((F(!p1)||G(!p0)))) U (G((G(!p2)||(!p0&&X((F(!p1)||G(!p0))))))||(!p2&&(G(!p2)||(!p0&&X((F(!p1)||G(!p0)))))))))'
Found a Shortening insensitive property : Ring-PT-none-LTLFireability-11
Stuttering acceptance computed with spot in 227 ms :[(AND p0 p2), true, (AND p1 p0), p2, (AND p1 p0 p2), p1, (AND p1 p2)]
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 121/121 places, 87/87 transitions.
Drop transitions 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 121 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 116 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 116 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 17 place count 112 transition count 79
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 2 with 4 rules applied. Total rules applied 21 place count 110 transition count 77
Applied a total of 21 rules in 12 ms. Remains 110 /121 variables (removed 11) and now considering 77/87 (removed 10) transitions.
// Phase 1: matrix 77 rows 110 cols
[2023-03-17 13:03:42] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-17 13:03:42] [INFO ] Implicit Places using invariants in 68 ms returned [17, 24, 25, 65, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 69 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/121 places, 77/87 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 101 transition count 73
Applied a total of 8 rules in 26 ms. Remains 101 /105 variables (removed 4) and now considering 73/77 (removed 4) transitions.
// Phase 1: matrix 73 rows 101 cols
[2023-03-17 13:03:42] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-17 13:03:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-17 13:03:42] [INFO ] Invariant cache hit.
[2023-03-17 13:03:42] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 101/121 places, 73/87 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 261 ms. Remains : 101/121 places, 73/87 transitions.
Running random walk in product with property : Ring-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s62 1)), p2:(AND (EQ s36 1) (EQ s44 1)), p1:(AND (EQ s95 1) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 38385 reset in 190 ms.
Product exploration explored 100000 steps with 38268 reset in 203 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 p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 1046 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 13:03:44] [INFO ] Invariant cache hit.
[2023-03-17 13:03:44] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2023-03-17 13:03:44] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p0) p1 p2)), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 22 factoid took 1514 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 169 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 73/73 transitions.
Applied a total of 0 rules in 0 ms. Remains 101 /101 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-17 13:03:46] [INFO ] Invariant cache hit.
[2023-03-17 13:03:46] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-17 13:03:46] [INFO ] Invariant cache hit.
[2023-03-17 13:03:46] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-17 13:03:46] [INFO ] Invariant cache hit.
[2023-03-17 13:03:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 101/101 places, 73/73 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) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 410 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Finished random walk after 489 steps, including 0 resets, run visited all 6 properties in 19 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 428 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 163 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 153 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Product exploration explored 100000 steps with 38679 reset in 168 ms.
Product exploration explored 100000 steps with 38283 reset in 181 ms.
Applying partial POR strategy [true, false, true, true, false]
Stuttering acceptance computed with spot in 197 ms :[p1, (AND p1 p0 p2), (AND p1 p0), (AND p1 p2), (AND p1 p0 p2)]
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-17 13:03:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 13:03:48] [INFO ] Invariant cache hit.
[2023-03-17 13:03:48] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 101/101 places, 73/73 transitions.
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 73/73 transitions.
Applied a total of 0 rules in 0 ms. Remains 101 /101 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-17 13:03:48] [INFO ] Invariant cache hit.
[2023-03-17 13:03:49] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-17 13:03:49] [INFO ] Invariant cache hit.
[2023-03-17 13:03:49] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-17 13:03:49] [INFO ] Invariant cache hit.
[2023-03-17 13:03:49] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 101/101 places, 73/73 transitions.
Treatment of property Ring-PT-none-LTLFireability-11 finished in 6825 ms.
[2023-03-17 13:03:49] [INFO ] Flatten gal took : 8 ms
[2023-03-17 13:03:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 13:03:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 87 transitions and 348 arcs took 1 ms.
Total runtime 21651 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Ring-PT-none
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA Ring-PT-none-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679058230853

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Ring-PT-none-LTLFireability-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Ring-PT-none-LTLFireability-11
lola: result : false
lola: markings : 11959
lola: fired transitions : 18394
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Ring-PT-none-LTLFireability-11: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r327-tall-167889200100780"
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 '' 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 ;