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.r135-smll-167819414400444.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 DoubleExponent-PT-001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414400444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678328708459

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=DoubleExponent-PT-001
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 02:25:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 02:25:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:25:12] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-09 02:25:12] [INFO ] Transformed 57 places.
[2023-03-09 02:25:12] [INFO ] Transformed 48 transitions.
[2023-03-09 02:25:12] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-001-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 16 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:12] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-09 02:25:12] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-09 02:25:12] [INFO ] Invariant cache hit.
[2023-03-09 02:25:12] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-09 02:25:12] [INFO ] Invariant cache hit.
[2023-03-09 02:25:12] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/57 places, 48/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 53/57 places, 48/48 transitions.
Support contains 35 out of 53 places after structural reductions.
[2023-03-09 02:25:13] [INFO ] Flatten gal took : 43 ms
[2023-03-09 02:25:13] [INFO ] Flatten gal took : 20 ms
[2023-03-09 02:25:13] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 10000 steps, including 324 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 33) seen :30
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 02:25:14] [INFO ] Invariant cache hit.
[2023-03-09 02:25:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:25:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 02:25:15] [INFO ] After 80ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2023-03-09 02:25:15] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 8 ms to minimize.
[2023-03-09 02:25:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 02:25:15] [INFO ] After 194ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 02:25:15] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 02:25:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:25:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-09 02:25:15] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 02:25:15] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 02:25:15] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 48/48 transitions.
Graph (complete) has 82 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 35
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 39 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 39 transition count 33
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 31 place count 37 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 36 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 36 transition count 32
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 25 transition count 21
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 25 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 21 transition count 17
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 21 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 20 transition count 16
Applied a total of 65 rules in 57 ms. Remains 20 /53 variables (removed 33) and now considering 16/48 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 20/53 places, 16/48 transitions.
Finished random walk after 1360 steps, including 168 resets, run visited all 2 properties in 44 ms. (steps per millisecond=30 )
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 82 edges and 53 vertex of which 51 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-09 02:25:16] [INFO ] Invariant cache hit.
[2023-03-09 02:25:16] [INFO ] Implicit Places using invariants in 93 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 95 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 7 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2023-03-09 02:25:16] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-09 02:25:16] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 02:25:16] [INFO ] Invariant cache hit.
[2023-03-09 02:25:16] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 300 ms. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 571 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (GEQ s29 1) (GEQ s8 1)), p1:(OR (GEQ s8 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-00 finished in 972 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&&F(p1)) U ((p1 U p0)&&p2)))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:17] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-09 02:25:17] [INFO ] Implicit Places using invariants in 87 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 7 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2023-03-09 02:25:17] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 02:25:17] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 02:25:17] [INFO ] Invariant cache hit.
[2023-03-09 02:25:17] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 292 ms. Remains : 51/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 p1) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s14 1) (GEQ s28 1)), p1:(GEQ s20 1), p0:(GEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-01 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(X(X((!p0||F((!p0 U (p1||G(!p0))))))))))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:17] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 02:25:17] [INFO ] Implicit Places using invariants in 72 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 52/53 places, 48/48 transitions.
Stuttering acceptance computed with spot in 369 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s42 1), p1:(AND (NOT (AND (GEQ s15 1) (GEQ s34 1))) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 353 ms.
Product exploration explored 100000 steps with 16666 reset in 177 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 79 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/52 stabilizing places and 7/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 1054 steps, including 34 resets, run visited all 2 properties in 15 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2023-03-09 02:25:20] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 02:25:20] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-09 02:25:20] [INFO ] Invariant cache hit.
[2023-03-09 02:25:20] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-09 02:25:20] [INFO ] Invariant cache hit.
[2023-03-09 02:25:20] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 52/52 places, 48/48 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 79 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/52 stabilizing places and 7/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 1287 steps, including 43 resets, run visited all 2 properties in 9 ms. (steps per millisecond=143 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 16666 reset in 159 ms.
Product exploration explored 100000 steps with 16666 reset in 161 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 52 transition count 48
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 10 place count 52 transition count 49
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 52 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 49 transition count 46
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 49 transition count 46
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 49 transition count 49
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 47 transition count 46
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 47 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 47 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 46 transition count 47
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 46 transition count 47
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 37 rules in 33 ms. Remains 46 /52 variables (removed 6) and now considering 47/48 (removed 1) transitions.
[2023-03-09 02:25:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 47 rows 46 cols
[2023-03-09 02:25:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 02:25:23] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/52 places, 47/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 46/52 places, 47/48 transitions.
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 52 cols
[2023-03-09 02:25:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 02:25:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 02:25:23] [INFO ] Invariant cache hit.
[2023-03-09 02:25:24] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-09 02:25:24] [INFO ] Invariant cache hit.
[2023-03-09 02:25:24] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 52/52 places, 48/48 transitions.
Treatment of property DoubleExponent-PT-001-LTLFireability-02 finished in 6350 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)&&(F(G(!p0))||(p0 U p1))))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 52 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 41 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 40 transition count 35
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 46 place count 29 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 28 transition count 23
Applied a total of 47 rules in 13 ms. Remains 28 /53 variables (removed 25) and now considering 23/48 (removed 25) transitions.
// Phase 1: matrix 23 rows 28 cols
[2023-03-09 02:25:24] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 02:25:24] [INFO ] Implicit Places using invariants in 53 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/53 places, 23/48 transitions.
Graph (complete) has 57 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 24 transition count 21
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 7 place count 22 transition count 19
Applied a total of 7 rules in 8 ms. Remains 22 /26 variables (removed 4) and now considering 19/23 (removed 4) transitions.
// Phase 1: matrix 19 rows 22 cols
[2023-03-09 02:25:24] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 02:25:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-09 02:25:24] [INFO ] Invariant cache hit.
[2023-03-09 02:25:24] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/53 places, 19/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 22/53 places, 19/48 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s12 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 2 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-03 finished in 415 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||F(p2)||X(!p3)))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:24] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-09 02:25:24] [INFO ] Implicit Places using invariants in 65 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 5 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2023-03-09 02:25:24] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 02:25:24] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-09 02:25:24] [INFO ] Invariant cache hit.
[2023-03-09 02:25:24] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p2) p3), (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p0 p3), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s14 1), p2:(LT s11 1), p0:(AND (GEQ s39 1) (GEQ s46 1)), p3:(AND (GEQ s3 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/50 stabilizing places and 6/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2) p0)))
Knowledge based reduction with 8 factoid took 219 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-001-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-001-LTLFireability-04 finished in 1139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(!p1 U (p2||G(!p1))))))))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:25] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 02:25:25] [INFO ] Implicit Places using invariants in 70 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 4 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2023-03-09 02:25:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 02:25:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 02:25:25] [INFO ] Invariant cache hit.
[2023-03-09 02:25:26] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 242 ms. Remains : 51/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (NOT (AND (GEQ s14 1) (GEQ s28 1))) (NOT (OR (AND (GEQ s27 1) (GEQ s47 1)) (AND (GEQ s35 1) (GEQ s50 1))))), p1:(OR (AND (GEQ s27 1) (GEQ s47 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3302 reset in 245 ms.
Product exploration explored 100000 steps with 3313 reset in 314 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 79 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/51 stabilizing places and 6/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 308 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 181 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 02:25:28] [INFO ] Invariant cache hit.
[2023-03-09 02:25:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:25:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 02:25:28] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 02:25:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 02:25:28] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 02:25:28] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (OR p0 p2))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 (NOT p0) (NOT p2))))
Knowledge based reduction with 8 factoid took 262 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-001-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-001-LTLFireability-05 finished in 2684 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)))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:28] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 02:25:28] [INFO ] Implicit Places using invariants in 55 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 9 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2023-03-09 02:25:28] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-09 02:25:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 02:25:28] [INFO ] Invariant cache hit.
[2023-03-09 02:25:28] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-06 finished in 359 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)||(!p0&&G(F(p1))))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:28] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-09 02:25:28] [INFO ] Implicit Places using invariants in 62 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 4 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2023-03-09 02:25:28] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-09 02:25:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 02:25:28] [INFO ] Invariant cache hit.
[2023-03-09 02:25:29] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 209 ms. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 277 ms :[p0, p0, true, (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s34 1) (GEQ s49 1)), p1:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3307 reset in 158 ms.
Product exploration explored 100000 steps with 3289 reset in 170 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/50 stabilizing places and 6/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 364 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 02:25:30] [INFO ] Invariant cache hit.
[2023-03-09 02:25:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:25:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 02:25:30] [INFO ] After 55ms 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) p1), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-09 02:25:31] [INFO ] Invariant cache hit.
[2023-03-09 02:25:31] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 02:25:31] [INFO ] Invariant cache hit.
[2023-03-09 02:25:31] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-09 02:25:31] [INFO ] Invariant cache hit.
[2023-03-09 02:25:31] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 50/50 places, 47/47 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/50 stabilizing places and 6/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 349 steps, including 11 resets, run visited all 2 properties in 2 ms. (steps per millisecond=174 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 501 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 202 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3324 reset in 131 ms.
Product exploration explored 100000 steps with 3328 reset in 151 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 47/47 transitions.
Graph (complete) has 76 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 49 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 12 place count 49 transition count 47
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 49 transition count 47
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 45 transition count 43
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 45 transition count 43
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 33 place count 45 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 44 transition count 43
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 44 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 44 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 43 transition count 44
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 43 transition count 44
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 38 rules in 19 ms. Remains 43 /50 variables (removed 7) and now considering 44/47 (removed 3) transitions.
[2023-03-09 02:25:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 43 cols
[2023-03-09 02:25:33] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 02:25:33] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/50 places, 44/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 43/50 places, 44/47 transitions.
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 47/47 (removed 0) transitions.
// Phase 1: matrix 47 rows 50 cols
[2023-03-09 02:25:33] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 02:25:33] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 02:25:33] [INFO ] Invariant cache hit.
[2023-03-09 02:25:33] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-09 02:25:33] [INFO ] Invariant cache hit.
[2023-03-09 02:25:33] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 50/50 places, 47/47 transitions.
Treatment of property DoubleExponent-PT-001-LTLFireability-09 finished in 5119 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 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 52 transition count 39
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 44 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 43 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 18 place count 43 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 40 transition count 35
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 46 place count 29 transition count 24
Applied a total of 46 rules in 13 ms. Remains 29 /53 variables (removed 24) and now considering 24/48 (removed 24) transitions.
// Phase 1: matrix 24 rows 29 cols
[2023-03-09 02:25:33] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 02:25:34] [INFO ] Implicit Places using invariants in 60 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/53 places, 24/48 transitions.
Graph (complete) has 63 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 5 place count 24 transition count 21
Applied a total of 5 rules in 6 ms. Remains 24 /27 variables (removed 3) and now considering 21/24 (removed 3) transitions.
// Phase 1: matrix 21 rows 24 cols
[2023-03-09 02:25:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 02:25:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 02:25:34] [INFO ] Invariant cache hit.
[2023-03-09 02:25:34] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/53 places, 21/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 24/53 places, 21/48 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-10 finished in 261 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&&X((F(!p2)||p1))&&(p3 U (p4||G(p3))))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:34] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 02:25:34] [INFO ] Implicit Places using invariants in 62 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 52/53 places, 48/48 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4)) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p3) (NOT p4)) (AND (NOT p1) p2)), true, (AND p2 (NOT p1)), (AND (NOT p4) (NOT p3)), p2]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p4) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p4) (AND p0 p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p4) p3), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s15 1) (LT s34 1)), p4:(AND (LT s23 1) (LT s12 1)), p3:(LT s12 1), p1:(OR (LT s40 1) (LT s47 1)), p2:(AND (GEQ s40 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 159 ms.
Product exploration explored 100000 steps with 33333 reset in 194 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 79 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p4 p3 p1 (NOT p2)), (X (NOT (AND p0 (NOT p4) p3))), (X (NOT (OR (NOT p0) (AND (NOT p4) (NOT p3))))), (X (OR (AND p0 p4) (AND p0 p3))), true, (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p4) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) p2))))
Knowledge based reduction with 8 factoid took 280 ms. Reduced automaton from 6 states, 9 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-001-LTLFireability-11 finished in 1090 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((G(p0) U X(p1))) U X(G(p2))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-09 02:25:35] [INFO ] Invariant cache hit.
[2023-03-09 02:25:35] [INFO ] Implicit Places using invariants in 56 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2023-03-09 02:25:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 02:25:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-09 02:25:35] [INFO ] Invariant cache hit.
[2023-03-09 02:25:35] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 596 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(NOT p2), acceptance={} source=1 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=true, acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 10}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 4}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=10 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 p1 p2), acceptance={} source=10 dest: 10}]], initial=2, aps=[p1:(AND (LT s30 1) (GEQ s16 1)), p2:(AND (GEQ s3 1) (GEQ s42 1)), p0:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-12 finished in 851 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||F(p1)||(p1 U G(!p2))))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 38
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 43 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 42 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 42 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 40 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 32 transition count 27
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 32 transition count 27
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 31 transition count 26
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 31 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 30 transition count 25
Applied a total of 45 rules in 13 ms. Remains 30 /53 variables (removed 23) and now considering 25/48 (removed 23) transitions.
// Phase 1: matrix 25 rows 30 cols
[2023-03-09 02:25:36] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 02:25:36] [INFO ] Implicit Places using invariants in 53 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/53 places, 25/48 transitions.
Graph (complete) has 61 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 24 transition count 21
Applied a total of 7 rules in 3 ms. Remains 24 /28 variables (removed 4) and now considering 21/25 (removed 4) transitions.
// Phase 1: matrix 21 rows 24 cols
[2023-03-09 02:25:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 02:25:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 02:25:36] [INFO ] Invariant cache hit.
[2023-03-09 02:25:36] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/53 places, 21/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 24/53 places, 21/48 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s18 1), p0:(GEQ s21 1), p2:(AND (GEQ s1 1) (GEQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9219 reset in 346 ms.
Product exploration explored 100000 steps with 9204 reset in 421 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 57 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/24 stabilizing places and 2/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 1002 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 845 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 596 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 02:25:38] [INFO ] Invariant cache hit.
[2023-03-09 02:25:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:25:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-09 02:25:38] [INFO ] After 62ms 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 p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2))), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 13 factoid took 807 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-03-09 02:25:39] [INFO ] Invariant cache hit.
[2023-03-09 02:25:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 02:25:39] [INFO ] Invariant cache hit.
[2023-03-09 02:25:39] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 02:25:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:25:39] [INFO ] Invariant cache hit.
[2023-03-09 02:25:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 24/24 places, 21/21 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 57 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/24 stabilizing places and 2/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 401 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 12 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p1), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 677 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 9204 reset in 212 ms.
Product exploration explored 100000 steps with 9211 reset in 607 ms.
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-03-09 02:25:42] [INFO ] Invariant cache hit.
[2023-03-09 02:25:42] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 02:25:42] [INFO ] Invariant cache hit.
[2023-03-09 02:25:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-09 02:25:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 02:25:42] [INFO ] Invariant cache hit.
[2023-03-09 02:25:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 24/24 places, 21/21 transitions.
Treatment of property DoubleExponent-PT-001-LTLFireability-13 finished in 6401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 52 transition count 35
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 40 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24 place count 40 transition count 33
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 28 place count 38 transition count 33
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 27 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 26 transition count 21
Applied a total of 51 rules in 8 ms. Remains 26 /53 variables (removed 27) and now considering 21/48 (removed 27) transitions.
// Phase 1: matrix 21 rows 26 cols
[2023-03-09 02:25:42] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 02:25:42] [INFO ] Implicit Places using invariants in 51 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/53 places, 21/48 transitions.
Graph (complete) has 56 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 20 transition count 17
Applied a total of 7 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 17/21 (removed 4) transitions.
// Phase 1: matrix 17 rows 20 cols
[2023-03-09 02:25:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 02:25:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 02:25:42] [INFO ] Invariant cache hit.
[2023-03-09 02:25:42] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/53 places, 17/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 20/53 places, 17/48 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 48 steps with 8 reset in 1 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-14 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F(p1)))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2023-03-09 02:25:42] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 02:25:42] [INFO ] Implicit Places using invariants in 59 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2023-03-09 02:25:42] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 02:25:42] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 02:25:42] [INFO ] Invariant cache hit.
[2023-03-09 02:25:42] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 50/53 places, 47/48 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s10 1), p0:(GEQ s45 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-15 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(X(X((!p0||F((!p0 U (p1||G(!p0))))))))))))'
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)||(!p0&&G(F(p1))))))'
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||F(p1)||(p1 U G(!p2))))))'
[2023-03-09 02:25:43] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:25:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-09 02:25:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 48 transitions and 131 arcs took 2 ms.
Total runtime 31555 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-001
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

FORMULA DoubleExponent-PT-001-LTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-001-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-001-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678328744941

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 DoubleExponent-PT-001-LTLFireability-02
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DoubleExponent-PT-001-LTLFireability-02
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DoubleExponent-PT-001-LTLFireability-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DoubleExponent-PT-001-LTLFireability-09
lola: result : true
lola: markings : 179
lola: fired transitions : 200
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 DoubleExponent-PT-001-LTLFireability-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DoubleExponent-PT-001-LTLFireability-13
lola: result : true
lola: markings : 536
lola: fired transitions : 1460
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-001-LTLFireability-02: LTL true LTL model checker
DoubleExponent-PT-001-LTLFireability-09: LTL true LTL model checker
DoubleExponent-PT-001-LTLFireability-13: LTL true 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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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 r135-smll-167819414400444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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