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

About the Execution of 2023-gold for GPUForwardProgress-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
388.508 14690.00 26332.00 285.60 FFFTFFFTTFFFTTFF 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.r197-tall-171640625300298.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 GPUForwardProgress-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625300298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 27K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716553915886

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=GPUForwardProgress-PT-04b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:31:57] [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-24 12:31:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:31:57] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-24 12:31:57] [INFO ] Transformed 112 places.
[2024-05-24 12:31:57] [INFO ] Transformed 117 transitions.
[2024-05-24 12:31:57] [INFO ] Found NUPN structural information;
[2024-05-24 12:31:57] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 98 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 5 formulas.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 101 transition count 107
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 101 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 98 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 98 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 98 transition count 103
Applied a total of 28 rules in 22 ms. Remains 98 /112 variables (removed 14) and now considering 103/117 (removed 14) transitions.
// Phase 1: matrix 103 rows 98 cols
[2024-05-24 12:31:57] [INFO ] Computed 5 invariants in 15 ms
[2024-05-24 12:31:57] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-24 12:31:57] [INFO ] Invariant cache hit.
[2024-05-24 12:31:57] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-24 12:31:57] [INFO ] Invariant cache hit.
[2024-05-24 12:31:57] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 103/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 98/112 places, 103/117 transitions.
Support contains 27 out of 98 places after structural reductions.
[2024-05-24 12:31:58] [INFO ] Flatten gal took : 27 ms
[2024-05-24 12:31:58] [INFO ] Flatten gal took : 10 ms
[2024-05-24 12:31:58] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 25 out of 98 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:31:58] [INFO ] Invariant cache hit.
[2024-05-24 12:31:58] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 12:31:58] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 148 edges and 98 vertex of which 90 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 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||X(F(p1))))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 12 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-24 12:31:58] [INFO ] Computed 5 invariants in 4 ms
[2024-05-24 12:31:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 12:31:58] [INFO ] Invariant cache hit.
[2024-05-24 12:31:58] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-24 12:31:58] [INFO ] Invariant cache hit.
[2024-05-24 12:31:59] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 88/98 places, 90/103 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 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s75 1) (EQ s86 1)), p1:(EQ s12 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][false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-01 finished in 455 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, 103/103 transitions.
Graph (trivial) has 86 edges and 98 vertex of which 6 / 98 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 142 edges and 93 vertex of which 85 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 84 transition count 53
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 44 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 43 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 42 transition count 49
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 88 place count 42 transition count 38
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 110 place count 31 transition count 38
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 115 place count 26 transition count 33
Iterating global reduction 4 with 5 rules applied. Total rules applied 120 place count 26 transition count 33
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 144 place count 14 transition count 21
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 12 transition count 17
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 12 transition count 17
Performed 3 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 154 place count 9 transition count 14
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 8 transition count 13
Applied a total of 157 rules in 23 ms. Remains 8 /98 variables (removed 90) and now considering 13/103 (removed 90) transitions.
[2024-05-24 12:31:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2024-05-24 12:31:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:31:59] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 12:31:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-24 12:31:59] [INFO ] Invariant cache hit.
[2024-05-24 12:31:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:31:59] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 12:31:59] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-24 12:31:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-24 12:31:59] [INFO ] Invariant cache hit.
[2024-05-24 12:31:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/98 places, 13/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 8/98 places, 13/103 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-02 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:(NEQ s2 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 7 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-02 finished in 339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(p2)&&(!p0 U (p1||G(!p0)))))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 93 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 93 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 93 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 92 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 92 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 92 transition count 95
Applied a total of 14 rules in 21 ms. Remains 92 /98 variables (removed 6) and now considering 95/103 (removed 8) transitions.
// Phase 1: matrix 95 rows 92 cols
[2024-05-24 12:31:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 12:31:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 12:31:59] [INFO ] Invariant cache hit.
[2024-05-24 12:31:59] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-24 12:31:59] [INFO ] Invariant cache hit.
[2024-05-24 12:31:59] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/98 places, 95/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 92/98 places, 95/103 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p1)), true, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s48 1) (EQ s5 1)), p1:(AND (NEQ s6 1) (NOT (AND (EQ s48 1) (EQ s5 1)))), p2:(NEQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Graph (complete) has 140 edges and 92 vertex of which 84 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/92 stabilizing places and 17/95 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 160 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-04b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-03 finished in 957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X(G(p1)))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 10 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-24 12:32:00] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 12:32:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 12:32:00] [INFO ] Invariant cache hit.
[2024-05-24 12:32:00] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 12:32:00] [INFO ] Invariant cache hit.
[2024-05-24 12:32:00] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(NEQ s20 1), p0:(OR (AND (EQ s55 1) (EQ s75 1) (EQ s86 1)) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-04 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Graph (trivial) has 85 edges and 98 vertex of which 6 / 98 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 142 edges and 93 vertex of which 85 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 84 transition count 53
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 44 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 43 transition count 49
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 87 place count 43 transition count 37
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 111 place count 31 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 27 transition count 33
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 27 transition count 33
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 145 place count 14 transition count 20
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 11 transition count 14
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 11 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 155 place count 9 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 8 transition count 10
Applied a total of 156 rules in 13 ms. Remains 8 /98 variables (removed 90) and now considering 10/103 (removed 93) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-05-24 12:32:00] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:32:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 12:32:00] [INFO ] Invariant cache hit.
[2024-05-24 12:32:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:32:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 12:32:00] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:32:00] [INFO ] Invariant cache hit.
[2024-05-24 12:32:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/98 places, 10/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 8/98 places, 10/103 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s3 1) (NEQ s5 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 21 steps with 3 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-05 finished in 162 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&&F((p1&&F(p2)))) U X(p3)))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 89 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 89 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 89 transition count 92
Applied a total of 20 rules in 8 ms. Remains 89 /98 variables (removed 9) and now considering 92/103 (removed 11) transitions.
// Phase 1: matrix 92 rows 89 cols
[2024-05-24 12:32:01] [INFO ] Computed 5 invariants in 3 ms
[2024-05-24 12:32:01] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 12:32:01] [INFO ] Invariant cache hit.
[2024-05-24 12:32:01] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-24 12:32:01] [INFO ] Invariant cache hit.
[2024-05-24 12:32:01] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/98 places, 92/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 89/98 places, 92/103 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s77 1), p1:(EQ s65 1), p2:(EQ s43 1), p3:(AND (EQ s77 1) (EQ s5 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-06 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F((p0 U (p1||G(p0)))))||(p2&&F((p0 U (p1||G(p0))))))))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 92 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 90 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 90 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 90 transition count 92
Applied a total of 19 rules in 7 ms. Remains 90 /98 variables (removed 8) and now considering 92/103 (removed 11) transitions.
// Phase 1: matrix 92 rows 90 cols
[2024-05-24 12:32:01] [INFO ] Computed 5 invariants in 3 ms
[2024-05-24 12:32:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-24 12:32:01] [INFO ] Invariant cache hit.
[2024-05-24 12:32:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-24 12:32:01] [INFO ] Invariant cache hit.
[2024-05-24 12:32:01] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/98 places, 92/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 90/98 places, 92/103 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s58 1), p1:(AND (NEQ s45 1) (EQ s83 1)), p0:(EQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-10 finished in 363 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) U G(!p2))) U (p3&&(p0||(F(p1) U G(!p2)))))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 9 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-24 12:32:01] [INFO ] Computed 5 invariants in 2 ms
[2024-05-24 12:32:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 12:32:01] [INFO ] Invariant cache hit.
[2024-05-24 12:32:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-24 12:32:01] [INFO ] Invariant cache hit.
[2024-05-24 12:32:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p3) (AND (NOT p0) p2)), (OR (NOT p3) (AND (NOT p0) p2)), (NOT p1), p2]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s73 1), p0:(EQ s63 1), p2:(NEQ s58 1), p1:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3628 reset in 108 ms.
Product exploration explored 100000 steps with 3635 reset in 185 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Graph (complete) has 135 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 (NOT p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p3)), (X (NOT p0)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p3))), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 87 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 16 states, 50 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 693 ms :[(OR (NOT p1) (NOT p3) p2), (OR (NOT p3) (AND (NOT p0) p2)), (NOT p1), p2, false, (AND p3 (NOT p0) (NOT p1) p2), false, (AND p3 (NOT p0) p1 p2), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 209 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 12:32:03] [INFO ] Invariant cache hit.
[2024-05-24 12:32:03] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 12:32:04] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-24 12:32:04] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 12:32:04] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 (NOT p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p3)), (X (NOT p0)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p3))), (X (X p2)), (X (X (NOT p0))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND p0 p1 p2 p3))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3))), (G (NOT (AND p0 p1 (NOT p2) p3))), (G (NOT (AND (NOT p0) p1 (NOT p2) p3))), (G (NOT (AND p0 p1 p2 (NOT p3)))), (G (NOT (AND p0 p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2 (NOT p3))), (F p1), (F p0), (F (AND (NOT p0) p1 p2 p3)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p3), (F (AND p0 (NOT p1) p2 p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2 p3))]
Knowledge based reduction with 17 factoid took 524 ms. Reduced automaton from 16 states, 50 edges and 4 AP (stutter insensitive) to 16 states, 50 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 688 ms :[(OR (NOT p1) (NOT p3) p2), (OR (NOT p3) (AND (NOT p0) p2)), (NOT p1), p2, false, (AND p3 (NOT p0) (NOT p1) p2), false, (AND p3 (NOT p0) p1 p2), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 646 ms :[(OR (NOT p1) (NOT p3) p2), (OR (NOT p3) (AND (NOT p0) p2)), (NOT p1), p2, false, (AND p3 (NOT p0) (NOT p1) p2), false, (AND p3 (NOT p0) p1 p2), false, false, false, false, false, false, false, false]
[2024-05-24 12:32:05] [INFO ] Invariant cache hit.
[2024-05-24 12:32:06] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 12:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:32:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 12:32:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:32:06] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 12:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:32:06] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 12:32:06] [INFO ] Computed and/alt/rep : 89/133/89 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 12:32:06] [INFO ] Added : 82 causal constraints over 17 iterations in 150 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-24 12:32:06] [INFO ] Invariant cache hit.
[2024-05-24 12:32:06] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 12:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:32:06] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
Proved EG (NOT p3)
[2024-05-24 12:32:06] [INFO ] Invariant cache hit.
[2024-05-24 12:32:06] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 12:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:32:06] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Proved EG p2
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 (NOT p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p3)), (X (NOT p0)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p3))), (X (X p2)), (X (X (NOT p0))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND p0 p1 p2 p3))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3))), (G (NOT (AND p0 p1 (NOT p2) p3))), (G (NOT (AND (NOT p0) p1 (NOT p2) p3))), (G (NOT (AND p0 p1 p2 (NOT p3)))), (G (NOT (AND p0 p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2 (NOT p3))), (F p1), (F p0), (F (AND (NOT p0) p1 p2 p3)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p3), (F (AND p0 (NOT p1) p2 p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2 p3)), (G (NOT p3)), (G p2)]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 17 factoid took 427 ms. Reduced automaton from 16 states, 50 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-04b-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-11 finished in 5009 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 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Graph (trivial) has 82 edges and 98 vertex of which 6 / 98 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 142 edges and 93 vertex of which 85 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 84 transition count 54
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 45 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 44 transition count 50
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 85 place count 44 transition count 38
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 109 place count 32 transition count 38
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 115 place count 26 transition count 32
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 26 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 26 transition count 31
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 150 place count 12 transition count 17
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 10 transition count 13
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 9 transition count 12
Applied a total of 155 rules in 14 ms. Remains 9 /98 variables (removed 89) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-24 12:32:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:32:06] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 12:32:06] [INFO ] Invariant cache hit.
[2024-05-24 12:32:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:32:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 12:32:06] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:32:06] [INFO ] Invariant cache hit.
[2024-05-24 12:32:06] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/98 places, 12/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 9/98 places, 12/103 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s6 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12404 reset in 158 ms.
Product exploration explored 100000 steps with 12408 reset in 201 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 84 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 :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-24 12:32:07] [INFO ] Invariant cache hit.
[2024-05-24 12:32:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 12:32:07] [INFO ] Invariant cache hit.
[2024-05-24 12:32:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:32:07] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 12:32:07] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 12:32:07] [INFO ] Invariant cache hit.
[2024-05-24 12:32:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 9/9 places, 12/12 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 52 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 88 ms :[p0, p0]
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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 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 74 ms :[p0, p0]
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Product exploration explored 100000 steps with 12469 reset in 78 ms.
Product exploration explored 100000 steps with 12369 reset in 73 ms.
Built C files in :
/tmp/ltsmin15566957848490701391
[2024-05-24 12:32:08] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-24 12:32:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:32:08] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-24 12:32:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:32:08] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-24 12:32:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:32:08] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15566957848490701391
Running compilation step : cd /tmp/ltsmin15566957848490701391;'/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 190 ms.
Running link step : cd /tmp/ltsmin15566957848490701391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15566957848490701391;'/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/stateBased4319467294428956424.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-13 finished in 2040 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)))||G(p1)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 5 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-24 12:32:08] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 12:32:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 12:32:08] [INFO ] Invariant cache hit.
[2024-05-24 12:32:08] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-24 12:32:08] [INFO ] Invariant cache hit.
[2024-05-24 12:32:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(EQ s57 1), p0:(EQ s42 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, 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 GPUForwardProgress-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-14 finished in 357 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(p0)))))'
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 91 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 88 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 88 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 88 transition count 90
Applied a total of 23 rules in 8 ms. Remains 88 /98 variables (removed 10) and now considering 90/103 (removed 13) transitions.
[2024-05-24 12:32:09] [INFO ] Invariant cache hit.
[2024-05-24 12:32:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 12:32:09] [INFO ] Invariant cache hit.
[2024-05-24 12:32:09] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-24 12:32:09] [INFO ] Invariant cache hit.
[2024-05-24 12:32:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/98 places, 90/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 88/98 places, 90/103 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-15 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: 3}], [{ 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=[p0:(EQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-15 finished in 353 ms.
All properties solved by simple procedures.
Total runtime 12309 ms.

BK_STOP 1716553930576

--------------------
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="GPUForwardProgress-PT-04b"
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 GPUForwardProgress-PT-04b, 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 r197-tall-171640625300298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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