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-171640625500388.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-40b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625500388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K 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 5.5K Apr 11 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 199K 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-40b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716555373807

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-40b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:56: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-05-24 12:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:56:15] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-24 12:56:15] [INFO ] Transformed 796 places.
[2024-05-24 12:56:15] [INFO ] Transformed 837 transitions.
[2024-05-24 12:56:15] [INFO ] Found NUPN structural information;
[2024-05-24 12:56:15] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 837/837 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 837
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 83 place count 713 transition count 755
Iterating global reduction 1 with 82 rules applied. Total rules applied 165 place count 713 transition count 755
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 203 place count 675 transition count 717
Iterating global reduction 1 with 38 rules applied. Total rules applied 241 place count 675 transition count 717
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 276 place count 675 transition count 682
Applied a total of 276 rules in 153 ms. Remains 675 /796 variables (removed 121) and now considering 682/837 (removed 155) transitions.
// Phase 1: matrix 682 rows 675 cols
[2024-05-24 12:56:15] [INFO ] Computed 41 invariants in 25 ms
[2024-05-24 12:56:16] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-24 12:56:16] [INFO ] Invariant cache hit.
[2024-05-24 12:56:16] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2024-05-24 12:56:16] [INFO ] Invariant cache hit.
[2024-05-24 12:56:17] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/796 places, 682/837 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1487 ms. Remains : 675/796 places, 682/837 transitions.
Support contains 35 out of 675 places after structural reductions.
[2024-05-24 12:56:17] [INFO ] Flatten gal took : 68 ms
[2024-05-24 12:56:17] [INFO ] Flatten gal took : 34 ms
[2024-05-24 12:56:17] [INFO ] Input system was already deterministic with 682 transitions.
Support contains 34 out of 675 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 35) seen :20
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-24 12:56:18] [INFO ] Invariant cache hit.
[2024-05-24 12:56:18] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-24 12:56:18] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 22 ms returned sat
[2024-05-24 12:56:19] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-24 12:56:20] [INFO ] After 1223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 373 ms.
[2024-05-24 12:56:20] [INFO ] After 1996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 3 different solutions.
Finished Parikh walk after 307 steps, including 0 resets, run visited all 15 properties in 8 ms. (steps per millisecond=38 )
Parikh walk visited 15 properties in 10 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPUForwardProgress-PT-40b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 127 stabilizing places and 127 stable transitions
Graph (complete) has 1051 edges and 675 vertex of which 631 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.23 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||G(p1)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 555 edges and 675 vertex of which 6 / 675 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 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 625 transition count 346
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 334 rules applied. Total rules applied 662 place count 299 transition count 338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 665 place count 296 transition count 338
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 665 place count 296 transition count 253
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 835 place count 211 transition count 253
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 875 place count 171 transition count 213
Iterating global reduction 3 with 40 rules applied. Total rules applied 915 place count 171 transition count 213
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1155 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1156 place count 51 transition count 92
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1196 place count 11 transition count 13
Iterating global reduction 4 with 40 rules applied. Total rules applied 1236 place count 11 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1238 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1239 place count 9 transition count 11
Applied a total of 1239 rules in 53 ms. Remains 9 /675 variables (removed 666) and now considering 11/682 (removed 671) transitions.
// Phase 1: matrix 11 rows 9 cols
[2024-05-24 12:56:20] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:56:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:56:20] [INFO ] Invariant cache hit.
[2024-05-24 12:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-24 12:56:20] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:56:20] [INFO ] Invariant cache hit.
[2024-05-24 12:56:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/675 places, 11/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 9/675 places, 11/682 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 195 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s5 0), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 5 reset in 3 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-00 finished in 377 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(p0))))'
Support contains 1 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 667 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 667 transition count 674
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 667 transition count 671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 666 transition count 670
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 666 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 666 transition count 669
Applied a total of 22 rules in 102 ms. Remains 666 /675 variables (removed 9) and now considering 669/682 (removed 13) transitions.
// Phase 1: matrix 669 rows 666 cols
[2024-05-24 12:56:21] [INFO ] Computed 41 invariants in 8 ms
[2024-05-24 12:56:21] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-24 12:56:21] [INFO ] Invariant cache hit.
[2024-05-24 12:56:21] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-24 12:56:21] [INFO ] Invariant cache hit.
[2024-05-24 12:56:22] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 666/675 places, 669/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 905 ms. Remains : 666/675 places, 669/682 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s57 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 329 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-03 finished in 1038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (p1&&F(p2))))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 666 transition count 673
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 666 transition count 673
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 666 transition count 670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 664 transition count 668
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 664 transition count 668
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 664 transition count 666
Applied a total of 27 rules in 52 ms. Remains 664 /675 variables (removed 11) and now considering 666/682 (removed 16) transitions.
// Phase 1: matrix 666 rows 664 cols
[2024-05-24 12:56:22] [INFO ] Computed 41 invariants in 7 ms
[2024-05-24 12:56:22] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-24 12:56:22] [INFO ] Invariant cache hit.
[2024-05-24 12:56:22] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-24 12:56:22] [INFO ] Invariant cache hit.
[2024-05-24 12:56:22] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 664/675 places, 666/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 813 ms. Remains : 664/675 places, 666/682 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) p0), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s489 1), p2:(AND (EQ s545 1) (EQ s651 1) (EQ s662 1)), p0:(AND (EQ s191 1) (EQ s529 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 359 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-06 finished in 996 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)) U p2)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 555 edges and 675 vertex of which 6 / 675 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.5 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 325 place count 625 transition count 349
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 331 rules applied. Total rules applied 656 place count 302 transition count 341
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 660 place count 299 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 661 place count 298 transition count 340
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 85 Pre rules applied. Total rules applied 661 place count 298 transition count 255
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 831 place count 213 transition count 255
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 871 place count 173 transition count 215
Iterating global reduction 4 with 40 rules applied. Total rules applied 911 place count 173 transition count 215
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1155 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1156 place count 51 transition count 92
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1194 place count 13 transition count 17
Iterating global reduction 5 with 38 rules applied. Total rules applied 1232 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1234 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1235 place count 11 transition count 15
Applied a total of 1235 rules in 42 ms. Remains 11 /675 variables (removed 664) and now considering 15/682 (removed 667) transitions.
// Phase 1: matrix 15 rows 11 cols
[2024-05-24 12:56:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-24 12:56:23] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/675 places, 15/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 11/675 places, 15/682 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s7 1), p0:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-07 finished in 194 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 U p1)&&G(F(p2)))))'
Support contains 2 out of 675 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 : 675/675 places, 682/682 transitions.
Graph (trivial) has 555 edges and 675 vertex of which 6 / 675 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 325 place count 625 transition count 349
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 331 rules applied. Total rules applied 656 place count 302 transition count 341
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 662 place count 299 transition count 338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 665 place count 296 transition count 338
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 665 place count 296 transition count 255
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 831 place count 213 transition count 255
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 871 place count 173 transition count 215
Iterating global reduction 4 with 40 rules applied. Total rules applied 911 place count 173 transition count 215
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1155 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1156 place count 51 transition count 92
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1193 place count 14 transition count 19
Iterating global reduction 5 with 37 rules applied. Total rules applied 1230 place count 14 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1232 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1233 place count 12 transition count 17
Applied a total of 1233 rules in 42 ms. Remains 12 /675 variables (removed 663) and now considering 17/682 (removed 665) transitions.
// Phase 1: matrix 17 rows 12 cols
[2024-05-24 12:56:23] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 12:56:23] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/675 places, 17/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 12/675 places, 17/682 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s3 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-08 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' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 556 edges and 675 vertex of which 6 / 675 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 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 625 transition count 346
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 334 rules applied. Total rules applied 662 place count 299 transition count 338
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 666 place count 296 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 667 place count 295 transition count 337
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 667 place count 295 transition count 253
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 835 place count 211 transition count 253
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 875 place count 171 transition count 213
Iterating global reduction 4 with 40 rules applied. Total rules applied 915 place count 171 transition count 213
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 1157 place count 50 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1158 place count 50 transition count 91
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 1196 place count 12 transition count 16
Iterating global reduction 5 with 38 rules applied. Total rules applied 1234 place count 12 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1236 place count 11 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1237 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1238 place count 10 transition count 14
Applied a total of 1238 rules in 36 ms. Remains 10 /675 variables (removed 665) and now considering 14/682 (removed 668) transitions.
// Phase 1: matrix 14 rows 10 cols
[2024-05-24 12:56:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 12:56:23] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/675 places, 14/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 10/675 places, 14/682 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-09 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Graph (trivial) has 558 edges and 675 vertex of which 6 / 675 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 1045 edges and 670 vertex of which 626 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 329 place count 625 transition count 345
Reduce places removed 327 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 335 rules applied. Total rules applied 664 place count 298 transition count 337
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 668 place count 295 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 669 place count 294 transition count 336
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 85 Pre rules applied. Total rules applied 669 place count 294 transition count 251
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 839 place count 209 transition count 251
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 879 place count 169 transition count 211
Iterating global reduction 4 with 40 rules applied. Total rules applied 919 place count 169 transition count 211
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1159 place count 49 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1160 place count 49 transition count 90
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 1200 place count 9 transition count 11
Iterating global reduction 5 with 40 rules applied. Total rules applied 1240 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1242 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1243 place count 7 transition count 9
Applied a total of 1243 rules in 32 ms. Remains 7 /675 variables (removed 668) and now considering 9/682 (removed 673) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-24 12:56:23] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:56:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-24 12:56:23] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:56:23] [INFO ] Invariant cache hit.
[2024-05-24 12:56:23] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/675 places, 9/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 7/675 places, 9/682 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-10 finished in 143 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) U X(G(p1)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 667 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 667 transition count 674
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 667 transition count 671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 666 transition count 670
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 666 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 666 transition count 669
Applied a total of 22 rules in 54 ms. Remains 666 /675 variables (removed 9) and now considering 669/682 (removed 13) transitions.
// Phase 1: matrix 669 rows 666 cols
[2024-05-24 12:56:24] [INFO ] Computed 41 invariants in 9 ms
[2024-05-24 12:56:24] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-24 12:56:24] [INFO ] Invariant cache hit.
[2024-05-24 12:56:24] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-24 12:56:24] [INFO ] Invariant cache hit.
[2024-05-24 12:56:24] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 666/675 places, 669/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 666/675 places, 669/682 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s132 1), p0:(EQ s145 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 294 reset in 232 ms.
Entered a terminal (fully accepting) state of product in 20259 steps with 59 reset in 46 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-11 finished in 1395 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))&&F((p1||X((p2||X(F(p3))))))))'
Support contains 3 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 668 transition count 675
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 668 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 668 transition count 673
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 666 transition count 671
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 666 transition count 671
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 666 transition count 669
Applied a total of 22 rules in 49 ms. Remains 666 /675 variables (removed 9) and now considering 669/682 (removed 13) transitions.
// Phase 1: matrix 669 rows 666 cols
[2024-05-24 12:56:25] [INFO ] Computed 41 invariants in 8 ms
[2024-05-24 12:56:25] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-24 12:56:25] [INFO ] Invariant cache hit.
[2024-05-24 12:56:25] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-24 12:56:25] [INFO ] Invariant cache hit.
[2024-05-24 12:56:26] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 666/675 places, 669/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 830 ms. Remains : 666/675 places, 669/682 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s268 1), p0:(EQ s268 0), p2:(EQ s98 1), p3:(EQ s642 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28678 reset in 434 ms.
Product exploration explored 100000 steps with 28684 reset in 337 ms.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1038 edges and 666 vertex of which 622 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.6 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/666 stabilizing places and 124/669 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (AND (NOT p1) (NOT p2))), (X p0), (X (X p0)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (AND (NOT p1) (NOT p2))), (X p0), (X (X p0)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (AND (NOT p3) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Applied a total of 0 rules in 18 ms. Remains 666 /666 variables (removed 0) and now considering 669/669 (removed 0) transitions.
[2024-05-24 12:56:27] [INFO ] Invariant cache hit.
[2024-05-24 12:56:27] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-24 12:56:27] [INFO ] Invariant cache hit.
[2024-05-24 12:56:28] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-24 12:56:28] [INFO ] Invariant cache hit.
[2024-05-24 12:56:28] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 666/666 places, 669/669 transitions.
Computed a total of 124 stabilizing places and 124 stable transitions
Graph (complete) has 1038 edges and 666 vertex of which 622 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Computed a total of 124 stabilizing places and 124 stable transitions
Detected a total of 124/666 stabilizing places and 124/669 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (F (AND (NOT p3) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20146 reset in 259 ms.
Product exploration explored 100000 steps with 20141 reset in 313 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Graph (trivial) has 541 edges and 666 vertex of which 6 / 666 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 1032 edges and 661 vertex of which 617 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 318 rules applied. Total rules applied 320 place count 617 transition count 660
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 320 place count 617 transition count 663
Deduced a syphon composed of 361 places in 2 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 363 place count 617 transition count 663
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 598 place count 382 transition count 428
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 1 with 235 rules applied. Total rules applied 833 place count 382 transition count 428
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 872 place count 343 transition count 389
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 911 place count 343 transition count 389
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 251 places in 0 ms
Iterating global reduction 1 with 125 rules applied. Total rules applied 1036 place count 343 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1038 place count 343 transition count 388
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 1124 place count 257 transition count 301
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 1210 place count 257 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1211 place count 257 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1212 place count 256 transition count 300
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1213 place count 256 transition count 300
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 205 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 1253 place count 256 transition count 419
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1331 place count 178 transition count 263
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1409 place count 178 transition count 263
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 1520 place count 67 transition count 78
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 1631 place count 67 transition count 78
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 1631 rules in 110 ms. Remains 67 /666 variables (removed 599) and now considering 78/669 (removed 591) transitions.
[2024-05-24 12:56:30] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 78 rows 67 cols
[2024-05-24 12:56:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:56:30] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/666 places, 78/669 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 67/666 places, 78/669 transitions.
Built C files in :
/tmp/ltsmin7819974483319364030
[2024-05-24 12:56:30] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7819974483319364030
Running compilation step : cd /tmp/ltsmin7819974483319364030;'/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 1015 ms.
Running link step : cd /tmp/ltsmin7819974483319364030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7819974483319364030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9276582700981704499.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 669/669 transitions.
Applied a total of 0 rules in 20 ms. Remains 666 /666 variables (removed 0) and now considering 669/669 (removed 0) transitions.
// Phase 1: matrix 669 rows 666 cols
[2024-05-24 12:56:45] [INFO ] Computed 41 invariants in 8 ms
[2024-05-24 12:56:45] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-24 12:56:45] [INFO ] Invariant cache hit.
[2024-05-24 12:56:46] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-24 12:56:46] [INFO ] Invariant cache hit.
[2024-05-24 12:56:46] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 830 ms. Remains : 666/666 places, 669/669 transitions.
Built C files in :
/tmp/ltsmin10618712331257266999
[2024-05-24 12:56:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10618712331257266999
Running compilation step : cd /tmp/ltsmin10618712331257266999;'/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 939 ms.
Running link step : cd /tmp/ltsmin10618712331257266999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10618712331257266999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5938777998205909384.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:57:01] [INFO ] Flatten gal took : 28 ms
[2024-05-24 12:57:01] [INFO ] Flatten gal took : 29 ms
[2024-05-24 12:57:01] [INFO ] Time to serialize gal into /tmp/LTL18139615957451025443.gal : 6 ms
[2024-05-24 12:57:01] [INFO ] Time to serialize properties into /tmp/LTL14012683407086703554.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18139615957451025443.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5816707365373003903.hoa' '-atoms' '/tmp/LTL14012683407086703554.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i17.u119.p313==0)")))&&(F(("(i17.u119.p313==1)")||(X(("(i5.u43.p109==1)")||(X(F("(i41.u274.p761==0)")))))))))
Formula 0 simplified : XG!"(i17.u119.p313==0)" | G(!"(i17.u119.p313==1)" & X(!"(i5.u43.p109==1)" & XG!"(i41.u274.p761==0)"))
Reverse transition relation is NOT exact ! Due to transitions t600, i0.t263, i0.t256, i2.t595, i2.u19.t588, i3.t582, i3.t572, i4.t565, i4.t558, i5.t551, i5...1134
Computing Next relation with stutter on 2.43153e+19 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
322 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.28462,141764,1,0,239669,358,6153,225344,156,687,1311657
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-12 finished in 70267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 667 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 667 transition count 674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 667 transition count 672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 665 transition count 670
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 665 transition count 670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 665 transition count 668
Applied a total of 24 rules in 45 ms. Remains 665 /675 variables (removed 10) and now considering 668/682 (removed 14) transitions.
// Phase 1: matrix 668 rows 665 cols
[2024-05-24 12:57:35] [INFO ] Computed 41 invariants in 8 ms
[2024-05-24 12:57:35] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-24 12:57:35] [INFO ] Invariant cache hit.
[2024-05-24 12:57:36] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-24 12:57:36] [INFO ] Invariant cache hit.
[2024-05-24 12:57:36] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 665/675 places, 668/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 852 ms. Remains : 665/675 places, 668/682 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s604 1), p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4103 reset in 154 ms.
Product exploration explored 100000 steps with 4103 reset in 179 ms.
Computed a total of 123 stabilizing places and 123 stable transitions
Graph (complete) has 1037 edges and 665 vertex of which 621 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 123 stable transitions
Detected a total of 123/665 stabilizing places and 123/668 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 3718 steps, including 10 resets, run visited all 4 properties in 60 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-24 12:57:37] [INFO ] Invariant cache hit.
[2024-05-24 12:57:37] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 13 ms returned sat
[2024-05-24 12:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:57:38] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-24 12:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:57:38] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 12 ms returned sat
[2024-05-24 12:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:57:38] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-05-24 12:57:38] [INFO ] Computed and/alt/rep : 662/869/662 causal constraints (skipped 5 transitions) in 44 ms.
[2024-05-24 12:57:39] [INFO ] Added : 79 causal constraints over 16 iterations in 665 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 668/668 transitions.
Graph (trivial) has 543 edges and 665 vertex of which 6 / 665 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 1031 edges and 660 vertex of which 616 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.0 ms
Discarding 44 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 323 place count 615 transition count 337
Reduce places removed 321 places and 0 transitions.
Iterating post reduction 1 with 321 rules applied. Total rules applied 644 place count 294 transition count 337
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 644 place count 294 transition count 253
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 812 place count 210 transition count 253
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 851 place count 171 transition count 214
Iterating global reduction 2 with 39 rules applied. Total rules applied 890 place count 171 transition count 214
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 1128 place count 52 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1129 place count 52 transition count 94
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1168 place count 13 transition count 17
Iterating global reduction 3 with 39 rules applied. Total rules applied 1207 place count 13 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1211 place count 11 transition count 16
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1213 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1214 place count 10 transition count 15
Applied a total of 1214 rules in 19 ms. Remains 10 /665 variables (removed 655) and now considering 15/668 (removed 653) transitions.
[2024-05-24 12:57:39] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2024-05-24 12:57:39] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:57:39] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 12:57:39] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 12:57:39] [INFO ] Invariant cache hit.
[2024-05-24 12:57:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:57:39] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-24 12:57:39] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 12:57:39] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 12:57:39] [INFO ] Invariant cache hit.
[2024-05-24 12:57:39] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/665 places, 15/668 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 10/665 places, 15/668 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/10 stabilizing places and 4/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 336 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 102 steps, including 12 resets, run visited all 4 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 420 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-24 12:57:40] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 12:57:40] [INFO ] Invariant cache hit.
[2024-05-24 12:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:57:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:57:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:57:40] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 12:57:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:57:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:57:40] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:57:40] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-13 finished in 5287 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||G(p1)))||X(p2)) U p3))'
Support contains 3 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 682/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 667 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 667 transition count 674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 667 transition count 672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 665 transition count 670
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 665 transition count 670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 665 transition count 668
Applied a total of 24 rules in 52 ms. Remains 665 /675 variables (removed 10) and now considering 668/682 (removed 14) transitions.
// Phase 1: matrix 668 rows 665 cols
[2024-05-24 12:57:40] [INFO ] Computed 41 invariants in 6 ms
[2024-05-24 12:57:41] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-24 12:57:41] [INFO ] Invariant cache hit.
[2024-05-24 12:57:41] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-05-24 12:57:41] [INFO ] Invariant cache hit.
[2024-05-24 12:57:41] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 665/675 places, 668/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 812 ms. Remains : 665/675 places, 668/682 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-40b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s398 1), p0:(NEQ s163 1), p1:(OR (EQ s77 1) (EQ s163 1)), p2:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1749 steps with 4 reset in 11 ms.
FORMULA GPUForwardProgress-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40b-LTLFireability-14 finished in 1092 ms.
All properties solved by simple procedures.
Total runtime 86782 ms.

BK_STOP 1716555462955

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-40b"
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-40b, 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-171640625500388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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