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.r571-tall-171734910100023.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 CO4-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 54K Jun 2 16:33 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 CO4-PT-05-LTLFireability-00
FORMULA_NAME CO4-PT-05-LTLFireability-01
FORMULA_NAME CO4-PT-05-LTLFireability-02
FORMULA_NAME CO4-PT-05-LTLFireability-03
FORMULA_NAME CO4-PT-05-LTLFireability-04
FORMULA_NAME CO4-PT-05-LTLFireability-05
FORMULA_NAME CO4-PT-05-LTLFireability-06
FORMULA_NAME CO4-PT-05-LTLFireability-07
FORMULA_NAME CO4-PT-05-LTLFireability-08
FORMULA_NAME CO4-PT-05-LTLFireability-09
FORMULA_NAME CO4-PT-05-LTLFireability-10
FORMULA_NAME CO4-PT-05-LTLFireability-11
FORMULA_NAME CO4-PT-05-LTLFireability-12
FORMULA_NAME CO4-PT-05-LTLFireability-13
FORMULA_NAME CO4-PT-05-LTLFireability-14
FORMULA_NAME CO4-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368594922

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=CO4-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:49:56] [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-06-02 22:49:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:49:56] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2024-06-02 22:49:56] [INFO ] Transformed 101 places.
[2024-06-02 22:49:56] [INFO ] Transformed 253 transitions.
[2024-06-02 22:49:56] [INFO ] Found NUPN structural information;
[2024-06-02 22:49:56] [INFO ] Parsed PT model containing 101 places and 253 transitions and 723 arcs in 113 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 2 formulas.
Ensure Unique test removed 38 transitions
Reduce redundant transitions removed 38 transitions.
FORMULA CO4-PT-05-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 215/215 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 72 transition count 166
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 72 transition count 166
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 69 place count 72 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 70 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 70 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 68 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 68 transition count 147
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 68 transition count 146
Applied a total of 78 rules in 22 ms. Remains 68 /101 variables (removed 33) and now considering 146/215 (removed 69) transitions.
[2024-06-02 22:49:56] [INFO ] Flow matrix only has 115 transitions (discarded 31 similar events)
// Phase 1: matrix 115 rows 68 cols
[2024-06-02 22:49:56] [INFO ] Computed 5 invariants in 10 ms
[2024-06-02 22:49:57] [INFO ] Implicit Places using invariants in 154 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 385 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/101 places, 146/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 67/101 places, 146/215 transitions.
Support contains 27 out of 67 places after structural reductions.
[2024-06-02 22:49:57] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:49:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:49:57] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 26 out of 67 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:49:57] [INFO ] Flow matrix only has 115 transitions (discarded 31 similar events)
// Phase 1: matrix 115 rows 67 cols
[2024-06-02 22:49:57] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:49:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:49:57] [INFO ] After 103ms 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 14 simplifications.
Computed a total of 9 stabilizing places and 9 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' '!(X(G((p0||G(p1)))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 119
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 39 place count 52 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 48 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 48 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 46 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 46 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 46 transition count 97
Applied a total of 52 rules in 7 ms. Remains 46 /67 variables (removed 21) and now considering 97/146 (removed 49) transitions.
[2024-06-02 22:49:58] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
// Phase 1: matrix 84 rows 46 cols
[2024-06-02 22:49:58] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:49:58] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:49:58] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-06-02 22:49:58] [INFO ] Invariant cache hit.
[2024-06-02 22:49:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:49:58] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [21, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 155 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/67 places, 97/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 42 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 42 transition count 94
Applied a total of 4 rules in 3 ms. Remains 42 /44 variables (removed 2) and now considering 94/97 (removed 3) transitions.
[2024-06-02 22:49:58] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
// Phase 1: matrix 82 rows 42 cols
[2024-06-02 22:49:58] [INFO ] Computed 2 invariants in 2 ms
[2024-06-02 22:49:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 22:49:58] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
[2024-06-02 22:49:58] [INFO ] Invariant cache hit.
[2024-06-02 22:49:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:58] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/67 places, 94/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 248 ms. Remains : 42/67 places, 94/146 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 340 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s30 0), p0:(AND (EQ s27 1) (EQ s34 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 3 ms.
FORMULA CO4-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-05-LTLFireability-00 finished in 640 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) U p2)))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 54 transition count 122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 54 transition count 122
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 34 place count 54 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 51 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 51 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 50 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 50 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 50 transition count 105
Applied a total of 43 rules in 8 ms. Remains 50 /67 variables (removed 17) and now considering 105/146 (removed 41) transitions.
[2024-06-02 22:49:58] [INFO ] Flow matrix only has 89 transitions (discarded 16 similar events)
// Phase 1: matrix 89 rows 50 cols
[2024-06-02 22:49:58] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:49:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 22:49:58] [INFO ] Flow matrix only has 89 transitions (discarded 16 similar events)
[2024-06-02 22:49:58] [INFO ] Invariant cache hit.
[2024-06-02 22:49:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [24, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 104 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/67 places, 105/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 47 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 46 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 102
Applied a total of 4 rules in 4 ms. Remains 46 /48 variables (removed 2) and now considering 102/105 (removed 3) transitions.
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 87 transitions (discarded 15 similar events)
// Phase 1: matrix 87 rows 46 cols
[2024-06-02 22:49:59] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 87 transitions (discarded 15 similar events)
[2024-06-02 22:49:59] [INFO ] Invariant cache hit.
[2024-06-02 22:49:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/67 places, 102/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 46/67 places, 102/146 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s17 1), p2:(AND (EQ s25 1) (EQ s38 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]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 2 ms.
FORMULA CO4-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-05-LTLFireability-01 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' '!(X(X(F(p0))))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 51 transition count 117
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 51 transition count 117
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 51 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 47 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 47 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 45 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 45 transition count 95
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 45 transition count 94
Applied a total of 55 rules in 6 ms. Remains 45 /67 variables (removed 22) and now considering 94/146 (removed 52) transitions.
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
// Phase 1: matrix 82 rows 45 cols
[2024-06-02 22:49:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
[2024-06-02 22:49:59] [INFO ] Invariant cache hit.
[2024-06-02 22:49:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [21, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 80 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/67 places, 94/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 41 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 41 transition count 91
Applied a total of 4 rules in 2 ms. Remains 41 /43 variables (removed 2) and now considering 91/94 (removed 3) transitions.
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 80 transitions (discarded 11 similar events)
// Phase 1: matrix 80 rows 41 cols
[2024-06-02 22:49:59] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 80 transitions (discarded 11 similar events)
[2024-06-02 22:49:59] [INFO ] Invariant cache hit.
[2024-06-02 22:49:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/67 places, 91/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 41/67 places, 91/146 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s19 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 30940 reset in 225 ms.
Stack based approach found an accepted trace after 3665 steps with 1133 reset with depth 4 and stack size 4 in 6 ms.
FORMULA CO4-PT-05-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-05-LTLFireability-02 finished in 532 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((X(p0)||G(p1))))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 119
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 39 place count 52 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 48 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 48 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 46 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 46 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 46 transition count 97
Applied a total of 52 rules in 6 ms. Remains 46 /67 variables (removed 21) and now considering 97/146 (removed 49) transitions.
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
// Phase 1: matrix 84 rows 46 cols
[2024-06-02 22:49:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-06-02 22:49:59] [INFO ] Invariant cache hit.
[2024-06-02 22:49:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [21, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 104 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/67 places, 97/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 42 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 42 transition count 94
Applied a total of 4 rules in 2 ms. Remains 42 /44 variables (removed 2) and now considering 94/97 (removed 3) transitions.
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
// Phase 1: matrix 82 rows 42 cols
[2024-06-02 22:49:59] [INFO ] Computed 2 invariants in 1 ms
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:49:59] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
[2024-06-02 22:49:59] [INFO ] Invariant cache hit.
[2024-06-02 22:49:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:49:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/67 places, 94/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 42/67 places, 94/146 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s27 1), p0:(EQ s27 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 132 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT 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 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-05-LTLFireability-03 finished in 658 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)||(p1&&G(F(!p0))))))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Reduce places removed 1 places and 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 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 64 transition count 143
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 49 transition count 114
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 49 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 43 place count 49 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 45 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 45 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 45 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 60 place count 41 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 41 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 64 place count 38 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 67 place count 38 transition count 85
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 70 place count 35 transition count 79
Iterating global reduction 5 with 3 rules applied. Total rules applied 73 place count 35 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 75 place count 35 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 77 place count 34 transition count 86
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 96 place count 34 transition count 67
Applied a total of 96 rules in 27 ms. Remains 34 /67 variables (removed 33) and now considering 67/146 (removed 79) transitions.
[2024-06-02 22:50:00] [INFO ] Flow matrix only has 57 transitions (discarded 10 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 22:50:00] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:50:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 22:50:00] [INFO ] Flow matrix only has 57 transitions (discarded 10 similar events)
[2024-06-02 22:50:00] [INFO ] Invariant cache hit.
[2024-06-02 22:50:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:50:00] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [15, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 75 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/67 places, 67/146 transitions.
Graph (trivial) has 23 edges and 32 vertex of which 10 / 32 are part of one of the 2 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 23 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 23 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 23 transition count 47
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 1 with 2 rules applied. Total rules applied 6 place count 22 transition count 46
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 22 transition count 43
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 1 with 2 rules applied. Total rules applied 11 place count 21 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 21 transition count 41
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 1 with 2 rules applied. Total rules applied 14 place count 20 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 20 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 15 place count 20 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 19 transition count 38
Applied a total of 17 rules in 10 ms. Remains 19 /32 variables (removed 13) and now considering 38/67 (removed 29) transitions.
[2024-06-02 22:50:00] [INFO ] Flow matrix only has 31 transitions (discarded 7 similar events)
// Phase 1: matrix 31 rows 19 cols
[2024-06-02 22:50:00] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 22:50:00] [INFO ] Implicit Places using invariants in 20 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/67 places, 38/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 134 ms. Remains : 18/67 places, 38/146 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CO4-PT-05-LTLFireability-04 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=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s9 1), p1:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CO4-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-05-LTLFireability-04 finished in 362 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)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Reduce places removed 1 places and 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 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 64 transition count 143
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 49 transition count 114
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 49 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 43 place count 49 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 45 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 45 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 45 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 60 place count 41 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 41 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 64 place count 38 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 67 place count 38 transition count 85
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 70 place count 35 transition count 79
Iterating global reduction 5 with 3 rules applied. Total rules applied 73 place count 35 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 75 place count 35 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 77 place count 34 transition count 87
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 96 place count 34 transition count 68
Applied a total of 96 rules in 20 ms. Remains 34 /67 variables (removed 33) and now considering 68/146 (removed 78) transitions.
[2024-06-02 22:50:00] [INFO ] Flow matrix only has 57 transitions (discarded 11 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 22:50:00] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:50:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 22:50:00] [INFO ] Flow matrix only has 57 transitions (discarded 11 similar events)
[2024-06-02 22:50:00] [INFO ] Invariant cache hit.
[2024-06-02 22:50:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:50:00] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [14, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/67 places, 68/146 transitions.
Graph (trivial) has 27 edges and 32 vertex of which 14 / 32 are part of one of the 3 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 19 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 19 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 19 transition count 40
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 1 with 2 rules applied. Total rules applied 9 place count 18 transition count 39
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 18 transition count 36
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 1 with 2 rules applied. Total rules applied 14 place count 17 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 17 transition count 34
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 1 with 2 rules applied. Total rules applied 17 place count 16 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 16 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 16 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 15 transition count 31
Applied a total of 20 rules in 7 ms. Remains 15 /32 variables (removed 17) and now considering 31/68 (removed 37) transitions.
[2024-06-02 22:50:00] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
// Phase 1: matrix 24 rows 15 cols
[2024-06-02 22:50:00] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 22:50:00] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/67 places, 31/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 125 ms. Remains : 14/67 places, 31/146 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CO4-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-05-LTLFireability-05 finished in 217 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(G(p1))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 51 transition count 117
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 51 transition count 117
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 51 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 47 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 47 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 45 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 45 transition count 95
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 45 transition count 94
Applied a total of 55 rules in 8 ms. Remains 45 /67 variables (removed 22) and now considering 94/146 (removed 52) transitions.
[2024-06-02 22:50:00] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
// Phase 1: matrix 82 rows 45 cols
[2024-06-02 22:50:00] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:50:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 22:50:00] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
[2024-06-02 22:50:00] [INFO ] Invariant cache hit.
[2024-06-02 22:50:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:50:01] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [21, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 113 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/67 places, 94/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 41 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 41 transition count 91
Applied a total of 4 rules in 1 ms. Remains 41 /43 variables (removed 2) and now considering 91/94 (removed 3) transitions.
[2024-06-02 22:50:01] [INFO ] Flow matrix only has 80 transitions (discarded 11 similar events)
// Phase 1: matrix 80 rows 41 cols
[2024-06-02 22:50:01] [INFO ] Computed 2 invariants in 1 ms
[2024-06-02 22:50:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:50:01] [INFO ] Flow matrix only has 80 transitions (discarded 11 similar events)
[2024-06-02 22:50:01] [INFO ] Invariant cache hit.
[2024-06-02 22:50:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:50:01] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/67 places, 91/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 366 ms. Remains : 41/67 places, 91/146 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CO4-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 1) (AND (EQ s10 1) (EQ s30 1)) (AND (EQ s29 1) (EQ s33 1))), p1:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 202 steps with 26 reset in 5 ms.
FORMULA CO4-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-05-LTLFireability-06 finished in 517 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((G(p1)||G(p0)))))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 121
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 121
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 53 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 49 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 49 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 47 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 47 transition count 101
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 47 transition count 100
Applied a total of 49 rules in 2 ms. Remains 47 /67 variables (removed 20) and now considering 100/146 (removed 46) transitions.
[2024-06-02 22:50:01] [INFO ] Flow matrix only has 86 transitions (discarded 14 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-06-02 22:50:01] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:50:01] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-02 22:50:01] [INFO ] Flow matrix only has 86 transitions (discarded 14 similar events)
[2024-06-02 22:50:01] [INFO ] Invariant cache hit.
[2024-06-02 22:50:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:50:01] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [22, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 110 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/67 places, 100/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 44 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 43 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 43 transition count 97
Applied a total of 4 rules in 1 ms. Remains 43 /45 variables (removed 2) and now considering 97/100 (removed 3) transitions.
[2024-06-02 22:50:01] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
// Phase 1: matrix 84 rows 43 cols
[2024-06-02 22:50:01] [INFO ] Computed 2 invariants in 7 ms
[2024-06-02 22:50:01] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:50:01] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-06-02 22:50:01] [INFO ] Invariant cache hit.
[2024-06-02 22:50:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:50:01] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/67 places, 97/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 43/67 places, 97/146 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (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)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 2}, { cond=p0, acceptance={0} source=5 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 3}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s32 0)), p1:(AND (EQ s29 1) (EQ s35 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 112 ms.
Stack based approach found an accepted trace after 2344 steps with 41 reset with depth 48 and stack size 42 in 5 ms.
FORMULA CO4-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-05-LTLFireability-07 finished in 681 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(p0)||(p1 U p2)||G(p3)))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 146/146 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 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 144
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 20 place count 49 transition count 113
Iterating global reduction 2 with 16 rules applied. Total rules applied 36 place count 49 transition count 113
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 46 place count 49 transition count 103
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 45 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 45 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 45 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 41 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 41 transition count 89
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 38 transition count 83
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 38 transition count 83
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 73 place count 35 transition count 77
Iterating global reduction 5 with 3 rules applied. Total rules applied 76 place count 35 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 78 place count 35 transition count 75
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 92 place count 35 transition count 61
Applied a total of 92 rules in 9 ms. Remains 35 /67 variables (removed 32) and now considering 61/146 (removed 85) transitions.
[2024-06-02 22:50:02] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
// Phase 1: matrix 55 rows 35 cols
[2024-06-02 22:50:02] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:50:02] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-02 22:50:02] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
[2024-06-02 22:50:02] [INFO ] Invariant cache hit.
[2024-06-02 22:50:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 22:50:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [15, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 461 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/67 places, 61/146 transitions.
Graph (trivial) has 17 edges and 33 vertex of which 6 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 27 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 27 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 27 transition count 49
Applied a total of 4 rules in 3 ms. Remains 27 /33 variables (removed 6) and now considering 49/61 (removed 12) transitions.
[2024-06-02 22:50:02] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 27 cols
[2024-06-02 22:50:02] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 22:50:02] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-02 22:50:02] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2024-06-02 22:50:02] [INFO ] Invariant cache hit.
[2024-06-02 22:50:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:50:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/67 places, 49/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 528 ms. Remains : 27/67 places, 49/146 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=4, aps=[p2:(EQ s7 1), p1:(NEQ s18 1), p3:(OR (EQ s20 0) (EQ s24 0)), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 6 reset in 80 ms.
Product exploration explored 100000 steps with 37 reset in 198 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p3 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p2) p1 p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p3)), (X (AND (NOT p0) (NOT p2) p1)), (X p3), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p2) p1 p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) p1 p3))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2) p1 p3))), (X (X (NOT (AND p0 (NOT p2) p1 p3))))]
Knowledge based reduction with 37 factoid took 1431 ms. Reduced automaton from 8 states, 27 edges and 4 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 351 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Incomplete random walk after 10000 steps, including 365 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:50:05] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2024-06-02 22:50:05] [INFO ] Invariant cache hit.
[2024-06-02 22:50:05] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:50:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:05] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p3 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p2) p1 p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 p3))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p3)), (X (AND (NOT p0) (NOT p2) p1)), (X p3), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p2) p1 p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) p1 p3))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2) p1 p3))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (F (AND p1 p2 (NOT p3))), (F (NOT (AND p1 (NOT p2) p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 p2 p3)), (F (AND (NOT p1) p2 p3)), (F (AND (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 39 factoid took 1690 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 363 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Support contains 4 out of 27 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 : 27/27 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-06-02 22:50:07] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2024-06-02 22:50:07] [INFO ] Invariant cache hit.
[2024-06-02 22:50:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 22:50:07] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2024-06-02 22:50:07] [INFO ] Invariant cache hit.
[2024-06-02 22:50:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:50:07] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-02 22:50:07] [INFO ] Redundant transitions in 19 ms returned []
[2024-06-02 22:50:07] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2024-06-02 22:50:07] [INFO ] Invariant cache hit.
[2024-06-02 22:50:07] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 27/27 places, 49/49 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (AND p1 (NOT p2) p3)), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p3)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 19 factoid took 595 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 515 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Incomplete random walk after 10000 steps, including 374 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:50:09] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2024-06-02 22:50:09] [INFO ] Invariant cache hit.
[2024-06-02 22:50:09] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:50:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-02 22:50:09] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (AND p1 (NOT p2) p3)), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p3)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 p2 (NOT p3))), (F (NOT (AND p1 (NOT p2) p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 p2 p3)), (F (AND (NOT p1) p2 p3)), (F (AND (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 21 factoid took 1260 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 321 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 351 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 359 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 28 reset in 70 ms.
Product exploration explored 100000 steps with 36 reset in 60 ms.
Built C files in :
/tmp/ltsmin15761687868554174628
[2024-06-02 22:50:11] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2024-06-02 22:50:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:11] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2024-06-02 22:50:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:11] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2024-06-02 22:50:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15761687868554174628
Running compilation step : cd /tmp/ltsmin15761687868554174628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 242 ms.
Running link step : cd /tmp/ltsmin15761687868554174628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15761687868554174628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16621892921489684943.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA CO4-PT-05-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-05-LTLFireability-08 finished in 9971 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(G((p0 U X((p1&&F(p2)))))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 120
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 120
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 37 place count 53 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 50 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 50 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 49 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 49 transition count 103
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 49 transition count 102
Applied a total of 46 rules in 5 ms. Remains 49 /67 variables (removed 18) and now considering 102/146 (removed 44) transitions.
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 87 transitions (discarded 15 similar events)
// Phase 1: matrix 87 rows 49 cols
[2024-06-02 22:50:12] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 87 transitions (discarded 15 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [22, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/67 places, 102/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 45 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 45 transition count 99
Applied a total of 4 rules in 12 ms. Remains 45 /47 variables (removed 2) and now considering 99/102 (removed 3) transitions.
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 85 transitions (discarded 14 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-06-02 22:50:12] [INFO ] Computed 2 invariants in 1 ms
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 85 transitions (discarded 14 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/67 places, 99/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 45/67 places, 99/146 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CO4-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s28 1), p1:(EQ s14 1), p2:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA CO4-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-05-LTLFireability-09 finished in 378 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(!p0))))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Reduce places removed 1 places and 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 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 64 transition count 143
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 49 transition count 114
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 49 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 43 place count 49 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 45 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 45 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 45 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 60 place count 41 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 41 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 64 place count 38 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 67 place count 38 transition count 85
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 70 place count 35 transition count 79
Iterating global reduction 5 with 3 rules applied. Total rules applied 73 place count 35 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 75 place count 35 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 77 place count 34 transition count 86
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 96 place count 34 transition count 67
Applied a total of 96 rules in 17 ms. Remains 34 /67 variables (removed 33) and now considering 67/146 (removed 79) transitions.
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 57 transitions (discarded 10 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 22:50:12] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 57 transitions (discarded 10 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [15, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 107 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/67 places, 67/146 transitions.
Graph (trivial) has 27 edges and 32 vertex of which 14 / 32 are part of one of the 3 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 19 transition count 41
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 19 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 19 transition count 39
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 1 with 2 rules applied. Total rules applied 9 place count 18 transition count 38
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 18 transition count 35
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 1 with 2 rules applied. Total rules applied 14 place count 17 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 17 transition count 33
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 1 with 2 rules applied. Total rules applied 17 place count 16 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 16 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 16 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 15 transition count 30
Applied a total of 20 rules in 6 ms. Remains 15 /32 variables (removed 17) and now considering 30/67 (removed 37) transitions.
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
// Phase 1: matrix 23 rows 15 cols
[2024-06-02 22:50:12] [INFO ] Computed 2 invariants in 15 ms
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants in 58 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/67 places, 30/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 194 ms. Remains : 14/67 places, 30/146 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), p0]
Running random walk in product with property : CO4-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s4 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 0 steps with 0 reset in 0 ms.
FORMULA CO4-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-05-LTLFireability-10 finished in 299 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(p2)))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 119
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 39 place count 52 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 48 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 48 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 46 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 46 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 46 transition count 97
Applied a total of 52 rules in 7 ms. Remains 46 /67 variables (removed 21) and now considering 97/146 (removed 49) transitions.
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
// Phase 1: matrix 84 rows 46 cols
[2024-06-02 22:50:12] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 84 transitions (discarded 13 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [22, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 87 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/67 places, 97/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 42 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 42 transition count 94
Applied a total of 4 rules in 2 ms. Remains 42 /44 variables (removed 2) and now considering 94/97 (removed 3) transitions.
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
// Phase 1: matrix 82 rows 42 cols
[2024-06-02 22:50:12] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 82 transitions (discarded 12 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 42/67 places, 94/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 42/67 places, 94/146 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CO4-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s30 1), p1:(EQ s18 0), p2:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15 reset in 47 ms.
Stack based approach found an accepted trace after 32 steps with 1 reset with depth 22 and stack size 19 in 0 ms.
FORMULA CO4-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-05-LTLFireability-11 finished in 334 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((F((G(p2)||(p2&&F(!p3))))||p1))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 54 transition count 122
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 54 transition count 122
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 35 place count 54 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 51 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 51 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 49 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 49 transition count 103
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 49 transition count 102
Applied a total of 46 rules in 5 ms. Remains 49 /67 variables (removed 18) and now considering 102/146 (removed 44) transitions.
[2024-06-02 22:50:13] [INFO ] Flow matrix only has 87 transitions (discarded 15 similar events)
// Phase 1: matrix 87 rows 49 cols
[2024-06-02 22:50:13] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:50:13] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 22:50:13] [INFO ] Flow matrix only has 87 transitions (discarded 15 similar events)
[2024-06-02 22:50:13] [INFO ] Invariant cache hit.
[2024-06-02 22:50:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 22:50:13] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/67 places, 102/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 47 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 46 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 99
Applied a total of 4 rules in 1 ms. Remains 46 /48 variables (removed 2) and now considering 99/102 (removed 3) transitions.
[2024-06-02 22:50:13] [INFO ] Flow matrix only has 85 transitions (discarded 14 similar events)
// Phase 1: matrix 85 rows 46 cols
[2024-06-02 22:50:13] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:13] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 22:50:13] [INFO ] Flow matrix only has 85 transitions (discarded 14 similar events)
[2024-06-02 22:50:13] [INFO ] Invariant cache hit.
[2024-06-02 22:50:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 22:50:13] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/67 places, 99/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 46/67 places, 99/146 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3)]
Running random walk in product with property : CO4-PT-05-LTLFireability-12 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 p3), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s26 0) (EQ s38 0)), p1:(OR (EQ s34 0) (EQ s36 0)), p2:(NEQ s18 1), p3:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 p2 (NOT p3)), (X (NOT (AND (NOT p1) p2 p3))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(X (X (AND p2 p3))), (X (X (NOT (AND p2 p3))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-05-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-05-LTLFireability-12 finished in 776 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 (G(p0)&&p1))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 119
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 119
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 52 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 49 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 49 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 47 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 47 transition count 99
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 47 transition count 98
Applied a total of 51 rules in 7 ms. Remains 47 /67 variables (removed 20) and now considering 98/146 (removed 48) transitions.
[2024-06-02 22:50:13] [INFO ] Flow matrix only has 84 transitions (discarded 14 similar events)
// Phase 1: matrix 84 rows 47 cols
[2024-06-02 22:50:13] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:50:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:50:13] [INFO ] Flow matrix only has 84 transitions (discarded 14 similar events)
[2024-06-02 22:50:13] [INFO ] Invariant cache hit.
[2024-06-02 22:50:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:50:13] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [23, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/67 places, 98/146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 44 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 43 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 43 transition count 95
Applied a total of 4 rules in 1 ms. Remains 43 /45 variables (removed 2) and now considering 95/98 (removed 3) transitions.
[2024-06-02 22:50:13] [INFO ] Flow matrix only has 82 transitions (discarded 13 similar events)
// Phase 1: matrix 82 rows 43 cols
[2024-06-02 22:50:14] [INFO ] Computed 2 invariants in 2 ms
[2024-06-02 22:50:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 22:50:14] [INFO ] Flow matrix only has 82 transitions (discarded 13 similar events)
[2024-06-02 22:50:14] [INFO ] Invariant cache hit.
[2024-06-02 22:50:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:50:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/67 places, 95/146 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 43/67 places, 95/146 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s21 1) (EQ s5 1)), p1:(AND (EQ s30 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-05-LTLFireability-14 finished in 321 ms.
All properties solved by simple procedures.
Total runtime 17733 ms.

BK_STOP 1717368615591

--------------------
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="CO4-PT-05"
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 CO4-PT-05, 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 r571-tall-171734910100023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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