fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r329-tall-171662362400478
Last Updated
July 7, 2024

About the Execution of 2023-gold for RefineWMG-PT-100101

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2121.663 228757.00 478208.00 791.40 FFFFFFFFTFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662362400478.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 RefineWMG-PT-100101, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362400478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 04:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 13 04:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 04:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 13 04:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 218K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716863734847

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=RefineWMG-PT-100101
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:35:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:35:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:35:36] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-28 02:35:36] [INFO ] Transformed 504 places.
[2024-05-28 02:35:36] [INFO ] Transformed 403 transitions.
[2024-05-28 02:35:36] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-100101-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 52 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:35:36] [INFO ] Computed 202 invariants in 15 ms
[2024-05-28 02:35:37] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
[2024-05-28 02:35:37] [INFO ] Invariant cache hit.
[2024-05-28 02:35:37] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-28 02:35:37] [INFO ] Invariant cache hit.
[2024-05-28 02:35:37] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-28 02:35:37] [INFO ] Invariant cache hit.
[2024-05-28 02:35:37] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1393 ms. Remains : 504/504 places, 403/403 transitions.
Support contains 41 out of 504 places after structural reductions.
[2024-05-28 02:35:38] [INFO ] Flatten gal took : 58 ms
[2024-05-28 02:35:38] [INFO ] Flatten gal took : 25 ms
[2024-05-28 02:35:38] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 32) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-28 02:35:38] [INFO ] Invariant cache hit.
[2024-05-28 02:35:38] [INFO ] [Real]Absence check using 202 positive place invariants in 27 ms returned sat
[2024-05-28 02:35:39] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-28 02:35:39] [INFO ] [Nat]Absence check using 202 positive place invariants in 25 ms returned sat
[2024-05-28 02:35:40] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-28 02:35:40] [INFO ] After 1259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 427 ms.
[2024-05-28 02:35:41] [INFO ] After 2098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 16 different solutions.
Finished Parikh walk after 955 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=50 )
Parikh walk visited 18 properties in 400 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 588 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 592 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 594 place count 10 transition count 10
Applied a total of 594 rules in 31 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 02:35:42] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:35:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-28 02:35:42] [INFO ] Invariant cache hit.
[2024-05-28 02:35:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:35:42] [INFO ] Invariant cache hit.
[2024-05-28 02:35:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-28 02:35:42] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 02:35:42] [INFO ] Invariant cache hit.
[2024-05-28 02:35:42] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 10/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 10/504 places, 10/403 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 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s9 1), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1318 steps with 0 reset in 13 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-00 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:35:42] [INFO ] Computed 202 invariants in 3 ms
[2024-05-28 02:35:42] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
[2024-05-28 02:35:42] [INFO ] Invariant cache hit.
[2024-05-28 02:35:42] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-28 02:35:42] [INFO ] Invariant cache hit.
[2024-05-28 02:35:43] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-28 02:35:43] [INFO ] Invariant cache hit.
[2024-05-28 02:35:43] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s72 1) (AND (GEQ s161 1) (GEQ s162 1) (GEQ s164 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1598 ms.
Product exploration explored 100000 steps with 0 reset in 1722 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Finished random walk after 816 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=163 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-100101-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100101-LTLFireability-01 finished in 4715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(F(p1)&&X((p0&&F(p2))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:35:47] [INFO ] Invariant cache hit.
[2024-05-28 02:35:47] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
[2024-05-28 02:35:47] [INFO ] Invariant cache hit.
[2024-05-28 02:35:47] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-28 02:35:47] [INFO ] Invariant cache hit.
[2024-05-28 02:35:47] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-05-28 02:35:47] [INFO ] Invariant cache hit.
[2024-05-28 02:35:48] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LT s55 1), p0:(LT s213 1), p2:(LT s478 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13674 steps with 657 reset in 215 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-02 finished in 1435 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 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 3 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 1 with 291 rules applied. Total rules applied 390 place count 112 transition count 109
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 1 with 92 rules applied. Total rules applied 482 place count 112 transition count 17
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 574 place count 20 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 574 place count 20 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 580 place count 17 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 582 place count 16 transition count 13
Applied a total of 582 rules in 20 ms. Remains 16 /504 variables (removed 488) and now considering 13/403 (removed 390) transitions.
// Phase 1: matrix 13 rows 16 cols
[2024-05-28 02:35:48] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 02:35:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-28 02:35:48] [INFO ] Invariant cache hit.
[2024-05-28 02:35:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:35:48] [INFO ] Invariant cache hit.
[2024-05-28 02:35:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-28 02:35:48] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-28 02:35:48] [INFO ] Invariant cache hit.
[2024-05-28 02:35:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/504 places, 13/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 16/504 places, 13/403 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)), p1:(AND (GEQ s14 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-03 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(p1))) U G(p1)))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 491 place count 108 transition count 12
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 586 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 586 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 590 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 592 place count 10 transition count 9
Applied a total of 592 rules in 14 ms. Remains 10 /504 variables (removed 494) and now considering 9/403 (removed 394) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:35:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 02:35:49] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-28 02:35:49] [INFO ] Invariant cache hit.
[2024-05-28 02:35:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 02:35:49] [INFO ] Invariant cache hit.
[2024-05-28 02:35:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-28 02:35:49] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:35:49] [INFO ] Invariant cache hit.
[2024-05-28 02:35:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 9/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 10/504 places, 9/403 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s5 1), p0:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-04 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:35:49] [INFO ] Computed 202 invariants in 2 ms
[2024-05-28 02:35:49] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
[2024-05-28 02:35:49] [INFO ] Invariant cache hit.
[2024-05-28 02:35:49] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-28 02:35:49] [INFO ] Invariant cache hit.
[2024-05-28 02:35:50] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-05-28 02:35:50] [INFO ] Invariant cache hit.
[2024-05-28 02:35:50] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 967 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s42 1), p0:(LT s433 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1473 ms.
Product exploration explored 100000 steps with 0 reset in 1686 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8674 steps, including 2 resets, run visited all 2 properties in 37 ms. (steps per millisecond=234 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:35:54] [INFO ] Invariant cache hit.
[2024-05-28 02:35:54] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
[2024-05-28 02:35:54] [INFO ] Invariant cache hit.
[2024-05-28 02:35:55] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-28 02:35:55] [INFO ] Invariant cache hit.
[2024-05-28 02:35:55] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-28 02:35:55] [INFO ] Invariant cache hit.
[2024-05-28 02:35:55] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 504/504 places, 403/403 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-28 02:35:56] [INFO ] Invariant cache hit.
[2024-05-28 02:35:56] [INFO ] [Real]Absence check using 202 positive place invariants in 23 ms returned sat
[2024-05-28 02:35:56] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:35:56] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2024-05-28 02:35:56] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:35:56] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-28 02:35:56] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5807 steps, including 0 resets, run visited all 1 properties in 48 ms. (steps per millisecond=120 )
Parikh walk visited 1 properties in 48 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1481 ms.
Product exploration explored 100000 steps with 0 reset in 1650 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 198 place count 308 transition count 208
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 198 rules in 45 ms. Remains 308 /504 variables (removed 196) and now considering 208/403 (removed 195) transitions.
// Phase 1: matrix 208 rows 308 cols
[2024-05-28 02:36:00] [INFO ] Computed 104 invariants in 0 ms
[2024-05-28 02:36:00] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
[2024-05-28 02:36:00] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-28 02:36:00] [INFO ] Invariant cache hit.
[2024-05-28 02:36:00] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 308/504 places, 208/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 349 ms. Remains : 308/504 places, 208/403 transitions.
Built C files in :
/tmp/ltsmin17605733009218661120
[2024-05-28 02:36:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17605733009218661120
Running compilation step : cd /tmp/ltsmin17605733009218661120;'/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 723 ms.
Running link step : cd /tmp/ltsmin17605733009218661120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17605733009218661120;'/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/stateBased5426265371401526019.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:36:15] [INFO ] Computed 202 invariants in 6 ms
[2024-05-28 02:36:16] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
[2024-05-28 02:36:16] [INFO ] Invariant cache hit.
[2024-05-28 02:36:16] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 02:36:16] [INFO ] Invariant cache hit.
[2024-05-28 02:36:16] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-28 02:36:16] [INFO ] Invariant cache hit.
[2024-05-28 02:36:16] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 958 ms. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin2846333769079022103
[2024-05-28 02:36:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2846333769079022103
Running compilation step : cd /tmp/ltsmin2846333769079022103;'/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 600 ms.
Running link step : cd /tmp/ltsmin2846333769079022103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2846333769079022103;'/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/stateBased16890905690550404503.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:36:32] [INFO ] Flatten gal took : 23 ms
[2024-05-28 02:36:32] [INFO ] Flatten gal took : 30 ms
[2024-05-28 02:36:32] [INFO ] Time to serialize gal into /tmp/LTL1767475959689832353.gal : 15 ms
[2024-05-28 02:36:32] [INFO ] Time to serialize properties into /tmp/LTL7111499213779078563.prop : 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/LTL1767475959689832353.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16574889515708990691.hoa' '-atoms' '/tmp/LTL7111499213779078563.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...318
Loading property file /tmp/LTL7111499213779078563.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16574889515708990691.hoa
Detected timeout of ITS tools.
[2024-05-28 02:36:47] [INFO ] Flatten gal took : 18 ms
[2024-05-28 02:36:47] [INFO ] Flatten gal took : 17 ms
[2024-05-28 02:36:47] [INFO ] Time to serialize gal into /tmp/LTL12024973433634845837.gal : 3 ms
[2024-05-28 02:36:47] [INFO ] Time to serialize properties into /tmp/LTL10689185635846797615.ltl : 2 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/LTL12024973433634845837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10689185635846797615.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(G(("(p430<1)")||(X(G("(p39>=1)")))))))
Formula 0 simplified : XF(!"(p430<1)" & XF!"(p39>=1)")
Detected timeout of ITS tools.
[2024-05-28 02:37:02] [INFO ] Flatten gal took : 22 ms
[2024-05-28 02:37:02] [INFO ] Applying decomposition
[2024-05-28 02:37:02] [INFO ] Flatten gal took : 17 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/graph6447291478423535954.txt' '-o' '/tmp/graph6447291478423535954.bin' '-w' '/tmp/graph6447291478423535954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6447291478423535954.bin' '-l' '-1' '-v' '-w' '/tmp/graph6447291478423535954.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:37:02] [INFO ] Decomposing Gal with order
[2024-05-28 02:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:37:02] [INFO ] Flatten gal took : 53 ms
[2024-05-28 02:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-28 02:37:02] [INFO ] Time to serialize gal into /tmp/LTL10641309298488982240.gal : 7 ms
[2024-05-28 02:37:02] [INFO ] Time to serialize properties into /tmp/LTL14507149234676550183.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/LTL10641309298488982240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14507149234676550183.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...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i30.i1.u212.p430<1)")||(X(G("(i3.i1.u20.p39>=1)")))))))
Formula 0 simplified : XF(!"(i30.i1.u212.p430<1)" & XF!"(i3.i1.u20.p39>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7599794789492539884
[2024-05-28 02:37:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7599794789492539884
Running compilation step : cd /tmp/ltsmin7599794789492539884;'/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 601 ms.
Running link step : cd /tmp/ltsmin7599794789492539884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7599794789492539884;'/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([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-100101-LTLFireability-05 finished in 103572 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 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 588 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 592 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 594 place count 10 transition count 10
Applied a total of 594 rules in 12 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 02:37:32] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:37:32] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2024-05-28 02:37:32] [INFO ] Invariant cache hit.
[2024-05-28 02:37:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:37:32] [INFO ] Invariant cache hit.
[2024-05-28 02:37:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-28 02:37:33] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:37:33] [INFO ] Invariant cache hit.
[2024-05-28 02:37:33] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 10/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 10/504 places, 10/403 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-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 (GEQ s5 1) (GEQ s9 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 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
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 97 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-28 02:37:33] [INFO ] Invariant cache hit.
[2024-05-28 02:37:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2024-05-28 02:37:33] [INFO ] Invariant cache hit.
[2024-05-28 02:37:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:37:33] [INFO ] Invariant cache hit.
[2024-05-28 02:37:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-28 02:37:33] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:37:33] [INFO ] Invariant cache hit.
[2024-05-28 02:37:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 10/10 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
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 81 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Product exploration explored 100000 steps with 0 reset in 105 ms.
Built C files in :
/tmp/ltsmin4481845122157925775
[2024-05-28 02:37:34] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-28 02:37:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:37:34] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-28 02:37:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:37:34] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-28 02:37:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:37:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4481845122157925775
Running compilation step : cd /tmp/ltsmin4481845122157925775;'/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 76 ms.
Running link step : cd /tmp/ltsmin4481845122157925775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4481845122157925775;'/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/stateBased16255375569752008058.hoa' '--buchi-type=spotba'
LTSmin run took 560 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-100101-LTLFireability-06 finished in 2393 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&&(p1 U p2)))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:37:35] [INFO ] Computed 202 invariants in 3 ms
[2024-05-28 02:37:35] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
[2024-05-28 02:37:35] [INFO ] Invariant cache hit.
[2024-05-28 02:37:35] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-28 02:37:35] [INFO ] Invariant cache hit.
[2024-05-28 02:37:36] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-28 02:37:36] [INFO ] Invariant cache hit.
[2024-05-28 02:37:36] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s487 1), p1:(GEQ s22 1), p0:(GEQ s222 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 896 ms.
Product exploration explored 100000 steps with 50000 reset in 971 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-100101-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100101-LTLFireability-08 finished in 3159 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)&&(p1||G((p2&&X(p3)))))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:37:38] [INFO ] Invariant cache hit.
[2024-05-28 02:37:38] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
[2024-05-28 02:37:38] [INFO ] Invariant cache hit.
[2024-05-28 02:37:38] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 02:37:38] [INFO ] Invariant cache hit.
[2024-05-28 02:37:39] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-28 02:37:39] [INFO ] Invariant cache hit.
[2024-05-28 02:37:39] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 879 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (OR (AND p1 (NOT p2)) (AND p2 (NOT p3)))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p1 (NOT p2)) (AND p2 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s168 1), p2:(GEQ s392 1), p0:(GEQ s207 1), p3:(GEQ s415 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-09 finished in 1104 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 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 0 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 593 place count 9 transition count 8
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 595 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 7 transition count 7
Applied a total of 597 rules in 10 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 02:37:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 02:37:39] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-28 02:37:39] [INFO ] Invariant cache hit.
[2024-05-28 02:37:39] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:37:39] [INFO ] Invariant cache hit.
[2024-05-28 02:37:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 02:37:39] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:37:39] [INFO ] Invariant cache hit.
[2024-05-28 02:37:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-10 finished in 167 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((X(p0)||G(p1)))&&F(p1)))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:37:39] [INFO ] Computed 202 invariants in 4 ms
[2024-05-28 02:37:39] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
[2024-05-28 02:37:39] [INFO ] Invariant cache hit.
[2024-05-28 02:37:40] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 02:37:40] [INFO ] Invariant cache hit.
[2024-05-28 02:37:40] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-28 02:37:40] [INFO ] Invariant cache hit.
[2024-05-28 02:37:40] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 894 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s381 1) (GEQ s382 1) (GEQ s384 1)), p0:(GEQ s397 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, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 35 reset in 1493 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 2 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-11 finished in 2754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(p1)))&&(X(p2)||F(p3))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:37:42] [INFO ] Invariant cache hit.
[2024-05-28 02:37:42] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2024-05-28 02:37:42] [INFO ] Invariant cache hit.
[2024-05-28 02:37:42] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 02:37:42] [INFO ] Invariant cache hit.
[2024-05-28 02:37:43] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-28 02:37:43] [INFO ] Invariant cache hit.
[2024-05-28 02:37:43] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 892 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(GEQ s377 1), p0:(GEQ s3 3), p1:(GEQ s275 1), p2:(GEQ s490 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-13 finished in 1121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0||X(G(p1))))&&X(F(p2))))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:37:43] [INFO ] Invariant cache hit.
[2024-05-28 02:37:43] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
[2024-05-28 02:37:43] [INFO ] Invariant cache hit.
[2024-05-28 02:37:44] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-28 02:37:44] [INFO ] Invariant cache hit.
[2024-05-28 02:37:44] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-28 02:37:44] [INFO ] Invariant cache hit.
[2024-05-28 02:37:44] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p1), acceptance={1} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 2}, { cond=true, acceptance={1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(NOT p1), acceptance={1} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s477 1), p1:(AND (GEQ s306 1) (GEQ s307 1) (GEQ s309 1)), p2:(LT s38 1)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 0 reset in 1511 ms.
Product exploration explored 100000 steps with 0 reset in 1816 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 162 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-28 02:37:49] [INFO ] Invariant cache hit.
[2024-05-28 02:37:49] [INFO ] [Real]Absence check using 202 positive place invariants in 25 ms returned sat
[2024-05-28 02:37:49] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-28 02:37:49] [INFO ] [Nat]Absence check using 202 positive place invariants in 25 ms returned sat
[2024-05-28 02:37:49] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-28 02:37:50] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 161 ms.
[2024-05-28 02:37:50] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 18675 steps, including 0 resets, run visited all 1 properties in 127 ms. (steps per millisecond=147 )
Parikh walk visited 6 properties in 694 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p0)), (F (AND p0 p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p1)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 377 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:37:51] [INFO ] Invariant cache hit.
[2024-05-28 02:37:52] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
[2024-05-28 02:37:52] [INFO ] Invariant cache hit.
[2024-05-28 02:37:52] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 02:37:52] [INFO ] Invariant cache hit.
[2024-05-28 02:37:52] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-28 02:37:52] [INFO ] Invariant cache hit.
[2024-05-28 02:37:52] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 887 ms. Remains : 504/504 places, 403/403 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true, (X (X p0))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-28 02:37:53] [INFO ] Invariant cache hit.
[2024-05-28 02:37:53] [INFO ] [Real]Absence check using 202 positive place invariants in 29 ms returned sat
[2024-05-28 02:37:53] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-28 02:37:53] [INFO ] [Nat]Absence check using 202 positive place invariants in 25 ms returned sat
[2024-05-28 02:37:54] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-28 02:37:54] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 153 ms.
[2024-05-28 02:37:54] [INFO ] After 823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 18848 steps, including 0 resets, run visited all 6 properties in 433 ms. (steps per millisecond=43 )
Parikh walk visited 6 properties in 433 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), true, (X (X p0))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p0)), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 440 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 1527 ms.
Product exploration explored 100000 steps with 2 reset in 1759 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 293 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 4 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 196 place count 310 transition count 210
Deduced a syphon composed of 99 places in 0 ms
Applied a total of 196 rules in 18 ms. Remains 310 /504 variables (removed 194) and now considering 210/403 (removed 193) transitions.
// Phase 1: matrix 210 rows 310 cols
[2024-05-28 02:38:00] [INFO ] Computed 105 invariants in 3 ms
[2024-05-28 02:38:00] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
[2024-05-28 02:38:00] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-28 02:38:00] [INFO ] Invariant cache hit.
[2024-05-28 02:38:00] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/504 places, 210/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 310/504 places, 210/403 transitions.
Built C files in :
/tmp/ltsmin3977194107631451399
[2024-05-28 02:38:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3977194107631451399
Running compilation step : cd /tmp/ltsmin3977194107631451399;'/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 614 ms.
Running link step : cd /tmp/ltsmin3977194107631451399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3977194107631451399;'/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/stateBased9186236109786204746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:38:15] [INFO ] Computed 202 invariants in 6 ms
[2024-05-28 02:38:15] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
[2024-05-28 02:38:15] [INFO ] Invariant cache hit.
[2024-05-28 02:38:15] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-28 02:38:15] [INFO ] Invariant cache hit.
[2024-05-28 02:38:16] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-28 02:38:16] [INFO ] Invariant cache hit.
[2024-05-28 02:38:16] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 913 ms. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin6945828543381609126
[2024-05-28 02:38:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6945828543381609126
Running compilation step : cd /tmp/ltsmin6945828543381609126;'/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 624 ms.
Running link step : cd /tmp/ltsmin6945828543381609126;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6945828543381609126;'/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/stateBased7438455316831266321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:38:31] [INFO ] Flatten gal took : 18 ms
[2024-05-28 02:38:31] [INFO ] Flatten gal took : 14 ms
[2024-05-28 02:38:31] [INFO ] Time to serialize gal into /tmp/LTL13837040746353971193.gal : 3 ms
[2024-05-28 02:38:31] [INFO ] Time to serialize properties into /tmp/LTL1003167725145009329.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/LTL13837040746353971193.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3408629952864683990.hoa' '-atoms' '/tmp/LTL1003167725145009329.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...318
Loading property file /tmp/LTL1003167725145009329.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3408629952864683990.hoa
Detected timeout of ITS tools.
[2024-05-28 02:38:46] [INFO ] Flatten gal took : 15 ms
[2024-05-28 02:38:46] [INFO ] Flatten gal took : 13 ms
[2024-05-28 02:38:46] [INFO ] Time to serialize gal into /tmp/LTL16210109993971101991.gal : 2 ms
[2024-05-28 02:38:46] [INFO ] Time to serialize properties into /tmp/LTL1161214506717671335.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/LTL16210109993971101991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1161214506717671335.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...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(("(p474>=1)")||(X(G("(((p303>=1)&&(p304>=1))&&(p306>=1))")))))&&(X(F("(p35<1)")))))))
Formula 0 simplified : XG(F(!"(p474>=1)" & XF!"(((p303>=1)&&(p304>=1))&&(p306>=1))") | XG!"(p35<1)")
Detected timeout of ITS tools.
[2024-05-28 02:39:01] [INFO ] Flatten gal took : 15 ms
[2024-05-28 02:39:01] [INFO ] Applying decomposition
[2024-05-28 02:39:01] [INFO ] Flatten gal took : 14 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/graph15982359164015229521.txt' '-o' '/tmp/graph15982359164015229521.bin' '-w' '/tmp/graph15982359164015229521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15982359164015229521.bin' '-l' '-1' '-v' '-w' '/tmp/graph15982359164015229521.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:39:01] [INFO ] Decomposing Gal with order
[2024-05-28 02:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:39:01] [INFO ] Flatten gal took : 18 ms
[2024-05-28 02:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 02:39:01] [INFO ] Time to serialize gal into /tmp/LTL3644193870841096109.gal : 5 ms
[2024-05-28 02:39:01] [INFO ] Time to serialize properties into /tmp/LTL1050255523586153936.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/LTL3644193870841096109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1050255523586153936.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...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G(("(i34.i1.u231.p474>=1)")||(X(G("(((i22.i2.u147.p303>=1)&&(i22.i2.u148.p304>=1))&&(i22.i2.u146.p306>=1))")))))&&(X(F("(i2.i2...174
Formula 0 simplified : XG(F(!"(i34.i1.u231.p474>=1)" & XF!"(((i22.i2.u147.p303>=1)&&(i22.i2.u148.p304>=1))&&(i22.i2.u146.p306>=1))") | XG!"(i2.i2.u17.p35<1...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8651299765446873709
[2024-05-28 02:39:17] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8651299765446873709
Running compilation step : cd /tmp/ltsmin8651299765446873709;'/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 618 ms.
Running link step : cd /tmp/ltsmin8651299765446873709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8651299765446873709;'/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(<>(([](((LTLAPp0==true)||X([]((LTLAPp1==true)))))&&X(<>((LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 2002 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-100101-LTLFireability-14 finished in 96066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F(p1)||G(p0))))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:39:19] [INFO ] Invariant cache hit.
[2024-05-28 02:39:19] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
[2024-05-28 02:39:19] [INFO ] Invariant cache hit.
[2024-05-28 02:39:20] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-28 02:39:20] [INFO ] Invariant cache hit.
[2024-05-28 02:39:20] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-28 02:39:20] [INFO ] Invariant cache hit.
[2024-05-28 02:39:20] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 938 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LT s92 1), p0:(LT s418 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1498 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLFireability-15 finished in 2643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Found a Lengthening insensitive property : RefineWMG-PT-100101-LTLFireability-05
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 588 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 592 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 594 place count 10 transition count 10
Applied a total of 594 rules in 21 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 02:39:22] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 02:39:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:39:22] [INFO ] Invariant cache hit.
[2024-05-28 02:39:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:39:22] [INFO ] Invariant cache hit.
[2024-05-28 02:39:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-28 02:39:22] [INFO ] Invariant cache hit.
[2024-05-28 02:39:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/504 places, 10/403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 119 ms. Remains : 10/504 places, 10/403 transitions.
Running random walk in product with property : RefineWMG-PT-100101-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s5 1), p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1368 steps with 0 reset in 2 ms.
Treatment of property RefineWMG-PT-100101-LTLFireability-05 finished in 351 ms.
FORMULA RefineWMG-PT-100101-LTLFireability-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-28 02:39:22] [INFO ] Flatten gal took : 12 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 226368 ms.

BK_STOP 1716863963604

--------------------
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="RefineWMG-PT-100101"
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 RefineWMG-PT-100101, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662362400478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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