Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640624700003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FlexibleBarrier-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624700003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 08:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 08:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 08:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 13 08:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 23K May 18 16:42 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-04a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716495694174

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 20:21:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:21:35] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2024-05-23 20:21:35] [INFO ] Transformed 51 places.
[2024-05-23 20:21:35] [INFO ] Transformed 88 transitions.
[2024-05-23 20:21:35] [INFO ] Found NUPN structural information;
[2024-05-23 20:21:35] [INFO ] Parsed PT model containing 51 places and 88 transitions and 309 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 18 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-23 20:21:36] [INFO ] Computed 6 invariants in 6 ms
[2024-05-23 20:21:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-23 20:21:36] [INFO ] Invariant cache hit.
[2024-05-23 20:21:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 20:21:36] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-23 20:21:36] [INFO ] Invariant cache hit.
[2024-05-23 20:21:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/51 places, 74/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 51/51 places, 74/78 transitions.
Support contains 22 out of 51 places after structural reductions.
[2024-05-23 20:21:36] [INFO ] Flatten gal took : 21 ms
[2024-05-23 20:21:36] [INFO ] Flatten gal took : 9 ms
[2024-05-23 20:21:36] [INFO ] Input system was already deterministic with 74 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:21:36] [INFO ] Invariant cache hit.
[2024-05-23 20:21:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-23 20:21:36] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 38 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 56 edges and 42 vertex of which 35 / 42 are part of one of the 5 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 12 transition count 62
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 60 place count 7 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 6 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 6 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 6 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 4 transition count 8
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 4 with 2 rules applied. Total rules applied 69 place count 3 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 72 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 74 place count 2 transition count 3
Applied a total of 74 rules in 23 ms. Remains 2 /51 variables (removed 49) and now considering 3/74 (removed 71) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-23 20:21:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:21:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 20:21:37] [INFO ] Invariant cache hit.
[2024-05-23 20:21:37] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-23 20:21:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:21:37] [INFO ] Invariant cache hit.
[2024-05-23 20:21:37] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/51 places, 3/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 2/51 places, 3/74 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 145 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-00 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 36 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 33 transition count 53
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 33 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 33 transition count 47
Applied a total of 28 rules in 16 ms. Remains 33 /51 variables (removed 18) and now considering 47/74 (removed 27) transitions.
[2024-05-23 20:21:37] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 33 cols
[2024-05-23 20:21:37] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 20:21:37] [INFO ] Implicit Places using invariants in 40 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/51 places, 47/74 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 32 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 28 transition count 43
Applied a total of 8 rules in 3 ms. Remains 28 /32 variables (removed 4) and now considering 43/47 (removed 4) transitions.
[2024-05-23 20:21:37] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
// Phase 1: matrix 37 rows 28 cols
[2024-05-23 20:21:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 20:21:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 20:21:37] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
[2024-05-23 20:21:37] [INFO ] Invariant cache hit.
[2024-05-23 20:21:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 20:21:37] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/51 places, 43/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 28/51 places, 43/74 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-01 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:(AND (EQ s23 1) (EQ s27 1)), p1:(EQ s19 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 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-01 finished in 328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-23 20:21:37] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:21:37] [INFO ] Implicit Places using invariants in 46 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s11 0) (EQ s36 0) (EQ s49 0)), p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Product exploration explored 100000 steps with 50000 reset in 153 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 (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-04a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-02 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U (p0 U p1)))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-23 20:21:38] [INFO ] Invariant cache hit.
[2024-05-23 20:21:38] [INFO ] Implicit Places using invariants in 86 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s10 1), p0:(AND (EQ s11 1) (EQ s24 1) (EQ s49 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-03 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&F(p1)) U G(p2)))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 34 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 36 transition count 58
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 36 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 36 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 35 transition count 49
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 35 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 34 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 34 transition count 48
Applied a total of 33 rules in 11 ms. Remains 34 /51 variables (removed 17) and now considering 48/74 (removed 26) transitions.
[2024-05-23 20:21:38] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 34 cols
[2024-05-23 20:21:38] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 20:21:38] [INFO ] Implicit Places using invariants in 53 ms returned [32, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/51 places, 48/74 transitions.
Graph (trivial) has 38 edges and 32 vertex of which 17 / 32 are part of one of the 3 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 17 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 16 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 14 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 14 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 13 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 13 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 12 transition count 18
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 4 with 2 rules applied. Total rules applied 16 place count 11 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 11 transition count 16
Applied a total of 17 rules in 7 ms. Remains 11 /32 variables (removed 21) and now considering 16/48 (removed 32) transitions.
[2024-05-23 20:21:38] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-05-23 20:21:38] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 20:21:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 20:21:38] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-05-23 20:21:38] [INFO ] Invariant cache hit.
[2024-05-23 20:21:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:21:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/51 places, 16/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 11/51 places, 16/74 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s4 1), p0:(EQ s6 1), p1:(NEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-04 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(!p1)))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-23 20:21:39] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 20:21:39] [INFO ] Implicit Places using invariants in 57 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s34 1), p1:(AND (EQ s16 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24865 reset in 133 ms.
Stack based approach found an accepted trace after 33404 steps with 8286 reset with depth 24 and stack size 24 in 70 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-05 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 35 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 35 transition count 57
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 35 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 32 place count 35 transition count 49
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 34 transition count 49
Applied a total of 34 rules in 14 ms. Remains 34 /51 variables (removed 17) and now considering 49/74 (removed 25) transitions.
[2024-05-23 20:21:39] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 34 cols
[2024-05-23 20:21:39] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 20:21:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-23 20:21:39] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2024-05-23 20:21:39] [INFO ] Invariant cache hit.
[2024-05-23 20:21:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 20:21:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-23 20:21:39] [INFO ] Redundant transitions in 23 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2024-05-23 20:21:39] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
// Phase 1: matrix 43 rows 34 cols
[2024-05-23 20:21:39] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 20:21:39] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/51 places, 48/74 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 33 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 33 transition count 47
Applied a total of 3 rules in 4 ms. Remains 33 /34 variables (removed 1) and now considering 47/48 (removed 1) transitions.
[2024-05-23 20:21:39] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
// Phase 1: matrix 42 rows 33 cols
[2024-05-23 20:21:39] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:21:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-23 20:21:39] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
[2024-05-23 20:21:39] [INFO ] Invariant cache hit.
[2024-05-23 20:21:39] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-23 20:21:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/51 places, 47/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 33/51 places, 47/74 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s32 1) (EQ s22 1) (EQ s29 1) (EQ s31 1)), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-06 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-23 20:21:39] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 20:21:39] [INFO ] Implicit Places using invariants in 43 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s10 1)), p1:(AND (EQ s38 1) (EQ s49 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 375 reset in 198 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-11 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p1)||p0))))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-23 20:21:40] [INFO ] Invariant cache hit.
[2024-05-23 20:21:40] [INFO ] Implicit Places using invariants in 42 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (NEQ s11 1) (NEQ s24 1) (NEQ s49 1)), p1:(EQ s27 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 22537 reset in 91 ms.
Stack based approach found an accepted trace after 2435 steps with 543 reset with depth 7 and stack size 7 in 3 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-12 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-23 20:21:40] [INFO ] Invariant cache hit.
[2024-05-23 20:21:40] [INFO ] Implicit Places using invariants in 43 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-13 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: 2}]], initial=3, aps=[p0:(AND (EQ s36 1) (EQ s47 1) (EQ s49 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-13 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X(F(p2)))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-23 20:21:40] [INFO ] Invariant cache hit.
[2024-05-23 20:21:40] [INFO ] Implicit Places using invariants in 51 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s25 1), p1:(OR (EQ s24 0) (EQ s35 0) (EQ s49 0)), p2:(AND (EQ s18 1) (EQ s49 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 986 reset in 94 ms.
Stack based approach found an accepted trace after 47 steps with 1 reset with depth 20 and stack size 20 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-14 finished in 353 ms.
All properties solved by simple procedures.
Total runtime 5355 ms.

BK_STOP 1716495702746

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FlexibleBarrier-PT-04a, 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 r197-tall-171640624700003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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