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.r329-tall-171662361900263.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 Raft-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361900263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 41K May 18 16:43 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 Raft-PT-04-LTLFireability-00
FORMULA_NAME Raft-PT-04-LTLFireability-01
FORMULA_NAME Raft-PT-04-LTLFireability-02
FORMULA_NAME Raft-PT-04-LTLFireability-03
FORMULA_NAME Raft-PT-04-LTLFireability-04
FORMULA_NAME Raft-PT-04-LTLFireability-05
FORMULA_NAME Raft-PT-04-LTLFireability-06
FORMULA_NAME Raft-PT-04-LTLFireability-07
FORMULA_NAME Raft-PT-04-LTLFireability-08
FORMULA_NAME Raft-PT-04-LTLFireability-09
FORMULA_NAME Raft-PT-04-LTLFireability-10
FORMULA_NAME Raft-PT-04-LTLFireability-11
FORMULA_NAME Raft-PT-04-LTLFireability-12
FORMULA_NAME Raft-PT-04-LTLFireability-13
FORMULA_NAME Raft-PT-04-LTLFireability-14
FORMULA_NAME Raft-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716856224807

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=Raft-PT-04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 00:30:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 00:30:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:30:26] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2024-05-28 00:30:26] [INFO ] Transformed 88 places.
[2024-05-28 00:30:26] [INFO ] Transformed 160 transitions.
[2024-05-28 00:30:26] [INFO ] Found NUPN structural information;
[2024-05-28 00:30:26] [INFO ] Parsed PT model containing 88 places and 160 transitions and 563 arcs in 105 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 1 formulas.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
FORMULA Raft-PT-04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 142/142 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 86 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 86 transition count 138
Applied a total of 4 rules in 15 ms. Remains 86 /88 variables (removed 2) and now considering 138/142 (removed 4) transitions.
[2024-05-28 00:30:26] [INFO ] Flow matrix only has 124 transitions (discarded 14 similar events)
// Phase 1: matrix 124 rows 86 cols
[2024-05-28 00:30:26] [INFO ] Computed 16 invariants in 13 ms
[2024-05-28 00:30:26] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-28 00:30:26] [INFO ] Flow matrix only has 124 transitions (discarded 14 similar events)
[2024-05-28 00:30:26] [INFO ] Invariant cache hit.
[2024-05-28 00:30:26] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:26] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-28 00:30:26] [INFO ] Flow matrix only has 124 transitions (discarded 14 similar events)
[2024-05-28 00:30:26] [INFO ] Invariant cache hit.
[2024-05-28 00:30:27] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/88 places, 138/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 86/88 places, 138/142 transitions.
Support contains 29 out of 86 places after structural reductions.
[2024-05-28 00:30:27] [INFO ] Flatten gal took : 30 ms
[2024-05-28 00:30:27] [INFO ] Flatten gal took : 13 ms
[2024-05-28 00:30:27] [INFO ] Input system was already deterministic with 138 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 40) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 00:30:27] [INFO ] Flow matrix only has 124 transitions (discarded 14 similar events)
[2024-05-28 00:30:27] [INFO ] Invariant cache hit.
[2024-05-28 00:30:27] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 00:30:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-28 00:30:27] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 5 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 81 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 19 place count 72 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 72 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 37 place count 72 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 68 transition count 118
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 68 transition count 108
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 59 transition count 99
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 59 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 59 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 58 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 55 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 55 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 55 transition count 83
Applied a total of 93 rules in 41 ms. Remains 55 /86 variables (removed 31) and now considering 83/138 (removed 55) transitions.
[2024-05-28 00:30:28] [INFO ] Flow matrix only has 68 transitions (discarded 15 similar events)
// Phase 1: matrix 68 rows 55 cols
[2024-05-28 00:30:28] [INFO ] Computed 16 invariants in 6 ms
[2024-05-28 00:30:28] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 00:30:28] [INFO ] Flow matrix only has 68 transitions (discarded 15 similar events)
[2024-05-28 00:30:28] [INFO ] Invariant cache hit.
[2024-05-28 00:30:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 00:30:28] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-28 00:30:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 00:30:28] [INFO ] Flow matrix only has 68 transitions (discarded 15 similar events)
[2024-05-28 00:30:28] [INFO ] Invariant cache hit.
[2024-05-28 00:30:28] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/86 places, 83/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 55/86 places, 83/138 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 260 ms :[(NOT p0)]
Running random walk in product with property : Raft-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 27 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Raft-PT-04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Raft-PT-04-LTLFireability-00 finished in 1263 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((G(p1)||p0))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Applied a total of 4 rules in 7 ms. Remains 84 /86 variables (removed 2) and now considering 134/138 (removed 4) transitions.
[2024-05-28 00:30:29] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
// Phase 1: matrix 122 rows 84 cols
[2024-05-28 00:30:29] [INFO ] Computed 16 invariants in 3 ms
[2024-05-28 00:30:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 00:30:29] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:29] [INFO ] Invariant cache hit.
[2024-05-28 00:30:29] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:29] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-28 00:30:29] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:29] [INFO ] Invariant cache hit.
[2024-05-28 00:30:29] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/86 places, 134/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 84/86 places, 134/138 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Raft-PT-04-LTLFireability-01 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:(OR (NEQ s5 1) (NEQ s64 1)), p0:(OR (EQ s78 0) (EQ s81 0))], 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]]
Product exploration explored 100000 steps with 0 reset in 274 ms.
Product exploration explored 100000 steps with 0 reset in 480 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 00:30:31] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:31] [INFO ] Invariant cache hit.
[2024-05-28 00:30:31] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 00:30:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-28 00:30:31] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 00:30:31] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:31] [INFO ] After 39ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-28 00:30:31] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-28 00:30:31] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 134/134 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 84 transition count 129
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 81 transition count 126
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 20 place count 72 transition count 117
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 72 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 38 place count 72 transition count 108
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 69 transition count 111
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 69 transition count 101
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 60 transition count 92
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 60 transition count 92
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 81 place count 60 transition count 83
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 3 with 2 rules applied. Total rules applied 83 place count 59 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 56 transition count 79
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 56 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 92 place count 56 transition count 76
Applied a total of 92 rules in 26 ms. Remains 56 /84 variables (removed 28) and now considering 76/134 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 56/84 places, 76/134 transitions.
Finished random walk after 6743 steps, including 2 resets, run visited all 3 properties in 18 ms. (steps per millisecond=374 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 8 factoid took 177 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Raft-PT-04-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Raft-PT-04-LTLFireability-01 finished in 2152 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((F((G(F(!p1))||(F(!p1)&&X(!p2))))&&p0)))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Applied a total of 4 rules in 8 ms. Remains 84 /86 variables (removed 2) and now considering 134/138 (removed 4) transitions.
[2024-05-28 00:30:31] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:31] [INFO ] Invariant cache hit.
[2024-05-28 00:30:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 00:30:31] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:31] [INFO ] Invariant cache hit.
[2024-05-28 00:30:31] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:31] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-28 00:30:31] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:31] [INFO ] Invariant cache hit.
[2024-05-28 00:30:31] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/86 places, 134/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 84/86 places, 134/138 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) p1), (AND p2 p1), p1]
Running random walk in product with property : Raft-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s76 1)), p1:(AND (EQ s28 1) (EQ s76 1)), p2:(AND (EQ s20 1) (EQ s68 1) (NOT (AND (EQ s28 1) (EQ s76 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 1 steps with 0 reset in 1 ms.
FORMULA Raft-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-02 finished in 428 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((p0 U G((!p1&&F(p2))))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Applied a total of 4 rules in 6 ms. Remains 84 /86 variables (removed 2) and now considering 134/138 (removed 4) transitions.
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:32] [INFO ] Invariant cache hit.
[2024-05-28 00:30:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:32] [INFO ] Invariant cache hit.
[2024-05-28 00:30:32] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:32] [INFO ] Invariant cache hit.
[2024-05-28 00:30:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/86 places, 134/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 84/86 places, 134/138 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : Raft-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s19 1) (EQ s64 1)) (EQ s64 1)), p0:(AND (EQ s51 1) (EQ s68 1)), p2:(AND (EQ s46 1) (EQ s64 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Raft-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-03 finished in 494 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 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 81 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 19 place count 72 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 72 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 37 place count 72 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 68 transition count 118
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 68 transition count 108
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 59 transition count 99
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 59 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 59 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 58 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 55 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 55 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 55 transition count 83
Applied a total of 93 rules in 31 ms. Remains 55 /86 variables (removed 31) and now considering 83/138 (removed 55) transitions.
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 68 transitions (discarded 15 similar events)
// Phase 1: matrix 68 rows 55 cols
[2024-05-28 00:30:32] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 00:30:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 68 transitions (discarded 15 similar events)
[2024-05-28 00:30:32] [INFO ] Invariant cache hit.
[2024-05-28 00:30:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 00:30:32] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-28 00:30:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 68 transitions (discarded 15 similar events)
[2024-05-28 00:30:32] [INFO ] Invariant cache hit.
[2024-05-28 00:30:32] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/86 places, 83/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 55/86 places, 83/138 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Raft-PT-04-LTLFireability-04 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:(OR (EQ s38 0) (EQ s46 0))], 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 34 steps with 0 reset in 0 ms.
FORMULA Raft-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-04 finished in 284 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((p1&&X(G(p2))))))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Applied a total of 4 rules in 2 ms. Remains 84 /86 variables (removed 2) and now considering 134/138 (removed 4) transitions.
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
// Phase 1: matrix 122 rows 84 cols
[2024-05-28 00:30:32] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 00:30:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:32] [INFO ] Invariant cache hit.
[2024-05-28 00:30:32] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:32] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-28 00:30:32] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:32] [INFO ] Invariant cache hit.
[2024-05-28 00:30:32] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/86 places, 134/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 84/86 places, 134/138 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Raft-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s60 0) (EQ s76 0)), p1:(EQ s64 1), p2:(OR (EQ s50 0) (EQ s76 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Raft-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-05 finished in 340 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)||(p1&&X((!p0&&(p2 U (p3||G(p2)))))))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Applied a total of 4 rules in 2 ms. Remains 84 /86 variables (removed 2) and now considering 134/138 (removed 4) transitions.
[2024-05-28 00:30:33] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:33] [INFO ] Invariant cache hit.
[2024-05-28 00:30:33] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 00:30:33] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:33] [INFO ] Invariant cache hit.
[2024-05-28 00:30:33] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:33] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-28 00:30:33] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:33] [INFO ] Invariant cache hit.
[2024-05-28 00:30:33] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/86 places, 134/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 84/86 places, 134/138 transitions.
Stuttering acceptance computed with spot in 268 ms :[p0, p0, (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : Raft-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s67 1) (AND (EQ s60 1) (EQ s76 1))), p0:(AND (EQ s60 1) (EQ s76 1)), p3:(NEQ s67 1), p2:(OR (AND (EQ s60 1) (EQ s76 1)) (EQ s67 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Raft-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-06 finished in 489 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((!p0 U (G(p0)||(X((p2||X(X(p3))))&&p1)))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Applied a total of 4 rules in 4 ms. Remains 84 /86 variables (removed 2) and now considering 134/138 (removed 4) transitions.
[2024-05-28 00:30:33] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:33] [INFO ] Invariant cache hit.
[2024-05-28 00:30:33] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 00:30:33] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:33] [INFO ] Invariant cache hit.
[2024-05-28 00:30:33] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:33] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-28 00:30:33] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:33] [INFO ] Invariant cache hit.
[2024-05-28 00:30:33] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/86 places, 134/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 84/86 places, 134/138 transitions.
Stuttering acceptance computed with spot in 1143 ms :[(NOT p0), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : Raft-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 10}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 16}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 15}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 16}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 15}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={} source=10 dest: 16}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=11 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={0} source=11 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=12 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=12 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=12 dest: 17}, { cond=(AND (NOT p0) p1), acceptance={0} source=12 dest: 19}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=13 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=13 dest: 14}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=14 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=14 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=14 dest: 18}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=14 dest: 20}], [{ cond=(NOT p3), acceptance={} source=15 dest: 16}], [{ cond=(NOT p3), acceptance={} source=16 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=17 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=17 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=17 dest: 11}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=17 dest: 13}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=18 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=18 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=18 dest: 17}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=18 dest: 19}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=19 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=19 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=19 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=19 dest: 14}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=20 dest: 6}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=20 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=20 dest: 18}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=20 dest: 20}]], initial=9, aps=[p0:(AND (EQ s39 1) (EQ s68 1)), p2:(AND (EQ s78 1) (EQ s81 1)), p3:(AND (EQ s50 1) (EQ s76 1)), p1:(AND (EQ s50 1) (EQ s76 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, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 1 ms.
FORMULA Raft-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-07 finished in 1448 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(p1)||p0)))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 81 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 19 place count 72 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 72 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 37 place count 72 transition count 113
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 69 transition count 117
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 69 transition count 109
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 63 transition count 103
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 63 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 69 place count 63 transition count 97
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 2 with 2 rules applied. Total rules applied 71 place count 62 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 59 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 59 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 59 transition count 90
Applied a total of 80 rules in 22 ms. Remains 59 /86 variables (removed 27) and now considering 90/138 (removed 48) transitions.
[2024-05-28 00:30:35] [INFO ] Flow matrix only has 75 transitions (discarded 15 similar events)
// Phase 1: matrix 75 rows 59 cols
[2024-05-28 00:30:35] [INFO ] Computed 16 invariants in 0 ms
[2024-05-28 00:30:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 00:30:35] [INFO ] Flow matrix only has 75 transitions (discarded 15 similar events)
[2024-05-28 00:30:35] [INFO ] Invariant cache hit.
[2024-05-28 00:30:35] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 00:30:35] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-28 00:30:35] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 00:30:35] [INFO ] Flow matrix only has 75 transitions (discarded 15 similar events)
[2024-05-28 00:30:35] [INFO ] Invariant cache hit.
[2024-05-28 00:30:35] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/86 places, 90/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 59/86 places, 90/138 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Raft-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s52 1)), p0:(OR (EQ s46 1) (AND (EQ s9 1) (EQ s52 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Raft-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-08 finished in 365 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((p0||G((p1 U p2))))||G(p3)))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 136
Applied a total of 2 rules in 2 ms. Remains 85 /86 variables (removed 1) and now considering 136/138 (removed 2) transitions.
[2024-05-28 00:30:35] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
// Phase 1: matrix 123 rows 85 cols
[2024-05-28 00:30:35] [INFO ] Computed 16 invariants in 3 ms
[2024-05-28 00:30:35] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 00:30:35] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
[2024-05-28 00:30:35] [INFO ] Invariant cache hit.
[2024-05-28 00:30:35] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:35] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-28 00:30:35] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
[2024-05-28 00:30:35] [INFO ] Invariant cache hit.
[2024-05-28 00:30:35] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 136/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 85/86 places, 136/138 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Raft-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(OR (AND p3 (NOT p0) p2) (AND p3 (NOT p0) p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 3}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(OR (EQ s77 0) (EQ s51 0) (EQ s68 0)), p0:(AND (EQ s60 1) (EQ s77 1)), p2:(AND (EQ s73 1) (EQ s84 1)), p1:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p3 (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p0) p2) (AND p3 (NOT p0) p1)))), true, (X (X (OR p2 p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (OR (AND p3 p2) (AND p3 p1)))), (X (X (NOT (OR (AND p3 p2) (AND p3 p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 23 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Raft-PT-04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Raft-PT-04-LTLFireability-09 finished in 1253 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(((p0 U p1)&&X((F(G(p2)) U p3))))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 136
Applied a total of 2 rules in 2 ms. Remains 85 /86 variables (removed 1) and now considering 136/138 (removed 2) transitions.
[2024-05-28 00:30:36] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
[2024-05-28 00:30:36] [INFO ] Invariant cache hit.
[2024-05-28 00:30:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 00:30:36] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
[2024-05-28 00:30:36] [INFO ] Invariant cache hit.
[2024-05-28 00:30:36] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:36] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-28 00:30:36] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
[2024-05-28 00:30:36] [INFO ] Invariant cache hit.
[2024-05-28 00:30:36] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 136/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 85/86 places, 136/138 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), true, (NOT p1), (NOT p3), (NOT p2)]
Running random walk in product with property : Raft-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(NOT p3), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s75 1) (EQ s84 1)), p0:(AND (EQ s59 1) (EQ s72 1)), p3:(NEQ s75 1), p2:(NEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Raft-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-10 finished in 515 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(G(p0))||G(F(p1))||G(p2))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 136
Applied a total of 2 rules in 4 ms. Remains 85 /86 variables (removed 1) and now considering 136/138 (removed 2) transitions.
[2024-05-28 00:30:37] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
// Phase 1: matrix 123 rows 85 cols
[2024-05-28 00:30:37] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 00:30:37] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 00:30:37] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
[2024-05-28 00:30:37] [INFO ] Invariant cache hit.
[2024-05-28 00:30:37] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:37] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-28 00:30:37] [INFO ] Flow matrix only has 123 transitions (discarded 13 similar events)
[2024-05-28 00:30:37] [INFO ] Invariant cache hit.
[2024-05-28 00:30:37] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 136/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 85/86 places, 136/138 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Raft-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(AND (EQ s64 1) (EQ s78 1)), p0:(AND (EQ s9 1) (EQ s73 1)), p1:(EQ s71 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 9 steps with 0 reset in 0 ms.
FORMULA Raft-PT-04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-11 finished in 429 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(G(p2))||p1))||p0)))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Applied a total of 4 rules in 3 ms. Remains 84 /86 variables (removed 2) and now considering 134/138 (removed 4) transitions.
[2024-05-28 00:30:37] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
// Phase 1: matrix 122 rows 84 cols
[2024-05-28 00:30:37] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 00:30:37] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 00:30:37] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:37] [INFO ] Invariant cache hit.
[2024-05-28 00:30:37] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:37] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-28 00:30:37] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:37] [INFO ] Invariant cache hit.
[2024-05-28 00:30:37] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/86 places, 134/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 84/86 places, 134/138 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Raft-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s64 0)), p1:(OR (EQ s57 0) (EQ s72 0)), p2:(OR (EQ s15 0) (EQ s64 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 26 reset in 1 ms.
FORMULA Raft-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-12 finished in 459 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)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Applied a total of 4 rules in 2 ms. Remains 84 /86 variables (removed 2) and now considering 134/138 (removed 4) transitions.
[2024-05-28 00:30:38] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:38] [INFO ] Invariant cache hit.
[2024-05-28 00:30:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-28 00:30:38] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:38] [INFO ] Invariant cache hit.
[2024-05-28 00:30:38] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 00:30:38] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-28 00:30:38] [INFO ] Flow matrix only has 122 transitions (discarded 12 similar events)
[2024-05-28 00:30:38] [INFO ] Invariant cache hit.
[2024-05-28 00:30:38] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/86 places, 134/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 84/86 places, 134/138 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Raft-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s45 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Raft-PT-04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-14 finished in 300 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' '!((!p0 U (G(!p0)||(!p0&&G((!p1&&(p2||F(!p0))))))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 81 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 19 place count 72 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 72 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 37 place count 72 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 68 transition count 118
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 68 transition count 109
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 63 place count 59 transition count 100
Iterating global reduction 1 with 9 rules applied. Total rules applied 72 place count 59 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 81 place count 59 transition count 91
Applied a total of 81 rules in 25 ms. Remains 59 /86 variables (removed 27) and now considering 91/138 (removed 47) transitions.
[2024-05-28 00:30:38] [INFO ] Flow matrix only has 76 transitions (discarded 15 similar events)
// Phase 1: matrix 76 rows 59 cols
[2024-05-28 00:30:38] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 00:30:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 00:30:38] [INFO ] Flow matrix only has 76 transitions (discarded 15 similar events)
[2024-05-28 00:30:38] [INFO ] Invariant cache hit.
[2024-05-28 00:30:38] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 00:30:38] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-28 00:30:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 00:30:38] [INFO ] Flow matrix only has 76 transitions (discarded 15 similar events)
[2024-05-28 00:30:38] [INFO ] Invariant cache hit.
[2024-05-28 00:30:38] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/86 places, 91/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 59/86 places, 91/138 transitions.
Stuttering acceptance computed with spot in 230 ms :[p0, true, (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR p1 (AND p0 (NOT p2)))]
Running random walk in product with property : Raft-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s17 1) (EQ s48 1)) (EQ s46 1)), p0:(AND (EQ s17 1) (EQ s48 1)), p2:(NEQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Raft-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Raft-PT-04-LTLFireability-15 finished in 435 ms.
All properties solved by simple procedures.
Total runtime 12479 ms.

BK_STOP 1716856239844

--------------------
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="Raft-PT-04"
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 Raft-PT-04, 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 r329-tall-171662361900263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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