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.r597-smll-171734926300013.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 MedleyA-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926300013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 26K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717361532756

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=MedleyA-PT-03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 20:52:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:52:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:15] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-02 20:52:15] [INFO ] Transformed 108 places.
[2024-06-02 20:52:15] [INFO ] Transformed 100 transitions.
[2024-06-02 20:52:15] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:15] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 98 transition count 91
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 98 transition count 91
Applied a total of 19 rules in 32 ms. Remains 98 /108 variables (removed 10) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 20:52:16] [INFO ] Computed 8 invariants in 10 ms
[2024-06-02 20:52:16] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-02 20:52:16] [INFO ] Invariant cache hit.
[2024-06-02 20:52:16] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-06-02 20:52:16] [INFO ] Invariant cache hit.
[2024-06-02 20:52:16] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 98/108 places, 91/100 transitions.
Support contains 30 out of 98 places after structural reductions.
[2024-06-02 20:52:17] [INFO ] Flatten gal took : 47 ms
[2024-06-02 20:52:17] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:52:17] [INFO ] Input system was already deterministic with 91 transitions.
Support contains 28 out of 98 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 27) seen :24
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 20:52:18] [INFO ] Invariant cache hit.
[2024-06-02 20:52:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:52:18] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 20:52:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:52:18] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-06-02 20:52:18] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-06-02 20:52:18] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 16 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 91/91 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 98 transition count 75
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 82 transition count 75
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 32 place count 82 transition count 66
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 73 transition count 66
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 71 transition count 64
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 71 transition count 64
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 98 place count 49 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 49 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 48 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 47 transition count 40
Applied a total of 101 rules in 45 ms. Remains 47 /98 variables (removed 51) and now considering 40/91 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 47/98 places, 40/91 transitions.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished probabilistic random walk after 394 steps, run visited all 1 properties in 23 ms. (steps per millisecond=17 )
Probabilistic random walk after 394 steps, saw 272 distinct states, run finished after 23 ms. (steps per millisecond=17 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-03-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 97 transition count 76
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 83 transition count 76
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 83 transition count 66
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 73 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 72 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 72 transition count 65
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 5 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 94 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 49 transition count 42
Applied a total of 95 rules in 37 ms. Remains 49 /98 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 49 cols
[2024-06-02 20:52:19] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:52:19] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 20:52:19] [INFO ] Invariant cache hit.
[2024-06-02 20:52:19] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-06-02 20:52:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:52:19] [INFO ] Invariant cache hit.
[2024-06-02 20:52:19] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/98 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 49/98 places, 42/91 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 208 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-00 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&(X(p0) U p1)))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 92 transition count 85
Applied a total of 12 rules in 22 ms. Remains 92 /98 variables (removed 6) and now considering 85/91 (removed 6) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 20:52:19] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:52:19] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 20:52:19] [INFO ] Invariant cache hit.
[2024-06-02 20:52:19] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 20:52:19] [INFO ] Invariant cache hit.
[2024-06-02 20:52:19] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/98 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 92/98 places, 85/91 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s64 1) (EQ s69 1)), p1:(AND (EQ s72 1) (EQ s86 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-01 finished in 559 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((G(p0)||(G(p2)&&p1)))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 97 transition count 79
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 86 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 85 transition count 78
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 24 place count 85 transition count 67
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 46 place count 74 transition count 67
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 72 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 72 transition count 65
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 88 place count 53 transition count 46
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 53 transition count 46
Applied a total of 89 rules in 25 ms. Remains 53 /98 variables (removed 45) and now considering 46/91 (removed 45) transitions.
// Phase 1: matrix 46 rows 53 cols
[2024-06-02 20:52:20] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:52:20] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:52:20] [INFO ] Invariant cache hit.
[2024-06-02 20:52:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 20:52:20] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-02 20:52:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:52:20] [INFO ] Invariant cache hit.
[2024-06-02 20:52:20] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/98 places, 46/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 53/98 places, 46/91 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s22 0) (EQ s17 0)), p2:(EQ s17 0), p0:(EQ s8 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5428 reset in 391 ms.
Product exploration explored 100000 steps with 5407 reset in 295 ms.
Computed a total of 53 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND (NOT p0) p1 p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (G p1)), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 26 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLFireability-02 finished in 1303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1 U G(p2)))))'
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 97 transition count 76
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 83 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 81 transition count 74
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 81 transition count 64
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 71 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 69 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 69 transition count 62
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 94 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 49 transition count 42
Applied a total of 95 rules in 22 ms. Remains 49 /98 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 49 cols
[2024-06-02 20:52:21] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:52:21] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 20:52:21] [INFO ] Invariant cache hit.
[2024-06-02 20:52:21] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-06-02 20:52:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:52:21] [INFO ] Invariant cache hit.
[2024-06-02 20:52:21] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/98 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 49/98 places, 42/91 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s19 1), p2:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 114 steps with 10 reset in 1 ms.
FORMULA MedleyA-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-03 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 97 transition count 75
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 82 transition count 75
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 82 transition count 65
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 72 transition count 65
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 70 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 70 transition count 63
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 94 place count 50 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 49 transition count 42
Applied a total of 96 rules in 23 ms. Remains 49 /98 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 49 cols
[2024-06-02 20:52:21] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:52:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:52:21] [INFO ] Invariant cache hit.
[2024-06-02 20:52:21] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-02 20:52:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:52:22] [INFO ] Invariant cache hit.
[2024-06-02 20:52:22] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/98 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 49/98 places, 42/91 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-04 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 97 transition count 75
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 82 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 81 transition count 74
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 32 place count 81 transition count 65
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 50 place count 72 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 70 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 70 transition count 63
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 94 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 49 transition count 42
Applied a total of 95 rules in 37 ms. Remains 49 /98 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 49 cols
[2024-06-02 20:52:22] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:52:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:52:22] [INFO ] Invariant cache hit.
[2024-06-02 20:52:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-02 20:52:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:52:22] [INFO ] Invariant cache hit.
[2024-06-02 20:52:22] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/98 places, 42/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 49/98 places, 42/91 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s46 1)), p1:(EQ s9 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 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-05 finished in 411 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 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 92 transition count 85
Applied a total of 12 rules in 7 ms. Remains 92 /98 variables (removed 6) and now considering 85/91 (removed 6) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 20:52:22] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:52:22] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:52:22] [INFO ] Invariant cache hit.
[2024-06-02 20:52:22] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-02 20:52:22] [INFO ] Invariant cache hit.
[2024-06-02 20:52:22] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/98 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 92/98 places, 85/91 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-07 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:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-07 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 97 transition count 74
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 81 transition count 74
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 32 place count 81 transition count 65
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 72 transition count 65
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 70 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 70 transition count 63
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 92 place count 51 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 50 transition count 43
Applied a total of 93 rules in 17 ms. Remains 50 /98 variables (removed 48) and now considering 43/91 (removed 48) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-06-02 20:52:22] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:52:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:52:23] [INFO ] Invariant cache hit.
[2024-06-02 20:52:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 20:52:23] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 20:52:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:52:23] [INFO ] Invariant cache hit.
[2024-06-02 20:52:23] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/98 places, 43/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 564 ms. Remains : 50/98 places, 43/91 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 1), p1:(OR (EQ s30 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5019 reset in 339 ms.
Product exploration explored 100000 steps with 5057 reset in 258 ms.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLFireability-09 finished in 1334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&(p1 U p2))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 97 transition count 77
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 84 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 83 transition count 76
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 28 place count 83 transition count 67
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 46 place count 74 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 73 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 73 transition count 66
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 88 place count 53 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 52 transition count 45
Applied a total of 89 rules in 19 ms. Remains 52 /98 variables (removed 46) and now considering 45/91 (removed 46) transitions.
// Phase 1: matrix 45 rows 52 cols
[2024-06-02 20:52:24] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:52:24] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:52:24] [INFO ] Invariant cache hit.
[2024-06-02 20:52:24] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-06-02 20:52:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:52:24] [INFO ] Invariant cache hit.
[2024-06-02 20:52:24] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/98 places, 45/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 52/98 places, 45/91 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s19 1), p1:(EQ s1 1), p0:(EQ s11 0)], 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 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-10 finished in 404 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(G(p0)))))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 92 transition count 85
Applied a total of 12 rules in 6 ms. Remains 92 /98 variables (removed 6) and now considering 85/91 (removed 6) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 20:52:24] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:52:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:52:24] [INFO ] Invariant cache hit.
[2024-06-02 20:52:24] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 20:52:24] [INFO ] Invariant cache hit.
[2024-06-02 20:52:24] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/98 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 92/98 places, 85/91 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s17 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-11 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 97 transition count 77
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 84 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 83 transition count 76
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 28 place count 83 transition count 66
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 48 place count 73 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 71 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 71 transition count 64
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 92 place count 51 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 50 transition count 43
Applied a total of 93 rules in 21 ms. Remains 50 /98 variables (removed 48) and now considering 43/91 (removed 48) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-06-02 20:52:25] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:52:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 20:52:25] [INFO ] Invariant cache hit.
[2024-06-02 20:52:25] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-06-02 20:52:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:52:25] [INFO ] Invariant cache hit.
[2024-06-02 20:52:25] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/98 places, 43/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 50/98 places, 43/91 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s26 1), p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22235 reset in 151 ms.
Product exploration explored 100000 steps with 22248 reset in 126 ms.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 254 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1)]
[2024-06-02 20:52:26] [INFO ] Invariant cache hit.
[2024-06-02 20:52:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:52:26] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-02 20:52:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:52:26] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-02 20:52:26] [INFO ] Computed and/alt/rep : 40/57/40 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 20:52:26] [INFO ] Added : 20 causal constraints over 4 iterations in 65 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-06-02 20:52:26] [INFO ] Invariant cache hit.
[2024-06-02 20:52:26] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 20:52:26] [INFO ] Invariant cache hit.
[2024-06-02 20:52:27] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 20:52:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:52:27] [INFO ] Invariant cache hit.
[2024-06-02 20:52:27] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 50/50 places, 43/43 transitions.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
[2024-06-02 20:52:27] [INFO ] Invariant cache hit.
[2024-06-02 20:52:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:52:27] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-02 20:52:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:52:27] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-02 20:52:27] [INFO ] Computed and/alt/rep : 40/57/40 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-02 20:52:27] [INFO ] Added : 20 causal constraints over 4 iterations in 44 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Product exploration explored 100000 steps with 22243 reset in 116 ms.
Product exploration explored 100000 steps with 22231 reset in 130 ms.
Built C files in :
/tmp/ltsmin5791888158856688151
[2024-06-02 20:52:28] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2024-06-02 20:52:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:52:28] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2024-06-02 20:52:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:52:28] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2024-06-02 20:52:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:52:28] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5791888158856688151
Running compilation step : cd /tmp/ltsmin5791888158856688151;'/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 355 ms.
Running link step : cd /tmp/ltsmin5791888158856688151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5791888158856688151;'/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/stateBased11502381592353107311.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA MedleyA-PT-03-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-03-LTLFireability-12 finished in 3430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p1&&X(X(F(p2)))))&&p0)))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 94 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 86
Applied a total of 10 rules in 2 ms. Remains 93 /98 variables (removed 5) and now considering 86/91 (removed 5) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 20:52:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:52:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 20:52:28] [INFO ] Invariant cache hit.
[2024-06-02 20:52:28] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 20:52:28] [INFO ] Invariant cache hit.
[2024-06-02 20:52:28] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/98 places, 86/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 93/98 places, 86/91 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s55 0)), p1:(EQ s58 1), p2:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-13 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(F(p2))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 94 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 93 transition count 86
Applied a total of 10 rules in 4 ms. Remains 93 /98 variables (removed 5) and now considering 86/91 (removed 5) transitions.
[2024-06-02 20:52:29] [INFO ] Invariant cache hit.
[2024-06-02 20:52:29] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 20:52:29] [INFO ] Invariant cache hit.
[2024-06-02 20:52:29] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-06-02 20:52:29] [INFO ] Invariant cache hit.
[2024-06-02 20:52:29] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/98 places, 86/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 93/98 places, 86/91 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s58 1) (EQ s47 1)), p2:(AND (EQ s56 1) (EQ s61 1)), p1:(EQ s58 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 489 steps with 13 reset in 2 ms.
FORMULA MedleyA-PT-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-15 finished in 527 ms.
All properties solved by simple procedures.
Total runtime 14017 ms.

BK_STOP 1717361551369

--------------------
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="MedleyA-PT-03"
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 MedleyA-PT-03, 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 r597-smll-171734926300013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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