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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 13:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 128K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678558082083

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 18:08:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 18:08:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 18:08:03] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-11 18:08:03] [INFO ] Transformed 147 places.
[2023-03-11 18:08:04] [INFO ] Transformed 448 transitions.
[2023-03-11 18:08:04] [INFO ] Found NUPN structural information;
[2023-03-11 18:08:04] [INFO ] Parsed PT model containing 147 places and 448 transitions and 2045 arcs in 412 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 3 formulas.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 326/326 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 314
Applied a total of 12 rules in 22 ms. Remains 147 /147 variables (removed 0) and now considering 314/326 (removed 12) transitions.
// Phase 1: matrix 314 rows 147 cols
[2023-03-11 18:08:04] [INFO ] Computed 14 place invariants in 16 ms
[2023-03-11 18:08:04] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-11 18:08:04] [INFO ] Invariant cache hit.
[2023-03-11 18:08:04] [INFO ] State equation strengthened by 193 read => feed constraints.
[2023-03-11 18:08:04] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-11 18:08:04] [INFO ] Invariant cache hit.
[2023-03-11 18:08:04] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/147 places, 314/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 641 ms. Remains : 147/147 places, 314/326 transitions.
Support contains 30 out of 147 places after structural reductions.
[2023-03-11 18:08:04] [INFO ] Flatten gal took : 48 ms
[2023-03-11 18:08:05] [INFO ] Flatten gal took : 24 ms
[2023-03-11 18:08:05] [INFO ] Input system was already deterministic with 314 transitions.
Finished random walk after 1045 steps, including 0 resets, run visited all 28 properties in 50 ms. (steps per millisecond=20 )
Computed a total of 3 stabilizing places and 1 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' '!(F(G(p0)))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 111 edges and 147 vertex of which 24 / 147 are part of one of the 8 SCC in 3 ms
Free SCC test removed 16 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 77 place count 93 transition count 232
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 0 with 84 rules applied. Total rules applied 161 place count 93 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 93 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 92 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 92 transition count 147
Applied a total of 164 rules in 55 ms. Remains 92 /147 variables (removed 55) and now considering 147/314 (removed 167) transitions.
[2023-03-11 18:08:05] [INFO ] Flow matrix only has 128 transitions (discarded 19 similar events)
// Phase 1: matrix 128 rows 92 cols
[2023-03-11 18:08:05] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 18:08:05] [INFO ] Implicit Places using invariants in 121 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/147 places, 147/314 transitions.
Graph (trivial) has 114 edges and 91 vertex of which 24 / 91 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 75 transition count 103
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 63 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 63 transition count 91
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 51 transition count 91
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 81 place count 35 transition count 75
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 93 place count 35 transition count 63
Applied a total of 93 rules in 18 ms. Remains 35 /91 variables (removed 56) and now considering 63/147 (removed 84) transitions.
[2023-03-11 18:08:05] [INFO ] Flow matrix only has 48 transitions (discarded 15 similar events)
// Phase 1: matrix 48 rows 35 cols
[2023-03-11 18:08:05] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-11 18:08:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 18:08:05] [INFO ] Flow matrix only has 48 transitions (discarded 15 similar events)
[2023-03-11 18:08:05] [INFO ] Invariant cache hit.
[2023-03-11 18:08:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-11 18:08:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/147 places, 63/314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 275 ms. Remains : 35/147 places, 63/314 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s32 0) (EQ s15 1) (OR (EQ s11 0) (EQ s23 0) (EQ s34 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-00 finished in 484 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||(G(p1) U X(p2))))))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 147 cols
[2023-03-11 18:08:06] [INFO ] Computed 14 place invariants in 12 ms
[2023-03-11 18:08:06] [INFO ] Implicit Places using invariants in 98 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s59 1) (EQ s145 1)), p1:(EQ s104 1), p2:(NEQ s65 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32185 reset in 677 ms.
Product exploration explored 100000 steps with 32099 reset in 631 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 1239 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 314 rows 146 cols
[2023-03-11 18:08:09] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-11 18:08:09] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 18:08:09] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 18:08:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-11 18:08:09] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 18:08:09] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-11 18:08:09] [INFO ] After 23ms SMT Verify possible using 133 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 18:08:09] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 18:08:09] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F p1)]
Knowledge based reduction with 18 factoid took 1483 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2023-03-11 18:08:11] [INFO ] Invariant cache hit.
[2023-03-11 18:08:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 18:08:11] [INFO ] Invariant cache hit.
[2023-03-11 18:08:12] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-11 18:08:12] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-11 18:08:12] [INFO ] Invariant cache hit.
[2023-03-11 18:08:12] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 146/146 places, 314/314 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 1171 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 18:08:13] [INFO ] Invariant cache hit.
[2023-03-11 18:08:13] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-11 18:08:13] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 18:08:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-11 18:08:13] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 18:08:13] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-11 18:08:13] [INFO ] After 22ms SMT Verify possible using 133 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 18:08:14] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 18:08:14] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F p1)]
Knowledge based reduction with 18 factoid took 1498 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 32147 reset in 555 ms.
Product exploration explored 100000 steps with 32400 reset in 566 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 10 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2023-03-11 18:08:17] [INFO ] Invariant cache hit.
[2023-03-11 18:08:17] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-11 18:08:17] [INFO ] Invariant cache hit.
[2023-03-11 18:08:17] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-11 18:08:17] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-11 18:08:17] [INFO ] Invariant cache hit.
[2023-03-11 18:08:18] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 146/146 places, 314/314 transitions.
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-03 finished in 12261 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)&&X((p1||G(p2)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 147 cols
[2023-03-11 18:08:18] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 18:08:18] [INFO ] Implicit Places using invariants in 85 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s96 0) (EQ s145 0)), p1:(AND (EQ s23 1) (EQ s96 1) (EQ s145 1)), p2:(EQ s85 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-04 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' '!(F((p0&&F((p1||(F(p1)&&F(p2)))))))'
Support contains 3 out of 147 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 : 147/147 places, 314/314 transitions.
Graph (trivial) has 114 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 75 place count 90 transition count 221
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 0 with 74 rules applied. Total rules applied 149 place count 90 transition count 147
Applied a total of 149 rules in 16 ms. Remains 90 /147 variables (removed 57) and now considering 147/314 (removed 167) transitions.
[2023-03-11 18:08:18] [INFO ] Flow matrix only has 118 transitions (discarded 29 similar events)
// Phase 1: matrix 118 rows 90 cols
[2023-03-11 18:08:18] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 18:08:18] [INFO ] Implicit Places using invariants in 75 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/147 places, 147/314 transitions.
Graph (trivial) has 115 edges and 89 vertex of which 30 / 89 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 69 transition count 96
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 58 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 57 transition count 95
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 25 place count 57 transition count 83
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 49 place count 45 transition count 83
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 32 transition count 70
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 87 place count 32 transition count 58
Applied a total of 87 rules in 9 ms. Remains 32 /89 variables (removed 57) and now considering 58/147 (removed 89) transitions.
[2023-03-11 18:08:18] [INFO ] Flow matrix only has 37 transitions (discarded 21 similar events)
// Phase 1: matrix 37 rows 32 cols
[2023-03-11 18:08:18] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-11 18:08:18] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 18:08:18] [INFO ] Flow matrix only has 37 transitions (discarded 21 similar events)
[2023-03-11 18:08:18] [INFO ] Invariant cache hit.
[2023-03-11 18:08:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 18:08:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/147 places, 58/314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 32/147 places, 58/314 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s26 0), p1:(AND (EQ s5 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-05 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 115 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 167 edges and 124 vertex of which 110 / 124 are part of one of the 14 SCC in 1 ms
Free SCC test removed 96 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 28 transition count 254
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 226 transitions
Reduce isomorphic transitions removed 226 transitions.
Graph (trivial) has 19 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 248 place count 14 transition count 27
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 250 place count 13 transition count 26
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 252 place count 11 transition count 22
Iterating global reduction 3 with 2 rules applied. Total rules applied 254 place count 11 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 259 place count 11 transition count 17
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 263 place count 8 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 7 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 266 place count 6 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 267 place count 6 transition count 14
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 274 place count 6 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 276 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 278 place count 4 transition count 5
Applied a total of 278 rules in 18 ms. Remains 4 /147 variables (removed 143) and now considering 5/314 (removed 309) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 18:08:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 18:08:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 18:08:18] [INFO ] Invariant cache hit.
[2023-03-11 18:08:18] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-11 18:08:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 18:08:18] [INFO ] Invariant cache hit.
[2023-03-11 18:08:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/147 places, 5/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 4/147 places, 5/314 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-06 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F((G(p0)||p1)))))'
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 147 cols
[2023-03-11 18:08:19] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-11 18:08:19] [INFO ] Implicit Places using invariants in 105 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s49 1) (EQ s24 0) (EQ s35 0) (EQ s145 0)), p0:(OR (EQ s60 0) (EQ s131 0) (EQ s145 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 591 ms.
Product exploration explored 100000 steps with 50000 reset in 597 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-12a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-07 finished in 1655 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||X(G(p1)))))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2023-03-11 18:08:20] [INFO ] Invariant cache hit.
[2023-03-11 18:08:20] [INFO ] Implicit Places using invariants in 77 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s59 1) (EQ s120 1) (EQ s145 1) (EQ s83 1)), p1:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-08 finished in 187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2023-03-11 18:08:20] [INFO ] Invariant cache hit.
[2023-03-11 18:08:20] [INFO ] Implicit Places using invariants in 112 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s145 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][false, false]]
Product exploration explored 100000 steps with 273 reset in 282 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 2 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-09 finished in 473 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 G(p0)) U ((p1&&F(!p2)) U p3)))'
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2023-03-11 18:08:21] [INFO ] Invariant cache hit.
[2023-03-11 18:08:21] [INFO ] Implicit Places using invariants in 80 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p3), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND p2 (NOT p0)), (AND p2 (NOT p0)), true, p2, (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(AND (EQ s108 1) (EQ s119 1) (EQ s145 1)), p1:(NEQ s85 1), p0:(AND (EQ s23 1) (EQ s48 1) (EQ s145 1)), p2:(AND (EQ s119 1) (EQ s132 1) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1321 steps with 98 reset in 12 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-10 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(F(!p0)) U p1)) U X((p1||G(F(p2))))))'
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2023-03-11 18:08:21] [INFO ] Invariant cache hit.
[2023-03-11 18:08:21] [INFO ] Implicit Places using invariants in 74 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 421 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-11 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 (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s107 1) (EQ s132 1) (EQ s145 1)), p0:(AND (EQ s24 1) (EQ s131 1) (EQ s145 1)), p2:(AND (EQ s71 1) (EQ s108 1) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8786 reset in 528 ms.
Stack based approach found an accepted trace after 1048 steps with 84 reset with depth 6 and stack size 6 in 6 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-11 finished in 1084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2023-03-11 18:08:22] [INFO ] Invariant cache hit.
[2023-03-11 18:08:22] [INFO ] Implicit Places using invariants in 84 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 146/147 places, 314/314 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s71 1) (EQ s145 1)), p1:(EQ s120 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 2949 reset in 412 ms.
Stack based approach found an accepted trace after 13 steps with 2 reset with depth 4 and stack size 4 in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-13 finished in 734 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 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 115 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 3 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 91 transition count 222
Drop transitions removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 0 with 83 rules applied. Total rules applied 156 place count 91 transition count 139
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 157 place count 91 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 158 place count 90 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 159 place count 90 transition count 138
Applied a total of 159 rules in 23 ms. Remains 90 /147 variables (removed 57) and now considering 138/314 (removed 176) transitions.
[2023-03-11 18:08:23] [INFO ] Flow matrix only has 117 transitions (discarded 21 similar events)
// Phase 1: matrix 117 rows 90 cols
[2023-03-11 18:08:23] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-11 18:08:23] [INFO ] Implicit Places using invariants in 62 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/147 places, 138/314 transitions.
Graph (trivial) has 118 edges and 89 vertex of which 30 / 89 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 69 transition count 86
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 57 transition count 86
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 57 transition count 74
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 45 transition count 74
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 77 place count 31 transition count 60
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 89 place count 31 transition count 48
Applied a total of 89 rules in 5 ms. Remains 31 /89 variables (removed 58) and now considering 48/138 (removed 90) transitions.
[2023-03-11 18:08:23] [INFO ] Flow matrix only has 35 transitions (discarded 13 similar events)
// Phase 1: matrix 35 rows 31 cols
[2023-03-11 18:08:23] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-11 18:08:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 18:08:23] [INFO ] Flow matrix only has 35 transitions (discarded 13 similar events)
[2023-03-11 18:08:23] [INFO ] Invariant cache hit.
[2023-03-11 18:08:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 18:08:23] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/147 places, 48/314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 31/147 places, 48/314 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s15 1) (NEQ s23 1) (NEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-14 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 115 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 91 transition count 222
Drop transitions removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 0 with 83 rules applied. Total rules applied 156 place count 91 transition count 139
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 157 place count 91 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 158 place count 90 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 159 place count 90 transition count 138
Applied a total of 159 rules in 16 ms. Remains 90 /147 variables (removed 57) and now considering 138/314 (removed 176) transitions.
[2023-03-11 18:08:23] [INFO ] Flow matrix only has 117 transitions (discarded 21 similar events)
// Phase 1: matrix 117 rows 90 cols
[2023-03-11 18:08:23] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-11 18:08:23] [INFO ] Implicit Places using invariants in 63 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/147 places, 138/314 transitions.
Graph (trivial) has 118 edges and 89 vertex of which 30 / 89 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 69 transition count 86
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 57 transition count 86
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 57 transition count 74
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 45 transition count 74
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 77 place count 31 transition count 60
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 89 place count 31 transition count 48
Applied a total of 89 rules in 4 ms. Remains 31 /89 variables (removed 58) and now considering 48/138 (removed 90) transitions.
[2023-03-11 18:08:23] [INFO ] Flow matrix only has 35 transitions (discarded 13 similar events)
// Phase 1: matrix 35 rows 31 cols
[2023-03-11 18:08:23] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-11 18:08:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 18:08:23] [INFO ] Flow matrix only has 35 transitions (discarded 13 similar events)
[2023-03-11 18:08:23] [INFO ] Invariant cache hit.
[2023-03-11 18:08:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 18:08:23] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/147 places, 48/314 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 31/147 places, 48/314 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s23 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-15 finished in 194 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||(G(p1) U X(p2))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-12a-LTLFireability-03
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 112 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 92 transition count 223
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 0 with 74 rules applied. Total rules applied 145 place count 92 transition count 149
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 92 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 91 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 91 transition count 148
Applied a total of 148 rules in 14 ms. Remains 91 /147 variables (removed 56) and now considering 148/314 (removed 166) transitions.
[2023-03-11 18:08:24] [INFO ] Flow matrix only has 119 transitions (discarded 29 similar events)
// Phase 1: matrix 119 rows 91 cols
[2023-03-11 18:08:24] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-11 18:08:24] [INFO ] Implicit Places using invariants in 64 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 90/147 places, 148/314 transitions.
Graph (trivial) has 114 edges and 90 vertex of which 27 / 90 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 72 transition count 101
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 61 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 60 transition count 100
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 25 place count 60 transition count 88
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 49 place count 48 transition count 88
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 35 transition count 75
Applied a total of 75 rules in 3 ms. Remains 35 /90 variables (removed 55) and now considering 75/148 (removed 73) transitions.
[2023-03-11 18:08:24] [INFO ] Flow matrix only has 44 transitions (discarded 31 similar events)
// Phase 1: matrix 44 rows 35 cols
[2023-03-11 18:08:24] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-11 18:08:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 18:08:24] [INFO ] Flow matrix only has 44 transitions (discarded 31 similar events)
[2023-03-11 18:08:24] [INFO ] Invariant cache hit.
[2023-03-11 18:08:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 18:08:24] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 35/147 places, 75/314 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 155 ms. Remains : 35/147 places, 75/314 transitions.
Running random walk in product with property : FlexibleBarrier-PT-12a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s14 1) (EQ s34 1)), p1:(EQ s25 1), p2:(NEQ s16 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1085 steps with 349 reset in 12 ms.
Treatment of property FlexibleBarrier-PT-12a-LTLFireability-03 finished in 601 ms.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-11 18:08:24] [INFO ] Flatten gal took : 14 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 21016 ms.
ITS solved all properties within timeout

BK_STOP 1678558105531

--------------------
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

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="FlexibleBarrier-PT-12a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-12a, 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 r169-tall-167838856000508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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