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.r109-tall-171624208500393.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 DES-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 08:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 08:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716332445834

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=DES-PT-01b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 23:00:47] [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-21 23:00:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:00:47] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-21 23:00:47] [INFO ] Transformed 284 places.
[2024-05-21 23:00:47] [INFO ] Transformed 235 transitions.
[2024-05-21 23:00:47] [INFO ] Found NUPN structural information;
[2024-05-21 23:00:47] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 192 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.
FORMULA DES-PT-01b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 260 transition count 214
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 260 transition count 214
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 249 transition count 203
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 249 transition count 203
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 75 place count 249 transition count 195
Applied a total of 75 rules in 56 ms. Remains 249 /284 variables (removed 35) and now considering 195/235 (removed 40) transitions.
// Phase 1: matrix 195 rows 249 cols
[2024-05-21 23:00:47] [INFO ] Computed 62 invariants in 26 ms
[2024-05-21 23:00:48] [INFO ] Implicit Places using invariants in 275 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 301 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/284 places, 195/235 transitions.
Applied a total of 0 rules in 12 ms. Remains 247 /247 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 369 ms. Remains : 247/284 places, 195/235 transitions.
Support contains 30 out of 247 places after structural reductions.
[2024-05-21 23:00:48] [INFO ] Flatten gal took : 40 ms
[2024-05-21 23:00:48] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:00:48] [INFO ] Input system was already deterministic with 195 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished Best-First random walk after 8585 steps, including 12 resets, run visited all 2 properties in 23 ms. (steps per millisecond=373 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DES-PT-01b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-01b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 53 stabilizing places and 49 stable transitions
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 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(p0))||G((F(p1) U X(p2)))))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 15 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-21 23:00:49] [INFO ] Computed 60 invariants in 8 ms
[2024-05-21 23:00:49] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-21 23:00:49] [INFO ] Invariant cache hit.
[2024-05-21 23:00:49] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-21 23:00:49] [INFO ] Invariant cache hit.
[2024-05-21 23:00:49] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 236/247 places, 178/195 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 395 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-01b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(EQ s78 1), p0:(EQ s78 0), p2:(EQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1141 reset in 328 ms.
Product exploration explored 100000 steps with 1135 reset in 258 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Detected a total of 51/236 stabilizing places and 47/178 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 106 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:00:51] [INFO ] Invariant cache hit.
[2024-05-21 23:00:51] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:00:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:00:51] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 7 ms returned sat
[2024-05-21 23:00:51] [INFO ] After 60ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 685 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 178/178 transitions.
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 230 transition count 158
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 214 transition count 158
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 33 place count 214 transition count 145
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 201 transition count 145
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 203 place count 129 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 127 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 125 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 211 place count 123 transition count 73
Applied a total of 211 rules in 59 ms. Remains 123 /236 variables (removed 113) and now considering 73/178 (removed 105) transitions.
// Phase 1: matrix 73 rows 123 cols
[2024-05-21 23:00:52] [INFO ] Computed 56 invariants in 5 ms
[2024-05-21 23:00:52] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:00:52] [INFO ] Invariant cache hit.
[2024-05-21 23:00:52] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [7, 31, 35, 40, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 118]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 207 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/236 places, 73/178 transitions.
Graph (complete) has 237 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 98 transition count 61
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 89 transition count 61
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 65 transition count 51
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 0 with 2 rules applied. Total rules applied 55 place count 64 transition count 50
Applied a total of 55 rules in 9 ms. Remains 64 /102 variables (removed 38) and now considering 50/73 (removed 23) transitions.
// Phase 1: matrix 50 rows 64 cols
[2024-05-21 23:00:52] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 23:00:52] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 23:00:52] [INFO ] Invariant cache hit.
[2024-05-21 23:00:52] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/236 places, 50/178 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 49
Applied a total of 2 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 49/50 (removed 1) transitions.
// Phase 1: matrix 49 rows 62 cols
[2024-05-21 23:00:52] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 23:00:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 23:00:52] [INFO ] Invariant cache hit.
[2024-05-21 23:00:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:00:52] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 62/236 places, 49/178 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 514 ms. Remains : 62/236 places, 49/178 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Detected a total of 10/62 stabilizing places and 9/49 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 167 steps, including 16 resets, run visited all 2 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8498 reset in 176 ms.
Product exploration explored 100000 steps with 8474 reset in 253 ms.
Built C files in :
/tmp/ltsmin13248003273718607791
[2024-05-21 23:00:54] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2024-05-21 23:00:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:54] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2024-05-21 23:00:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:54] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2024-05-21 23:00:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:54] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13248003273718607791
Running compilation step : cd /tmp/ltsmin13248003273718607791;'/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 246 ms.
Running link step : cd /tmp/ltsmin13248003273718607791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13248003273718607791;'/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/stateBased9892342563163027308.hoa' '--buchi-type=spotba'
LTSmin run took 282 ms.
FORMULA DES-PT-01b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-00 finished in 5405 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)))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 14 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-21 23:00:54] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 23:00:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 23:00:54] [INFO ] Invariant cache hit.
[2024-05-21 23:00:55] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-21 23:00:55] [INFO ] Invariant cache hit.
[2024-05-21 23:00:55] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s125 0) (EQ s153 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-01b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-02 finished in 747 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)))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 241 transition count 173
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 223 transition count 173
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 223 transition count 160
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 210 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 205 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 205 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 205 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 204 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 204 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 203 transition count 149
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 201 transition count 147
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 201 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 201 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 87 place count 201 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 200 transition count 144
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 233 place count 128 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 239 place count 125 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 123 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 122 transition count 78
Applied a total of 242 rules in 45 ms. Remains 122 /247 variables (removed 125) and now considering 78/195 (removed 117) transitions.
// Phase 1: matrix 78 rows 122 cols
[2024-05-21 23:00:55] [INFO ] Computed 57 invariants in 1 ms
[2024-05-21 23:00:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 23:00:55] [INFO ] Invariant cache hit.
[2024-05-21 23:00:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:00:55] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [7, 31, 35, 39, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 117]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 243 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/247 places, 78/195 transitions.
Graph (complete) has 263 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 100 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 90 transition count 67
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 53 place count 67 transition count 56
Applied a total of 53 rules in 16 ms. Remains 67 /104 variables (removed 37) and now considering 56/78 (removed 22) transitions.
// Phase 1: matrix 56 rows 67 cols
[2024-05-21 23:00:55] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 23:00:55] [INFO ] Implicit Places using invariants in 46 ms returned [37, 41, 44, 47, 53, 56]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 47 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/247 places, 56/195 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 60 transition count 54
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 4 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 58 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 58 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 57 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 57 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 55 transition count 49
Applied a total of 12 rules in 9 ms. Remains 55 /61 variables (removed 6) and now considering 49/56 (removed 7) transitions.
// Phase 1: matrix 49 rows 55 cols
[2024-05-21 23:00:55] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 23:00:55] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 23:00:55] [INFO ] Invariant cache hit.
[2024-05-21 23:00:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:00:56] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/247 places, 49/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 468 ms. Remains : 55/247 places, 49/195 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-03 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(p0)))'
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 236 transition count 178
Applied a total of 28 rules in 14 ms. Remains 236 /247 variables (removed 11) and now considering 178/195 (removed 17) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-21 23:00:56] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:00:56] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 23:00:56] [INFO ] Invariant cache hit.
[2024-05-21 23:00:56] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-21 23:00:56] [INFO ] Invariant cache hit.
[2024-05-21 23:00:56] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/247 places, 178/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 236/247 places, 178/195 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s78 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 93 steps with 0 reset in 1 ms.
FORMULA DES-PT-01b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-04 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 241 transition count 176
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 226 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 223 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 37 place count 223 transition count 161
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 61 place count 211 transition count 161
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 66 place count 206 transition count 156
Iterating global reduction 3 with 5 rules applied. Total rules applied 71 place count 206 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 75 place count 206 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 205 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 77 place count 205 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 204 transition count 150
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 81 place count 202 transition count 148
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 202 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 85 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 85 place count 202 transition count 145
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 87 place count 201 transition count 145
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 233 place count 128 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 237 place count 126 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 124 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 240 place count 123 transition count 72
Applied a total of 240 rules in 40 ms. Remains 123 /247 variables (removed 124) and now considering 72/195 (removed 123) transitions.
// Phase 1: matrix 72 rows 123 cols
[2024-05-21 23:00:56] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 23:00:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 23:00:56] [INFO ] Invariant cache hit.
[2024-05-21 23:00:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:00:56] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [7, 32, 36, 40, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 118]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 206 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/247 places, 72/195 transitions.
Graph (complete) has 247 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 97 transition count 59
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 87 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 61 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 59 transition count 46
Applied a total of 62 rules in 6 ms. Remains 59 /101 variables (removed 42) and now considering 46/72 (removed 26) transitions.
// Phase 1: matrix 46 rows 59 cols
[2024-05-21 23:00:56] [INFO ] Computed 19 invariants in 2 ms
[2024-05-21 23:00:56] [INFO ] Implicit Places using invariants in 48 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/247 places, 46/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 55 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 55 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 0 with 2 rules applied. Total rules applied 6 place count 54 transition count 42
Applied a total of 6 rules in 4 ms. Remains 54 /57 variables (removed 3) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 54 cols
[2024-05-21 23:00:56] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 23:00:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 23:00:56] [INFO ] Invariant cache hit.
[2024-05-21 23:00:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:00:56] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/247 places, 42/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 419 ms. Remains : 54/247 places, 42/195 transitions.
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s51 0), p1:(OR (EQ s7 0) (EQ s51 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10717 reset in 218 ms.
Product exploration explored 100000 steps with 10736 reset in 165 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 9 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-21 23:00:58] [INFO ] Invariant cache hit.
[2024-05-21 23:00:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 23:00:58] [INFO ] Invariant cache hit.
[2024-05-21 23:00:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:00:58] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-21 23:00:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:00:58] [INFO ] Invariant cache hit.
[2024-05-21 23:00:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 54/54 places, 42/42 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 15 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 10812 reset in 119 ms.
Product exploration explored 100000 steps with 10785 reset in 134 ms.
Built C files in :
/tmp/ltsmin5299902332584307517
[2024-05-21 23:00:59] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2024-05-21 23:00:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:59] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2024-05-21 23:00:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:59] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2024-05-21 23:00:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:59] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5299902332584307517
Running compilation step : cd /tmp/ltsmin5299902332584307517;'/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 143 ms.
Running link step : cd /tmp/ltsmin5299902332584307517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5299902332584307517;'/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/stateBased11316355668966037308.hoa' '--buchi-type=spotba'
LTSmin run took 170 ms.
FORMULA DES-PT-01b-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-05 finished in 3791 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 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 241 transition count 173
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 223 transition count 173
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 223 transition count 160
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 210 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 206 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 206 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 206 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 73 place count 206 transition count 153
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 205 transition count 153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 203 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 203 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 203 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 81 place count 203 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 202 transition count 148
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 227 place count 130 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 127 transition count 91
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 241 place count 127 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 125 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 124 transition count 81
Applied a total of 244 rules in 45 ms. Remains 124 /247 variables (removed 123) and now considering 81/195 (removed 114) transitions.
// Phase 1: matrix 81 rows 124 cols
[2024-05-21 23:01:00] [INFO ] Computed 57 invariants in 3 ms
[2024-05-21 23:01:00] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 23:01:00] [INFO ] Invariant cache hit.
[2024-05-21 23:01:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:01:00] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [7, 38, 42, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 98, 119]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 215 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/247 places, 81/195 transitions.
Graph (complete) has 255 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 99 transition count 68
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 89 transition count 68
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 64 transition count 57
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 62 transition count 56
Applied a total of 60 rules in 6 ms. Remains 62 /103 variables (removed 41) and now considering 56/81 (removed 25) transitions.
// Phase 1: matrix 56 rows 62 cols
[2024-05-21 23:01:00] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 23:01:00] [INFO ] Implicit Places using invariants in 48 ms returned [48, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/247 places, 56/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 53
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 0 with 2 rules applied. Total rules applied 6 place count 57 transition count 52
Applied a total of 6 rules in 4 ms. Remains 57 /60 variables (removed 3) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 57 cols
[2024-05-21 23:01:00] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 23:01:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 23:01:00] [INFO ] Invariant cache hit.
[2024-05-21 23:01:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:01:00] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 57/247 places, 52/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 423 ms. Remains : 57/247 places, 52/195 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-06 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 (NEQ s6 1) (NEQ s33 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]]
Product exploration explored 100000 steps with 9886 reset in 148 ms.
Product exploration explored 100000 steps with 9916 reset in 156 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-21 23:01:01] [INFO ] Invariant cache hit.
[2024-05-21 23:01:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 23:01:01] [INFO ] Invariant cache hit.
[2024-05-21 23:01:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:01:01] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-21 23:01:01] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 23:01:01] [INFO ] Invariant cache hit.
[2024-05-21 23:01:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 57/57 places, 52/52 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 91 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 441 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9930 reset in 141 ms.
Product exploration explored 100000 steps with 9921 reset in 152 ms.
Built C files in :
/tmp/ltsmin8068566446575274850
[2024-05-21 23:01:02] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-21 23:01:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:02] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-21 23:01:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:02] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-21 23:01:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8068566446575274850
Running compilation step : cd /tmp/ltsmin8068566446575274850;'/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 153 ms.
Running link step : cd /tmp/ltsmin8068566446575274850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8068566446575274850;'/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/stateBased7636081744197458376.hoa' '--buchi-type=spotba'
LTSmin run took 976 ms.
FORMULA DES-PT-01b-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-06 finished in 3757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0))||F(p1))&&(!p0||X((X(G(p2)) U (!p0&&X(G(p2)))))))))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 240 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 237 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 237 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 237 transition count 179
Applied a total of 26 rules in 15 ms. Remains 237 /247 variables (removed 10) and now considering 179/195 (removed 16) transitions.
// Phase 1: matrix 179 rows 237 cols
[2024-05-21 23:01:04] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 23:01:04] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 23:01:04] [INFO ] Invariant cache hit.
[2024-05-21 23:01:04] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-21 23:01:04] [INFO ] Invariant cache hit.
[2024-05-21 23:01:04] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/247 places, 179/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 237/247 places, 179/195 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s232 1), p1:(EQ s40 1), p2:(AND (EQ s103 1) (EQ s203 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 8911 reset in 97 ms.
Product exploration explored 100000 steps with 8949 reset in 102 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 417 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/237 stabilizing places and 48/179 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 264 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-21 23:01:06] [INFO ] Invariant cache hit.
[2024-05-21 23:01:06] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:01:06] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 24 ms returned sat
[2024-05-21 23:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:01:06] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-05-21 23:01:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:01:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:01:06] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 16 ms returned sat
[2024-05-21 23:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:01:06] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-05-21 23:01:06] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
[2024-05-21 23:01:07] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:01:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-21 23:01:07] [INFO ] Computed and/alt/rep : 177/290/177 causal constraints (skipped 1 transitions) in 10 ms.
[2024-05-21 23:01:07] [INFO ] Added : 134 causal constraints over 27 iterations in 600 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 237 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 237 /237 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 23:01:07] [INFO ] Invariant cache hit.
[2024-05-21 23:01:07] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 23:01:07] [INFO ] Invariant cache hit.
[2024-05-21 23:01:07] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-21 23:01:07] [INFO ] Invariant cache hit.
[2024-05-21 23:01:08] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 237/237 places, 179/179 transitions.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 417 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/237 stabilizing places and 48/179 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-21 23:01:09] [INFO ] Invariant cache hit.
[2024-05-21 23:01:09] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:01:09] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 24 ms returned sat
[2024-05-21 23:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:01:09] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-05-21 23:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:01:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-21 23:01:09] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-21 23:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:01:09] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-05-21 23:01:09] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:01:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-05-21 23:01:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2024-05-21 23:01:09] [INFO ] Computed and/alt/rep : 177/290/177 causal constraints (skipped 1 transitions) in 12 ms.
[2024-05-21 23:01:10] [INFO ] Added : 134 causal constraints over 27 iterations in 593 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8927 reset in 96 ms.
Product exploration explored 100000 steps with 8928 reset in 110 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 179/179 transitions.
Graph (complete) has 417 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 232 transition count 176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 17 place count 232 transition count 179
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 232 transition count 179
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 226 transition count 173
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 226 transition count 173
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 114 place count 226 transition count 176
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 122 place count 218 transition count 168
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 130 place count 218 transition count 168
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 135 place count 218 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 216 transition count 188
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 216 transition count 188
Deduced a syphon composed of 90 places in 1 ms
Applied a total of 139 rules in 56 ms. Remains 216 /237 variables (removed 21) and now considering 188/179 (removed -9) transitions.
[2024-05-21 23:01:11] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 188 rows 216 cols
[2024-05-21 23:01:11] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:01:11] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 216/237 places, 188/179 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 216/237 places, 188/179 transitions.
Built C files in :
/tmp/ltsmin10618628848231354405
[2024-05-21 23:01:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10618628848231354405
Running compilation step : cd /tmp/ltsmin10618628848231354405;'/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 281 ms.
Running link step : cd /tmp/ltsmin10618628848231354405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10618628848231354405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9661300442903769097.hoa' '--buchi-type=spotba'
LTSmin run took 7222 ms.
FORMULA DES-PT-01b-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-07 finished in 15041 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 p1))) U ((p2||G(p3)) U X(p0))))'
Support contains 5 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 240 transition count 186
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 237 transition count 183
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 237 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 237 transition count 180
Applied a total of 25 rules in 19 ms. Remains 237 /247 variables (removed 10) and now considering 180/195 (removed 15) transitions.
// Phase 1: matrix 180 rows 237 cols
[2024-05-21 23:01:19] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 23:01:19] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:01:19] [INFO ] Invariant cache hit.
[2024-05-21 23:01:19] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 23:01:19] [INFO ] Invariant cache hit.
[2024-05-21 23:01:19] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/247 places, 180/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 237/247 places, 180/195 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DES-PT-01b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(OR p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s67 1), p3:(EQ s137 1), p0:(AND (EQ s38 1) (EQ s219 1)), p1:(EQ s232 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 75 steps with 0 reset in 2 ms.
FORMULA DES-PT-01b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-08 finished in 749 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(F(p1))))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 240 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 238 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 238 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 238 transition count 181
Applied a total of 23 rules in 16 ms. Remains 238 /247 variables (removed 9) and now considering 181/195 (removed 14) transitions.
// Phase 1: matrix 181 rows 238 cols
[2024-05-21 23:01:19] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:01:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 23:01:19] [INFO ] Invariant cache hit.
[2024-05-21 23:01:20] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-21 23:01:20] [INFO ] Invariant cache hit.
[2024-05-21 23:01:20] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/247 places, 181/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 238/247 places, 181/195 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-01b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s113 1), p1:(OR (EQ s113 1) (EQ s76 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1098 reset in 167 ms.
Product exploration explored 100000 steps with 1086 reset in 175 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 421 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:01:21] [INFO ] Invariant cache hit.
[2024-05-21 23:01:21] [INFO ] After 42ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 6 factoid took 189 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Graph (complete) has 421 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 232 transition count 160
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 215 transition count 160
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 215 transition count 147
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 202 transition count 147
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 207 place count 129 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 127 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 125 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 215 place count 123 transition count 74
Applied a total of 215 rules in 21 ms. Remains 123 /238 variables (removed 115) and now considering 74/181 (removed 107) transitions.
// Phase 1: matrix 74 rows 123 cols
[2024-05-21 23:01:21] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 23:01:21] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 23:01:21] [INFO ] Invariant cache hit.
[2024-05-21 23:01:22] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [7, 36, 40, 61, 63, 65, 67, 69, 71, 73, 75, 97, 118]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 174 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/238 places, 74/181 transitions.
Graph (complete) has 261 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 106 transition count 62
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 26 place count 90 transition count 62
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 62 place count 65 transition count 51
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 63 transition count 50
Applied a total of 65 rules in 7 ms. Remains 63 /110 variables (removed 47) and now considering 50/74 (removed 24) transitions.
// Phase 1: matrix 50 rows 63 cols
[2024-05-21 23:01:22] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 23:01:22] [INFO ] Implicit Places using invariants in 41 ms returned [49, 52]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/238 places, 50/181 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 59 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 59 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 0 with 2 rules applied. Total rules applied 6 place count 58 transition count 46
Applied a total of 6 rules in 4 ms. Remains 58 /61 variables (removed 3) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 58 cols
[2024-05-21 23:01:22] [INFO ] Computed 18 invariants in 0 ms
[2024-05-21 23:01:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 23:01:22] [INFO ] Invariant cache hit.
[2024-05-21 23:01:22] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 58/238 places, 46/181 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 342 ms. Remains : 58/238 places, 46/181 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Incomplete random walk after 10000 steps, including 1079 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 210 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:01:22] [INFO ] Invariant cache hit.
[2024-05-21 23:01:22] [INFO ] After 25ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 278 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 638 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 10848 reset in 139 ms.
Product exploration explored 100000 steps with 10741 reset in 147 ms.
Built C files in :
/tmp/ltsmin4886109352022944487
[2024-05-21 23:01:24] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2024-05-21 23:01:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:24] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2024-05-21 23:01:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:24] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2024-05-21 23:01:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4886109352022944487
Running compilation step : cd /tmp/ltsmin4886109352022944487;'/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 148 ms.
Running link step : cd /tmp/ltsmin4886109352022944487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4886109352022944487;'/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/stateBased2547302729786576042.hoa' '--buchi-type=spotba'
LTSmin run took 545 ms.
FORMULA DES-PT-01b-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-09 finished in 5229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(X(F(p1))))))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 241 transition count 189
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 241 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 241 transition count 187
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 238 transition count 184
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 238 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 238 transition count 181
Applied a total of 23 rules in 11 ms. Remains 238 /247 variables (removed 9) and now considering 181/195 (removed 14) transitions.
// Phase 1: matrix 181 rows 238 cols
[2024-05-21 23:01:25] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 23:01:25] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 23:01:25] [INFO ] Invariant cache hit.
[2024-05-21 23:01:25] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-21 23:01:25] [INFO ] Invariant cache hit.
[2024-05-21 23:01:25] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/247 places, 181/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 238/247 places, 181/195 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s206 0), p1:(OR (EQ s20 0) (EQ s51 0) (EQ s206 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1094 reset in 156 ms.
Product exploration explored 100000 steps with 1096 reset in 163 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/238 stabilizing places and 48/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 9694 steps, including 97 resets, run visited all 2 properties in 24 ms. (steps per millisecond=403 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2024-05-21 23:01:27] [INFO ] Invariant cache hit.
[2024-05-21 23:01:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 23:01:27] [INFO ] Invariant cache hit.
[2024-05-21 23:01:27] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-21 23:01:27] [INFO ] Invariant cache hit.
[2024-05-21 23:01:27] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 238/238 places, 181/181 transitions.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Detected a total of 52/238 stabilizing places and 48/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 732 steps, including 6 resets, run visited all 2 properties in 6 ms. (steps per millisecond=122 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 281 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 683 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1081 reset in 149 ms.
Product exploration explored 100000 steps with 1090 reset in 173 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Graph (complete) has 420 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 233 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 19 place count 233 transition count 180
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 29 place count 233 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 226 transition count 173
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 226 transition count 173
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 115 place count 226 transition count 174
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 124 place count 217 transition count 165
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 133 place count 217 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 139 place count 217 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 215 transition count 183
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 215 transition count 183
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 143 rules in 23 ms. Remains 215 /238 variables (removed 23) and now considering 183/181 (removed -2) transitions.
[2024-05-21 23:01:29] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 183 rows 215 cols
[2024-05-21 23:01:29] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 23:01:29] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 215/238 places, 183/181 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 215/238 places, 183/181 transitions.
Built C files in :
/tmp/ltsmin16498770328822984881
[2024-05-21 23:01:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16498770328822984881
Running compilation step : cd /tmp/ltsmin16498770328822984881;'/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 281 ms.
Running link step : cd /tmp/ltsmin16498770328822984881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16498770328822984881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16484850160134091083.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 238 cols
[2024-05-21 23:01:45] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 23:01:45] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:01:45] [INFO ] Invariant cache hit.
[2024-05-21 23:01:45] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-21 23:01:45] [INFO ] Invariant cache hit.
[2024-05-21 23:01:45] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 238/238 places, 181/181 transitions.
Built C files in :
/tmp/ltsmin3012500760050799591
[2024-05-21 23:01:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3012500760050799591
Running compilation step : cd /tmp/ltsmin3012500760050799591;'/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 289 ms.
Running link step : cd /tmp/ltsmin3012500760050799591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3012500760050799591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11854314531559960889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:02:00] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:02:00] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:02:00] [INFO ] Time to serialize gal into /tmp/LTL1335482349319462026.gal : 4 ms
[2024-05-21 23:02:00] [INFO ] Time to serialize properties into /tmp/LTL15458810703943161541.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1335482349319462026.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10070272354548242097.hoa' '-atoms' '/tmp/LTL15458810703943161541.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15458810703943161541.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10070272354548242097.hoa
Detected timeout of ITS tools.
[2024-05-21 23:02:15] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:02:15] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:02:15] [INFO ] Time to serialize gal into /tmp/LTL10479729034993140769.gal : 2 ms
[2024-05-21 23:02:15] [INFO ] Time to serialize properties into /tmp/LTL10251006793852007277.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10479729034993140769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10251006793852007277.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p249==0)")||(X(X(F("(((p25==0)||(p79==0))||(p249==0))")))))))))
Formula 0 simplified : XXF(!"(p249==0)" & XXG!"(((p25==0)||(p79==0))||(p249==0))")
Detected timeout of ITS tools.
[2024-05-21 23:02:30] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:02:30] [INFO ] Applying decomposition
[2024-05-21 23:02:30] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10747456163510765147.txt' '-o' '/tmp/graph10747456163510765147.bin' '-w' '/tmp/graph10747456163510765147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10747456163510765147.bin' '-l' '-1' '-v' '-w' '/tmp/graph10747456163510765147.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:02:30] [INFO ] Decomposing Gal with order
[2024-05-21 23:02:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:02:31] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 23:02:31] [INFO ] Flatten gal took : 60 ms
[2024-05-21 23:02:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-21 23:02:31] [INFO ] Time to serialize gal into /tmp/LTL9014531844449299480.gal : 5 ms
[2024-05-21 23:02:31] [INFO ] Time to serialize properties into /tmp/LTL16651644592981658170.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9014531844449299480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16651644592981658170.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i6.u64.p249==0)")||(X(X(F("(((i3.u6.p25==0)||(i3.u18.p79==0))||(i6.u64.p249==0))")))))))))
Formula 0 simplified : XXF(!"(i6.u64.p249==0)" & XXG!"(((i3.u6.p25==0)||(i3.u18.p79==0))||(i6.u64.p249==0))")
Reverse transition relation is NOT exact ! Due to transitions t0, t51, t53, t55, t63, t90, t103, t128, t143, t188, i0.i1.u29.t80, i1.u7.t132, i1.u7.t133, i...707
Computing Next relation with stutter on 15407 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2820039992219034158
[2024-05-21 23:02:46] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2820039992219034158
Running compilation step : cd /tmp/ltsmin2820039992219034158;'/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 287 ms.
Running link step : cd /tmp/ltsmin2820039992219034158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2820039992219034158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-01b-LTLFireability-10 finished in 96160 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)&&(p0||G(p1)))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 241 transition count 189
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 241 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 241 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 239 transition count 184
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 239 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 239 transition count 182
Applied a total of 21 rules in 11 ms. Remains 239 /247 variables (removed 8) and now considering 182/195 (removed 13) transitions.
// Phase 1: matrix 182 rows 239 cols
[2024-05-21 23:03:01] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:03:01] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:03:01] [INFO ] Invariant cache hit.
[2024-05-21 23:03:01] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-21 23:03:01] [INFO ] Invariant cache hit.
[2024-05-21 23:03:01] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/247 places, 182/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 239/247 places, 182/195 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s23 0), p0:(EQ s44 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 422 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 52 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-01b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-11 finished in 855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 241 transition count 174
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 224 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 224 transition count 161
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 211 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 206 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 206 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 206 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 205 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 205 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 204 transition count 150
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 202 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 202 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 85 place count 202 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 201 transition count 145
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 231 place count 129 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 237 place count 126 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 124 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 123 transition count 79
Applied a total of 240 rules in 24 ms. Remains 123 /247 variables (removed 124) and now considering 79/195 (removed 116) transitions.
// Phase 1: matrix 79 rows 123 cols
[2024-05-21 23:03:02] [INFO ] Computed 57 invariants in 1 ms
[2024-05-21 23:03:02] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 23:03:02] [INFO ] Invariant cache hit.
[2024-05-21 23:03:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:03:02] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [7, 32, 36, 40, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 97, 118]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 221 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/247 places, 79/195 transitions.
Graph (complete) has 265 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 102 transition count 68
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 20 place count 91 transition count 68
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 54 place count 68 transition count 57
Applied a total of 54 rules in 3 ms. Remains 68 /106 variables (removed 38) and now considering 57/79 (removed 22) transitions.
// Phase 1: matrix 57 rows 68 cols
[2024-05-21 23:03:02] [INFO ] Computed 24 invariants in 0 ms
[2024-05-21 23:03:02] [INFO ] Implicit Places using invariants in 47 ms returned [38, 42, 45, 48, 54, 57]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 49 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/247 places, 57/195 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 61 transition count 55
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 4 place count 60 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 59 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 58 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 58 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 56 transition count 50
Applied a total of 12 rules in 5 ms. Remains 56 /62 variables (removed 6) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-05-21 23:03:02] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 23:03:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 23:03:02] [INFO ] Invariant cache hit.
[2024-05-21 23:03:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:03:02] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 56/247 places, 50/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 415 ms. Remains : 56/247 places, 50/195 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s18 1), p1:(AND (EQ s38 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA DES-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-12 finished in 564 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(F(p0))||(F(p0)&&(!p1||X(!p0))))))'
Support contains 1 out of 247 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 : 247/247 places, 195/195 transitions.
Graph (complete) has 440 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 241 transition count 174
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 224 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 224 transition count 161
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 211 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 207 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 207 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 207 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 207 transition count 154
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 73 place count 206 transition count 154
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 204 transition count 152
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 204 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 204 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 204 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 203 transition count 149
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 223 place count 132 transition count 78
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 229 place count 129 transition count 93
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 237 place count 129 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 127 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 126 transition count 83
Applied a total of 240 rules in 27 ms. Remains 126 /247 variables (removed 121) and now considering 83/195 (removed 112) transitions.
// Phase 1: matrix 83 rows 126 cols
[2024-05-21 23:03:02] [INFO ] Computed 57 invariants in 1 ms
[2024-05-21 23:03:02] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-21 23:03:02] [INFO ] Invariant cache hit.
[2024-05-21 23:03:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:03:03] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [7, 38, 42, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 98, 121]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 390 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/247 places, 83/195 transitions.
Graph (complete) has 255 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 101 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 91 transition count 70
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 66 transition count 59
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 64 transition count 58
Applied a total of 60 rules in 5 ms. Remains 64 /105 variables (removed 41) and now considering 58/83 (removed 25) transitions.
// Phase 1: matrix 58 rows 64 cols
[2024-05-21 23:03:03] [INFO ] Computed 20 invariants in 0 ms
[2024-05-21 23:03:03] [INFO ] Implicit Places using invariants in 45 ms returned [50, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/247 places, 58/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 55
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 0 with 2 rules applied. Total rules applied 6 place count 59 transition count 54
Applied a total of 6 rules in 6 ms. Remains 59 /62 variables (removed 3) and now considering 54/58 (removed 4) transitions.
// Phase 1: matrix 54 rows 59 cols
[2024-05-21 23:03:03] [INFO ] Computed 18 invariants in 2 ms
[2024-05-21 23:03:03] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 23:03:03] [INFO ] Invariant cache hit.
[2024-05-21 23:03:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:03:03] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 59/247 places, 54/195 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 582 ms. Remains : 59/247 places, 54/195 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s48 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-13 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-13 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(X(F(p1))))))))'
[2024-05-21 23:03:03] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 23:03:03] [INFO ] Applying decomposition
[2024-05-21 23:03:03] [INFO ] Flatten gal took : 9 ms
Built C files in :
/tmp/ltsmin8179743590661174590
[2024-05-21 23:03:03] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2024-05-21 23:03:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:03:03] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2024-05-21 23:03:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:03:03] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2024-05-21 23:03:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:03:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8179743590661174590
Running compilation step : cd /tmp/ltsmin8179743590661174590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17073009133766737894.txt' '-o' '/tmp/graph17073009133766737894.bin' '-w' '/tmp/graph17073009133766737894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17073009133766737894.bin' '-l' '-1' '-v' '-w' '/tmp/graph17073009133766737894.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:03:03] [INFO ] Decomposing Gal with order
[2024-05-21 23:03:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:03:03] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-21 23:03:03] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:03:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 12 ms.
[2024-05-21 23:03:03] [INFO ] Time to serialize gal into /tmp/LTLFireability2201900872690703913.gal : 10 ms
[2024-05-21 23:03:03] [INFO ] Time to serialize properties into /tmp/LTLFireability7818528934007546676.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2201900872690703913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7818528934007546676.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i13.i1.u70.p249==0)")||(X(X(F("(((i4.u7.p25==0)||(i4.u22.p79==0))||(i13.i1.u70.p249==0))")))))))))
Formula 0 simplified : XXF(!"(i13.i1.u70.p249==0)" & XXG!"(((i4.u7.p25==0)||(i4.u22.p79==0))||(i13.i1.u70.p249==0))")
Compilation finished in 363 ms.
Running link step : cd /tmp/ltsmin8179743590661174590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8179743590661174590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t57, t90, t103, t128, t143, t188, i0.i1.u35.t80, i0.i2.u79.t17, i1.i0.u14.t118, i1.i...789
Computing Next relation with stutter on 42323 deadlock states
551 unique states visited
0 strongly connected components in search stack
589 transitions explored
227 items max in DFS search stack
11204 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,112.101,1269660,1,0,3.38852e+06,2346,3598,3.17328e+06,445,16084,2076669
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-01b-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 412775 ms.

BK_STOP 1716332861330

--------------------
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="DES-PT-01b"
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 DES-PT-01b, 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 r109-tall-171624208500393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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