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.r487-tall-167912703200508.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 TCPcondis-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703200508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 16:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 16:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 16:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679201856611

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=TCPcondis-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 04:57:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 04:57:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:57:38] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 04:57:38] [WARNING] Unknown XML tag in source file: size
[2023-03-19 04:57:38] [WARNING] Unknown XML tag in source file: color
[2023-03-19 04:57:38] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-19 04:57:38] [INFO ] Transformed 30 places.
[2023-03-19 04:57:38] [INFO ] Transformed 32 transitions.
[2023-03-19 04:57:38] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA TCPcondis-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 04:57:38] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-19 04:57:38] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 04:57:38] [INFO ] Invariant cache hit.
[2023-03-19 04:57:38] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-19 04:57:38] [INFO ] Invariant cache hit.
[2023-03-19 04:57:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 25 out of 30 places after structural reductions.
[2023-03-19 04:57:38] [INFO ] Flatten gal took : 17 ms
[2023-03-19 04:57:38] [INFO ] Flatten gal took : 6 ms
[2023-03-19 04:57:38] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 1964 steps, including 0 resets, run visited all 24 properties in 58 ms. (steps per millisecond=33 )
FORMULA TCPcondis-PT-10-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U X((X(F(!p3))&&p2))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:39] [INFO ] Invariant cache hit.
[2023-03-19 04:57:39] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 04:57:39] [INFO ] Invariant cache hit.
[2023-03-19 04:57:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 04:57:39] [INFO ] Invariant cache hit.
[2023-03-19 04:57:39] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 460 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (AND (NOT p1) (NOT p2)), (OR (NOT p2) p3), true, p3, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s0 1), p1:(LT s1 1), p2:(AND (GEQ s8 1) (GEQ s20 1)), p3:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 7 ms.
FORMULA TCPcondis-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-00 finished in 659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 28
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
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 14 place count 24 transition count 24
Applied a total of 14 rules in 17 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 04:57:40] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 04:57:40] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 04:57:40] [INFO ] Invariant cache hit.
[2023-03-19 04:57:40] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-19 04:57:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 04:57:40] [INFO ] Invariant cache hit.
[2023-03-19 04:57:40] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s19 1)), p0:(OR (LT s3 1) (LT s16 1))], nbAcceptance=1, 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 550 reset in 299 ms.
Stack based approach found an accepted trace after 202 steps with 0 reset with depth 203 and stack size 203 in 1 ms.
FORMULA TCPcondis-PT-10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-01 finished in 571 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)||F((p1&&X(F(p2))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 04:57:40] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 04:57:40] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 04:57:40] [INFO ] Invariant cache hit.
[2023-03-19 04:57:40] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-19 04:57:40] [INFO ] Invariant cache hit.
[2023-03-19 04:57:40] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={0} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s24 1), p0:(OR (AND (GEQ s4 1) (GEQ s21 1)) (AND (GEQ s9 1) (GEQ s25 1))), p2:(AND (GEQ s9 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7086 reset in 159 ms.
Product exploration explored 100000 steps with 7110 reset in 187 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Finished random walk after 1726 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=172 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 284 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
[2023-03-19 04:57:42] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
[2023-03-19 04:57:42] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F p2), (F p1), (G (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-10-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-10-LTLFireability-02 finished in 1898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(X(p0)) U p1))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:42] [INFO ] Invariant cache hit.
[2023-03-19 04:57:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 04:57:42] [INFO ] Invariant cache hit.
[2023-03-19 04:57:42] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-19 04:57:42] [INFO ] Invariant cache hit.
[2023-03-19 04:57:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 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][false, false, false, false]]
Product exploration explored 100000 steps with 2466 reset in 180 ms.
Product exploration explored 100000 steps with 2490 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 166 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-19 04:57:44] [INFO ] Invariant cache hit.
[2023-03-19 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:57:44] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 04:57:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:57:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-19 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:57:44] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 04:57:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:57:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-19 04:57:44] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 04:57:44] [INFO ] Added : 25 causal constraints over 5 iterations in 36 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 04:57:44] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-10-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-10-LTLFireability-03 finished in 1903 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(G(p0))||G((!p1 U p2))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:44] [INFO ] Invariant cache hit.
[2023-03-19 04:57:44] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 04:57:44] [INFO ] Invariant cache hit.
[2023-03-19 04:57:44] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 04:57:44] [INFO ] Invariant cache hit.
[2023-03-19 04:57:44] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p1:(AND (GEQ s5 1) (GEQ s23 1)), p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Stack based approach found an accepted trace after 39530 steps with 12 reset with depth 39169 and stack size 23619 in 106 ms.
FORMULA TCPcondis-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-04 finished in 687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||!(!p0 U X((p0 U X(p1))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:45] [INFO ] Invariant cache hit.
[2023-03-19 04:57:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 04:57:45] [INFO ] Invariant cache hit.
[2023-03-19 04:57:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 04:57:45] [INFO ] Invariant cache hit.
[2023-03-19 04:57:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), p1, true, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s22 1)), p1:(AND (GEQ s5 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24994 reset in 86 ms.
Product exploration explored 100000 steps with 24970 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 9065 steps, including 2 resets, run visited all 6 properties in 11 ms. (steps per millisecond=824 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 357 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:46] [INFO ] Invariant cache hit.
[2023-03-19 04:57:46] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 04:57:46] [INFO ] Invariant cache hit.
[2023-03-19 04:57:46] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-19 04:57:46] [INFO ] Invariant cache hit.
[2023-03-19 04:57:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 1738 steps, including 0 resets, run visited all 6 properties in 9 ms. (steps per millisecond=193 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 182 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Entered a terminal (fully accepting) state of product in 332 steps with 8 reset in 2 ms.
FORMULA TCPcondis-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-05 finished in 3122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F((p1||G(!p2))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Applied a total of 10 rules in 13 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2023-03-19 04:57:48] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 04:57:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 04:57:48] [INFO ] Invariant cache hit.
[2023-03-19 04:57:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-19 04:57:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 04:57:48] [INFO ] Invariant cache hit.
[2023-03-19 04:57:48] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s14 1)), p2:(LT s1 1), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 953 reset in 206 ms.
Product exploration explored 100000 steps with 983 reset in 197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 277 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 507 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=169 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 449 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
[2023-03-19 04:57:50] [INFO ] Invariant cache hit.
[2023-03-19 04:57:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 04:57:50] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-19 04:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:57:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-19 04:57:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:57:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 04:57:50] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-19 04:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:57:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 04:57:50] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 04:57:50] [INFO ] Added : 16 causal constraints over 4 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-19 04:57:50] [INFO ] Invariant cache hit.
[2023-03-19 04:57:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 04:57:50] [INFO ] Invariant cache hit.
[2023-03-19 04:57:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 04:57:50] [INFO ] Invariant cache hit.
[2023-03-19 04:57:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 26/26 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 980 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=490 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
[2023-03-19 04:57:51] [INFO ] Invariant cache hit.
[2023-03-19 04:57:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 04:57:51] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 04:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:57:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-19 04:57:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:57:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 04:57:51] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 04:57:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:57:51] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 04:57:51] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-19 04:57:51] [INFO ] Added : 16 causal constraints over 4 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 932 reset in 156 ms.
Stack based approach found an accepted trace after 46754 steps with 456 reset with depth 19 and stack size 19 in 88 ms.
FORMULA TCPcondis-PT-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-06 finished in 3483 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)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 04:57:51] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 04:57:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 04:57:51] [INFO ] Invariant cache hit.
[2023-03-19 04:57:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-19 04:57:51] [INFO ] Invariant cache hit.
[2023-03-19 04:57:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s22 1)), p0:(AND (GEQ s8 1) (GEQ s20 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 133 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-07 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:51] [INFO ] Invariant cache hit.
[2023-03-19 04:57:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 04:57:52] [INFO ] Invariant cache hit.
[2023-03-19 04:57:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-19 04:57:52] [INFO ] Invariant cache hit.
[2023-03-19 04:57:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s10 1) (LT 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-09 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p1||X(F(p2)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:52] [INFO ] Invariant cache hit.
[2023-03-19 04:57:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 04:57:52] [INFO ] Invariant cache hit.
[2023-03-19 04:57:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 04:57:52] [INFO ] Invariant cache hit.
[2023-03-19 04:57:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=1, aps=[p2:(OR (LT s10 1) (LT s28 1)), p0:(OR (AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)) (AND (GEQ s8 1) (GEQ s20 1))), p1:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13420 reset in 105 ms.
Product exploration explored 100000 steps with 13979 reset in 110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 164 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:53] [INFO ] Invariant cache hit.
[2023-03-19 04:57:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 04:57:53] [INFO ] Invariant cache hit.
[2023-03-19 04:57:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-19 04:57:53] [INFO ] Invariant cache hit.
[2023-03-19 04:57:53] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 13450 reset in 98 ms.
Product exploration explored 100000 steps with 13931 reset in 107 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 12 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 04:57:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 04:57:55] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 04:57:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 28/30 places, 30/32 transitions.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 04:57:55] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 04:57:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 04:57:55] [INFO ] Invariant cache hit.
[2023-03-19 04:57:55] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 04:57:55] [INFO ] Invariant cache hit.
[2023-03-19 04:57:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-10-LTLFireability-10 finished in 2949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0)) U (p1 U !p2))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:57:55] [INFO ] Invariant cache hit.
[2023-03-19 04:57:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 04:57:55] [INFO ] Invariant cache hit.
[2023-03-19 04:57:55] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 04:57:55] [INFO ] Invariant cache hit.
[2023-03-19 04:57:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 174 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), true, p2]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s21 1)), p1:(OR (NOT (AND (GEQ s9 1) (GEQ s25 1))) (AND (GEQ s5 1) (GEQ s21 1))), p0:(AND (GEQ s9 1) (GEQ s25 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 2046 reset in 164 ms.
Product exploration explored 100000 steps with 2033 reset in 168 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 585 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 04:57:56] [INFO ] Invariant cache hit.
[2023-03-19 04:57:56] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (AND (NOT p0) p1 p2)), (F (AND p1 p2)), (F p2)]
Knowledge based reduction with 15 factoid took 784 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[p2, p2]
Stuttering acceptance computed with spot in 56 ms :[p2, p2]
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 11 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-19 04:57:57] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 04:57:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 04:57:57] [INFO ] Invariant cache hit.
[2023-03-19 04:57:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 04:57:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 04:57:57] [INFO ] Invariant cache hit.
[2023-03-19 04:57:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 23/30 places, 24/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p2, p2]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p2, p2]
Stuttering acceptance computed with spot in 65 ms :[p2, p2]
Stuttering acceptance computed with spot in 62 ms :[p2, p2]
Product exploration explored 100000 steps with 2128 reset in 144 ms.
Stack based approach found an accepted trace after 88251 steps with 1854 reset with depth 103 and stack size 103 in 133 ms.
FORMULA TCPcondis-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-11 finished in 3268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (F(p2)&&p1))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 04:57:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 04:57:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 04:57:58] [INFO ] Invariant cache hit.
[2023-03-19 04:57:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-19 04:57:58] [INFO ] Invariant cache hit.
[2023-03-19 04:57:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s28 1)), p2:(AND (GEQ s7 1) (GEQ s19 1)), p0:(GEQ s29 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]]
Product exploration explored 100000 steps with 1684 reset in 234 ms.
Product exploration explored 100000 steps with 1688 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 408 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F p2), (F p0), (F p1), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 453 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-19 04:58:00] [INFO ] Invariant cache hit.
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-19 04:58:00] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 04:58:00] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 04:58:00] [INFO ] Invariant cache hit.
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-19 04:58:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:58:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:00] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-19 04:58:00] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 04:58:00] [INFO ] Added : 25 causal constraints over 5 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 04:58:00] [INFO ] Invariant cache hit.
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:00] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-19 04:58:00] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 04:58:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:58:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 04:58:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:00] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 04:58:00] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 04:58:00] [INFO ] Added : 22 causal constraints over 5 iterations in 21 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 04:58:00] [INFO ] Invariant cache hit.
[2023-03-19 04:58:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 04:58:00] [INFO ] Invariant cache hit.
[2023-03-19 04:58:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 04:58:00] [INFO ] Invariant cache hit.
[2023-03-19 04:58:00] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 368 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 276 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=138 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F p2), (F p0), (F p1), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 460 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-19 04:58:01] [INFO ] Invariant cache hit.
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 04:58:02] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 04:58:02] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 04:58:02] [INFO ] Invariant cache hit.
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 04:58:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:58:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:02] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 04:58:02] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 04:58:02] [INFO ] Added : 25 causal constraints over 5 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 04:58:02] [INFO ] Invariant cache hit.
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 04:58:02] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 04:58:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:58:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 04:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:58:02] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 04:58:02] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-19 04:58:02] [INFO ] Added : 22 causal constraints over 5 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 1663 reset in 155 ms.
Product exploration explored 100000 steps with 1622 reset in 157 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 12 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2023-03-19 04:58:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2023-03-19 04:58:02] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 04:58:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 29/30 places, 31/32 transitions.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 04:58:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 04:58:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 04:58:03] [INFO ] Invariant cache hit.
[2023-03-19 04:58:03] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 04:58:03] [INFO ] Invariant cache hit.
[2023-03-19 04:58:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-10-LTLFireability-12 finished in 4650 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 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
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 18 place count 22 transition count 22
Applied a total of 18 rules in 8 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 04:58:03] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 04:58:03] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 04:58:03] [INFO ] Invariant cache hit.
[2023-03-19 04:58:03] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-19 04:58:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 04:58:03] [INFO ] Invariant cache hit.
[2023-03-19 04:58:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 25 ms :[p0]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Stack based approach found an accepted trace after 5494 steps with 0 reset with depth 5495 and stack size 5495 in 11 ms.
FORMULA TCPcondis-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-14 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
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 14 place count 24 transition count 24
Applied a total of 14 rules in 9 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 04:58:03] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 04:58:03] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 04:58:03] [INFO ] Invariant cache hit.
[2023-03-19 04:58:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-19 04:58:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 04:58:03] [INFO ] Invariant cache hit.
[2023-03-19 04:58:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Stack based approach found an accepted trace after 3622 steps with 0 reset with depth 3623 and stack size 3623 in 6 ms.
FORMULA TCPcondis-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-15 finished in 320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p1||X(F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (F(p2)&&p1))))'
[2023-03-19 04:58:03] [INFO ] Flatten gal took : 3 ms
[2023-03-19 04:58:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 04:58:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 1 ms.
Total runtime 25617 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT TCPcondis-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLFireability

FORMULA TCPcondis-PT-10-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-10-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679201885309

--------------------
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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 TCPcondis-PT-10-LTLFireability-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for TCPcondis-PT-10-LTLFireability-10
lola: result : false
lola: markings : 168
lola: fired transitions : 177
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 TCPcondis-PT-10-LTLFireability-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for TCPcondis-PT-10-LTLFireability-12
lola: result : false
lola: markings : 31176
lola: fired transitions : 70364
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TCPcondis-PT-10-LTLFireability-10: LTL false LTL model checker
TCPcondis-PT-10-LTLFireability-12: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-10"
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 TCPcondis-PT-10, 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 r487-tall-167912703200508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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