Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576100388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576100388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 6.5K Apr 29 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 122K May 10 09:34 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-24b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652730270911

Running Version 202205111006
[2022-05-16 19:44:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 19:44:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:44:33] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2022-05-16 19:44:33] [INFO ] Transformed 492 places.
[2022-05-16 19:44:33] [INFO ] Transformed 517 transitions.
[2022-05-16 19:44:33] [INFO ] Found NUPN structural information;
[2022-05-16 19:44:33] [INFO ] Parsed PT model containing 492 places and 517 transitions in 339 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 517/517 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 491 transition count 517
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 54 place count 438 transition count 464
Iterating global reduction 1 with 53 rules applied. Total rules applied 107 place count 438 transition count 464
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 128 place count 417 transition count 443
Iterating global reduction 1 with 21 rules applied. Total rules applied 149 place count 417 transition count 443
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 167 place count 417 transition count 425
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 416 transition count 424
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 416 transition count 424
Applied a total of 169 rules in 155 ms. Remains 416 /492 variables (removed 76) and now considering 424/517 (removed 93) transitions.
// Phase 1: matrix 424 rows 416 cols
[2022-05-16 19:44:33] [INFO ] Computed 25 place invariants in 22 ms
[2022-05-16 19:44:33] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 424 rows 416 cols
[2022-05-16 19:44:33] [INFO ] Computed 25 place invariants in 8 ms
[2022-05-16 19:44:34] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
// Phase 1: matrix 424 rows 416 cols
[2022-05-16 19:44:34] [INFO ] Computed 25 place invariants in 17 ms
[2022-05-16 19:44:34] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 416/492 places, 424/517 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/492 places, 424/517 transitions.
Support contains 26 out of 416 places after structural reductions.
[2022-05-16 19:44:35] [INFO ] Flatten gal took : 92 ms
[2022-05-16 19:44:35] [INFO ] Flatten gal took : 43 ms
[2022-05-16 19:44:35] [INFO ] Input system was already deterministic with 424 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 24) seen :16
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 424 rows 416 cols
[2022-05-16 19:44:36] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 19:44:36] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 15 ms returned sat
[2022-05-16 19:44:36] [INFO ] After 350ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:1
[2022-05-16 19:44:37] [INFO ] After 593ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 19:44:37] [INFO ] After 895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 19:44:37] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 22 ms returned sat
[2022-05-16 19:44:37] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-16 19:44:38] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 123 ms.
[2022-05-16 19:44:38] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 424/424 transitions.
Graph (trivial) has 339 edges and 416 vertex of which 6 / 416 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 642 edges and 411 vertex of which 383 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 383 transition count 219
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 190 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 397 place count 188 transition count 214
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 397 place count 188 transition count 163
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 499 place count 137 transition count 163
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 524 place count 112 transition count 138
Iterating global reduction 3 with 25 rules applied. Total rules applied 549 place count 112 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 549 place count 112 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 551 place count 111 transition count 137
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 691 place count 41 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 106 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 693 place count 40 transition count 66
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 697 place count 40 transition count 62
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 716 place count 21 transition count 24
Iterating global reduction 5 with 19 rules applied. Total rules applied 735 place count 21 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 742 place count 17 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 27 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 744 place count 16 transition count 20
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 745 place count 16 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 748 place count 16 transition count 16
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 749 place count 16 transition count 16
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 750 place count 16 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 751 place count 15 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 752 place count 14 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 752 place count 14 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 760 place count 10 transition count 10
Applied a total of 760 rules in 63 ms. Remains 10 /416 variables (removed 406) and now considering 10/424 (removed 414) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/416 places, 10/424 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=8 )
FORMULA GPUForwardProgress-PT-24b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 76 stabilizing places and 76 stable transitions
Graph (complete) has 649 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.14 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Graph (trivial) has 347 edges and 416 vertex of which 6 / 416 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 643 edges and 411 vertex of which 383 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 382 transition count 218
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 207 rules applied. Total rules applied 405 place count 186 transition count 207
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 410 place count 181 transition count 207
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 410 place count 181 transition count 155
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 514 place count 129 transition count 155
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 537 place count 106 transition count 132
Iterating global reduction 3 with 23 rules applied. Total rules applied 560 place count 106 transition count 132
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 706 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 707 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 730 place count 10 transition count 13
Iterating global reduction 4 with 23 rules applied. Total rules applied 753 place count 10 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 755 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 757 place count 8 transition count 11
Applied a total of 757 rules in 37 ms. Remains 8 /416 variables (removed 408) and now considering 11/424 (removed 413) transitions.
[2022-05-16 19:44:38] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 19:44:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:44:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-16 19:44:38] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 19:44:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 19:44:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-16 19:44:38] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-16 19:44:38] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 19:44:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:44:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/416 places, 11/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/416 places, 11/424 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-03 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-03 finished in 425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(!(p0 U X((F(p1) U p0))))))))'
Support contains 2 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 410 transition count 418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 410 transition count 418
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 410 transition count 413
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 409 transition count 412
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 409 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 409 transition count 411
Applied a total of 20 rules in 76 ms. Remains 409 /416 variables (removed 7) and now considering 411/424 (removed 13) transitions.
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:44:39] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 19:44:39] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:44:39] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 19:44:39] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:44:39] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 19:44:39] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 409/416 places, 411/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 409/416 places, 411/424 transitions.
Stuttering acceptance computed with spot in 230 ms :[p0, false, p0, (AND p0 p1), false]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=p0, acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}, { cond=p0, acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={1, 2} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={2} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=4 dest: 3}]], initial=0, aps=[p0:(EQ s324 1), p1:(EQ s133 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1112 reset in 585 ms.
Product exploration explored 100000 steps with 1139 reset in 285 ms.
Computed a total of 76 stabilizing places and 76 stable transitions
Graph (complete) has 636 edges and 409 vertex of which 381 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Computed a total of 76 stabilizing places and 76 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 438 ms. Reduced automaton from 5 states, 16 edges and 2 AP to 5 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 177 ms :[p0, false, p0, (AND p0 p1), false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:44:41] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 19:44:42] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 24 ms returned sat
[2022-05-16 19:44:42] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 19:44:42] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 24 ms returned sat
[2022-05-16 19:44:42] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 19:44:42] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-05-16 19:44:42] [INFO ] After 602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 409/409 places, 411/411 transitions.
Graph (trivial) has 332 edges and 409 vertex of which 6 / 409 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 629 edges and 404 vertex of which 376 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 376 transition count 206
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 391 place count 183 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 182 transition count 205
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 392 place count 182 transition count 155
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 492 place count 132 transition count 155
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 517 place count 107 transition count 130
Iterating global reduction 3 with 25 rules applied. Total rules applied 542 place count 107 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 542 place count 107 transition count 129
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 544 place count 106 transition count 129
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 690 place count 33 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 89 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 692 place count 32 transition count 55
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 694 place count 32 transition count 53
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 715 place count 11 transition count 11
Iterating global reduction 5 with 21 rules applied. Total rules applied 736 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 739 place count 9 transition count 10
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 741 place count 8 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 742 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 743 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 746 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 747 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 747 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 749 place count 4 transition count 4
Applied a total of 749 rules in 40 ms. Remains 4 /409 variables (removed 405) and now considering 4/411 (removed 407) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/409 places, 4/411 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 637 ms. Reduced automaton from 5 states, 16 edges and 2 AP to 5 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 185 ms :[p0, false, p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 183 ms :[p0, false, p0, (AND p0 p1), false]
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 411/411 transitions.
Applied a total of 0 rules in 12 ms. Remains 409 /409 variables (removed 0) and now considering 411/411 (removed 0) transitions.
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:44:44] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 19:44:44] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:44:44] [INFO ] Computed 25 place invariants in 10 ms
[2022-05-16 19:44:44] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:44:44] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 19:44:44] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 409/409 places, 411/411 transitions.
Computed a total of 76 stabilizing places and 76 stable transitions
Graph (complete) has 636 edges and 409 vertex of which 381 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Computed a total of 76 stabilizing places and 76 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 532 ms. Reduced automaton from 5 states, 16 edges and 2 AP to 5 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 222 ms :[p0, false, p0, (AND p0 p1), false]
Incomplete random walk after 10000 steps, including 46 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:44:45] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 19:44:45] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 16 ms returned sat
[2022-05-16 19:44:46] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 19:44:46] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 15 ms returned sat
[2022-05-16 19:44:46] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 19:44:46] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-16 19:44:46] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 409/409 places, 411/411 transitions.
Graph (trivial) has 332 edges and 409 vertex of which 6 / 409 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 629 edges and 404 vertex of which 376 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 376 transition count 206
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 391 place count 183 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 182 transition count 205
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 392 place count 182 transition count 155
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 492 place count 132 transition count 155
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 517 place count 107 transition count 130
Iterating global reduction 3 with 25 rules applied. Total rules applied 542 place count 107 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 542 place count 107 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 544 place count 106 transition count 129
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 690 place count 33 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 89 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 692 place count 32 transition count 55
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 694 place count 32 transition count 53
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 715 place count 11 transition count 11
Iterating global reduction 5 with 21 rules applied. Total rules applied 736 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 739 place count 9 transition count 10
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 741 place count 8 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 742 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 743 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 746 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 747 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 747 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 749 place count 4 transition count 4
Applied a total of 749 rules in 44 ms. Remains 4 /409 variables (removed 405) and now considering 4/411 (removed 407) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/409 places, 4/411 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 559 ms. Reduced automaton from 5 states, 16 edges and 2 AP to 5 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 179 ms :[p0, false, p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 184 ms :[p0, false, p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 174 ms :[p0, false, p0, (AND p0 p1), false]
Product exploration explored 100000 steps with 1132 reset in 215 ms.
Product exploration explored 100000 steps with 1102 reset in 430 ms.
Built C files in :
/tmp/ltsmin3211744329437491857
[2022-05-16 19:44:48] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3211744329437491857
Running compilation step : cd /tmp/ltsmin3211744329437491857;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1032 ms.
Running link step : cd /tmp/ltsmin3211744329437491857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3211744329437491857;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5562867711946828078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 409/409 places, 411/411 transitions.
Applied a total of 0 rules in 9 ms. Remains 409 /409 variables (removed 0) and now considering 411/411 (removed 0) transitions.
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:45:03] [INFO ] Computed 25 place invariants in 7 ms
[2022-05-16 19:45:03] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:45:03] [INFO ] Computed 25 place invariants in 10 ms
[2022-05-16 19:45:04] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 409 cols
[2022-05-16 19:45:04] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 19:45:04] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 409/409 places, 411/411 transitions.
Built C files in :
/tmp/ltsmin1396794240627666715
[2022-05-16 19:45:04] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1396794240627666715
Running compilation step : cd /tmp/ltsmin1396794240627666715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 917 ms.
Running link step : cd /tmp/ltsmin1396794240627666715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1396794240627666715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18045635526723825003.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 19:45:19] [INFO ] Flatten gal took : 31 ms
[2022-05-16 19:45:19] [INFO ] Flatten gal took : 29 ms
[2022-05-16 19:45:19] [INFO ] Time to serialize gal into /tmp/LTL840833693997214098.gal : 11 ms
[2022-05-16 19:45:19] [INFO ] Time to serialize properties into /tmp/LTL5439658869546312087.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL840833693997214098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5439658869546312087.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8408336...265
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F(!(("(p382==1)")U(X((F("(p154==1)"))U("(p382==1)"))))))))))
Formula 0 simplified : !XFGF!("(p382==1)" U X(F"(p154==1)" U "(p382==1)"))
Detected timeout of ITS tools.
[2022-05-16 19:45:34] [INFO ] Flatten gal took : 27 ms
[2022-05-16 19:45:34] [INFO ] Applying decomposition
[2022-05-16 19:45:34] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12302316201132576966.txt' '-o' '/tmp/graph12302316201132576966.bin' '-w' '/tmp/graph12302316201132576966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12302316201132576966.bin' '-l' '-1' '-v' '-w' '/tmp/graph12302316201132576966.weights' '-q' '0' '-e' '0.001'
[2022-05-16 19:45:35] [INFO ] Decomposing Gal with order
[2022-05-16 19:45:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:45:35] [INFO ] Removed a total of 128 redundant transitions.
[2022-05-16 19:45:35] [INFO ] Flatten gal took : 111 ms
[2022-05-16 19:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-16 19:45:35] [INFO ] Time to serialize gal into /tmp/LTL4881679002758794532.gal : 12 ms
[2022-05-16 19:45:35] [INFO ] Time to serialize properties into /tmp/LTL5949064704516294649.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4881679002758794532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5949064704516294649.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4881679...245
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F(!(("(i20.i1.u141.p382==1)")U(X((F("(i8.i0.u58.p154==1)"))U("(i20.i1.u141.p382==1)"))))))))))
Formula 0 simplified : !XFGF!("(i20.i1.u141.p382==1)" U X(F"(i8.i0.u58.p154==1)" U "(i20.i1.u141.p382==1)"))
Reverse transition relation is NOT exact ! Due to transitions t374, i1.t369, i1.i1.u11.t362, i2.t356, i2.i0.t347, i3.t340, i3.i2.t333, i4.t326, i4.i0.t317,...839
Computing Next relation with stutter on 5.64842e+11 deadlock states
204 unique states visited
203 strongly connected components in search stack
205 transitions explored
204 items max in DFS search stack
524 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,5.3119,115136,1,0,240300,347,4455,288811,159,1059,352780
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-04 finished in 62367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Graph (trivial) has 347 edges and 416 vertex of which 6 / 416 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 643 edges and 411 vertex of which 383 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 382 transition count 219
Reduce places removed 195 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 206 rules applied. Total rules applied 403 place count 187 transition count 208
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 409 place count 182 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 410 place count 181 transition count 207
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 410 place count 181 transition count 156
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 512 place count 130 transition count 156
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 535 place count 107 transition count 133
Iterating global reduction 4 with 23 rules applied. Total rules applied 558 place count 107 transition count 133
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 706 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 707 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 730 place count 10 transition count 13
Iterating global reduction 5 with 23 rules applied. Total rules applied 753 place count 10 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 5 with 2 rules applied. Total rules applied 755 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 756 place count 8 transition count 11
Applied a total of 756 rules in 34 ms. Remains 8 /416 variables (removed 408) and now considering 11/424 (removed 413) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 19:45:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 19:45:41] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 19:45:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 19:45:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-16 19:45:41] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 19:45:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/416 places, 11/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/416 places, 11/424 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-05 finished in 173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)||p1))||G(p2)||p3)))'
Support contains 3 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 410 transition count 418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 410 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 410 transition count 414
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 409 transition count 413
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 409 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 409 transition count 412
Applied a total of 19 rules in 31 ms. Remains 409 /416 variables (removed 7) and now considering 412/424 (removed 12) transitions.
// Phase 1: matrix 412 rows 409 cols
[2022-05-16 19:45:41] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 19:45:41] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 412 rows 409 cols
[2022-05-16 19:45:41] [INFO ] Computed 25 place invariants in 8 ms
[2022-05-16 19:45:42] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
// Phase 1: matrix 412 rows 409 cols
[2022-05-16 19:45:42] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 19:45:42] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 409/416 places, 412/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 409/416 places, 412/424 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s191 0), p1:(EQ s138 1), p3:(EQ s395 1), p2:(EQ s138 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 463 ms.
Product exploration explored 100000 steps with 33333 reset in 477 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 637 edges and 409 vertex of which 381 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Detected a total of 75/409 stabilizing places and 75/412 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 6 states, 9 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-06 finished in 2273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 409 transition count 417
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 409 transition count 417
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 19 place count 409 transition count 412
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 408 transition count 411
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 408 transition count 411
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 408 transition count 410
Applied a total of 22 rules in 29 ms. Remains 408 /416 variables (removed 8) and now considering 410/424 (removed 14) transitions.
// Phase 1: matrix 410 rows 408 cols
[2022-05-16 19:45:43] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 19:45:44] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 410 rows 408 cols
[2022-05-16 19:45:44] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 19:45:44] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
// Phase 1: matrix 410 rows 408 cols
[2022-05-16 19:45:44] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 19:45:45] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 408/416 places, 410/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 408/416 places, 410/424 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-07 finished in 1360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))&&F(p1)&&F(p2))))'
Support contains 3 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 409 transition count 417
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 409 transition count 417
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 19 place count 409 transition count 412
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 408 transition count 411
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 408 transition count 411
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 408 transition count 410
Applied a total of 22 rules in 46 ms. Remains 408 /416 variables (removed 8) and now considering 410/424 (removed 14) transitions.
// Phase 1: matrix 410 rows 408 cols
[2022-05-16 19:45:45] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 19:45:45] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 410 rows 408 cols
[2022-05-16 19:45:45] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 19:45:46] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
// Phase 1: matrix 410 rows 408 cols
[2022-05-16 19:45:46] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 19:45:46] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 408/416 places, 410/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 408/416 places, 410/424 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p2), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s370 1), p2:(EQ s187 1), p0:(EQ s19 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 5 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-08 finished in 1535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U ((G(p1)&&(X(p2)||p3)) U p0))))'
Support contains 4 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 410 transition count 418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 410 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 410 transition count 414
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 409 transition count 413
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 409 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 409 transition count 412
Applied a total of 19 rules in 39 ms. Remains 409 /416 variables (removed 7) and now considering 412/424 (removed 12) transitions.
// Phase 1: matrix 412 rows 409 cols
[2022-05-16 19:45:46] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 19:45:46] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 412 rows 409 cols
[2022-05-16 19:45:46] [INFO ] Computed 25 place invariants in 6 ms
[2022-05-16 19:45:47] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
// Phase 1: matrix 412 rows 409 cols
[2022-05-16 19:45:47] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 19:45:47] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 409/416 places, 412/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 409/416 places, 412/424 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), true, (NOT p1), (AND p1 (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(EQ s322 1), p1:(EQ s242 1), p3:(EQ s363 1), p2:(EQ s327 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-09 finished in 1158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Graph (trivial) has 347 edges and 416 vertex of which 6 / 416 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 643 edges and 411 vertex of which 383 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 382 transition count 219
Reduce places removed 195 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 205 rules applied. Total rules applied 402 place count 187 transition count 209
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 407 place count 182 transition count 209
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 407 place count 182 transition count 158
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 509 place count 131 transition count 158
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 532 place count 108 transition count 135
Iterating global reduction 3 with 23 rules applied. Total rules applied 555 place count 108 transition count 135
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 703 place count 34 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 704 place count 34 transition count 60
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 727 place count 11 transition count 15
Iterating global reduction 4 with 23 rules applied. Total rules applied 750 place count 11 transition count 15
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 4 with 4 rules applied. Total rules applied 754 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 755 place count 8 transition count 13
Applied a total of 755 rules in 48 ms. Remains 8 /416 variables (removed 408) and now considering 13/424 (removed 411) transitions.
[2022-05-16 19:45:47] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2022-05-16 19:45:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-16 19:45:47] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2022-05-16 19:45:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 19:45:47] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-16 19:45:47] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-16 19:45:47] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2022-05-16 19:45:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 19:45:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/416 places, 13/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/416 places, 13/424 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-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-24b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-10 finished in 199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 2 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Graph (trivial) has 346 edges and 416 vertex of which 6 / 416 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 411 vertex of which 383 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 382 transition count 219
Reduce places removed 195 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 206 rules applied. Total rules applied 403 place count 187 transition count 208
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 409 place count 182 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 410 place count 181 transition count 207
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 410 place count 181 transition count 156
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 512 place count 130 transition count 156
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 535 place count 107 transition count 133
Iterating global reduction 4 with 23 rules applied. Total rules applied 558 place count 107 transition count 133
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 704 place count 34 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 705 place count 34 transition count 59
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 727 place count 12 transition count 16
Iterating global reduction 5 with 22 rules applied. Total rules applied 749 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 751 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 752 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 753 place count 10 transition count 14
Applied a total of 753 rules in 21 ms. Remains 10 /416 variables (removed 406) and now considering 14/424 (removed 410) transitions.
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:48] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 19:45:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 19:45:48] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 14 rows 10 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 19:45:48] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/416 places, 14/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/416 places, 14/424 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s6 1), p0:(EQ s2 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-13 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((p0 U (p1 U p2)))))))'
Support contains 6 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Graph (trivial) has 339 edges and 416 vertex of which 6 / 416 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 643 edges and 411 vertex of which 383 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 195 place count 382 transition count 221
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 200 rules applied. Total rules applied 395 place count 189 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 398 place count 186 transition count 214
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 398 place count 186 transition count 164
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 498 place count 136 transition count 164
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 521 place count 113 transition count 141
Iterating global reduction 3 with 23 rules applied. Total rules applied 544 place count 113 transition count 141
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 686 place count 42 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 687 place count 42 transition count 69
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 707 place count 22 transition count 30
Iterating global reduction 4 with 20 rules applied. Total rules applied 727 place count 22 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 733 place count 19 transition count 29
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 738 place count 19 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 739 place count 18 transition count 28
Applied a total of 739 rules in 50 ms. Remains 18 /416 variables (removed 398) and now considering 28/424 (removed 396) transitions.
[2022-05-16 19:45:48] [INFO ] Flow matrix only has 26 transitions (discarded 2 similar events)
// Phase 1: matrix 26 rows 18 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 19:45:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-16 19:45:48] [INFO ] Flow matrix only has 26 transitions (discarded 2 similar events)
// Phase 1: matrix 26 rows 18 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 19:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 19:45:48] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 19:45:48] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-16 19:45:48] [INFO ] Flow matrix only has 26 transitions (discarded 2 similar events)
// Phase 1: matrix 26 rows 18 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/416 places, 28/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/416 places, 28/424 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s5 1), p1:(NEQ s10 1), p0:(OR (EQ s2 1) (AND (EQ s9 1) (EQ s15 1) (EQ s17 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 163 steps with 11 reset in 4 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-14 finished in 339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U G(p2))))'
Support contains 3 out of 416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 416/416 places, 424/424 transitions.
Graph (trivial) has 344 edges and 416 vertex of which 6 / 416 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 643 edges and 411 vertex of which 383 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 195 place count 382 transition count 221
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 202 rules applied. Total rules applied 397 place count 189 transition count 212
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 402 place count 185 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 403 place count 184 transition count 211
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 403 place count 184 transition count 160
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 505 place count 133 transition count 160
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 528 place count 110 transition count 137
Iterating global reduction 4 with 23 rules applied. Total rules applied 551 place count 110 transition count 137
Performed 74 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 699 place count 36 transition count 62
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 721 place count 14 transition count 18
Iterating global reduction 4 with 22 rules applied. Total rules applied 743 place count 14 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 745 place count 13 transition count 18
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 747 place count 13 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 749 place count 11 transition count 16
Applied a total of 749 rules in 23 ms. Remains 11 /416 variables (removed 405) and now considering 16/424 (removed 408) transitions.
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 19:45:48] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 19:45:48] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 19:45:48] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 19:45:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 19:45:48] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/416 places, 16/424 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/416 places, 16/424 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s6 0) (EQ s3 0) (EQ s10 0) (EQ s6 0)), p1:(EQ s3 1), p2:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-15 finished in 310 ms.
All properties solved by simple procedures.
Total runtime 76235 ms.

BK_STOP 1652730349015

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-24b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-24b, 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 r096-smll-165260576100388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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