Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625400358.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is GPUForwardProgress-PT-28b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625400358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 22:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 22:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 22:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716555143950

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 12:52:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 12:52:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:52:25] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-24 12:52:25] [INFO ] Transformed 568 places.
[2024-05-24 12:52:25] [INFO ] Transformed 597 transitions.
[2024-05-24 12:52:25] [INFO ] Found NUPN structural information;
[2024-05-24 12:52:25] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 57 place count 511 transition count 541
Iterating global reduction 1 with 56 rules applied. Total rules applied 113 place count 511 transition count 541
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 138 place count 486 transition count 516
Iterating global reduction 1 with 25 rules applied. Total rules applied 163 place count 486 transition count 516
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 186 place count 486 transition count 493
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 485 transition count 492
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 485 transition count 492
Applied a total of 188 rules in 134 ms. Remains 485 /568 variables (removed 83) and now considering 492/597 (removed 105) transitions.
// Phase 1: matrix 492 rows 485 cols
[2024-05-24 12:52:26] [INFO ] Computed 29 invariants in 24 ms
[2024-05-24 12:52:26] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-24 12:52:26] [INFO ] Invariant cache hit.
[2024-05-24 12:52:26] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-05-24 12:52:26] [INFO ] Invariant cache hit.
[2024-05-24 12:52:26] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/568 places, 492/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1139 ms. Remains : 485/568 places, 492/597 transitions.
Support contains 27 out of 485 places after structural reductions.
[2024-05-24 12:52:26] [INFO ] Flatten gal took : 57 ms
[2024-05-24 12:52:27] [INFO ] Flatten gal took : 25 ms
[2024-05-24 12:52:27] [INFO ] Input system was already deterministic with 492 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 25) seen :16
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-24 12:52:27] [INFO ] Invariant cache hit.
[2024-05-24 12:52:28] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 12:52:28] [INFO ] After 432ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2024-05-24 12:52:28] [INFO ] After 485ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 12:52:28] [INFO ] After 874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 12:52:28] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-24 12:52:29] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-24 12:52:29] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 174 ms.
[2024-05-24 12:52:29] [INFO ] After 999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 108 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=54 )
Parikh walk visited 8 properties in 16 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 89 stabilizing places and 89 stable transitions
Graph (complete) has 753 edges and 485 vertex of which 453 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((p0||G(!p0)) U p1) U X(p2))&&F(p1)))'
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 478 transition count 485
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 478 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 478 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 474 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 474 transition count 477
Applied a total of 26 rules in 52 ms. Remains 474 /485 variables (removed 11) and now considering 477/492 (removed 15) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-24 12:52:30] [INFO ] Computed 29 invariants in 7 ms
[2024-05-24 12:52:30] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 12:52:30] [INFO ] Invariant cache hit.
[2024-05-24 12:52:30] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-24 12:52:30] [INFO ] Invariant cache hit.
[2024-05-24 12:52:30] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 474/485 places, 477/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 632 ms. Remains : 474/485 places, 477/492 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, p0, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s313 1), p0:(EQ s308 1), p2:(EQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 62530 steps with 568 reset in 188 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-01 finished in 1356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 63 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-24 12:52:31] [INFO ] Computed 29 invariants in 8 ms
[2024-05-24 12:52:31] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-24 12:52:31] [INFO ] Invariant cache hit.
[2024-05-24 12:52:31] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-24 12:52:31] [INFO ] Invariant cache hit.
[2024-05-24 12:52:31] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 637 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s339 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1057 reset in 191 ms.
Product exploration explored 100000 steps with 1045 reset in 234 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.6 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 84 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2024-05-24 12:52:33] [INFO ] Invariant cache hit.
[2024-05-24 12:52:33] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 12:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:52:33] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-05-24 12:52:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:52:34] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-24 12:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:52:34] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-24 12:52:34] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-24 12:52:34] [INFO ] Added : 77 causal constraints over 16 iterations in 501 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 7 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-24 12:52:34] [INFO ] Invariant cache hit.
[2024-05-24 12:52:34] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 12:52:34] [INFO ] Invariant cache hit.
[2024-05-24 12:52:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-24 12:52:35] [INFO ] Invariant cache hit.
[2024-05-24 12:52:35] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 472/472 places, 474/474 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 86 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2024-05-24 12:52:36] [INFO ] Invariant cache hit.
[2024-05-24 12:52:36] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 12:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:52:36] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-24 12:52:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:52:36] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-24 12:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:52:36] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-24 12:52:36] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 31 ms.
[2024-05-24 12:52:37] [INFO ] Added : 77 causal constraints over 16 iterations in 469 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1054 reset in 146 ms.
Product exploration explored 100000 steps with 1059 reset in 197 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Graph (trivial) has 385 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 729 edges and 467 vertex of which 435 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 224 rules applied. Total rules applied 226 place count 435 transition count 465
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 226 place count 435 transition count 467
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 256 place count 435 transition count 467
Discarding 165 places :
Symmetric choice reduction at 1 with 165 rule applications. Total rules 421 place count 270 transition count 302
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 165 rules applied. Total rules applied 586 place count 270 transition count 302
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 613 place count 243 transition count 275
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 640 place count 243 transition count 275
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 177 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 728 place count 243 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 730 place count 243 transition count 274
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 793 place count 180 transition count 210
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 856 place count 180 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 857 place count 180 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 858 place count 179 transition count 209
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 859 place count 179 transition count 209
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 887 place count 179 transition count 292
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 941 place count 125 transition count 184
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 995 place count 125 transition count 184
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1073 place count 47 transition count 54
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1151 place count 47 transition count 54
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 1151 rules in 126 ms. Remains 47 /472 variables (removed 425) and now considering 54/474 (removed 420) transitions.
[2024-05-24 12:52:38] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 54 rows 47 cols
[2024-05-24 12:52:38] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:52:38] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/472 places, 54/474 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 47/472 places, 54/474 transitions.
Built C files in :
/tmp/ltsmin1132206213817706410
[2024-05-24 12:52:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1132206213817706410
Running compilation step : cd /tmp/ltsmin1132206213817706410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 763 ms.
Running link step : cd /tmp/ltsmin1132206213817706410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1132206213817706410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14814755842101831569.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 10 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-24 12:52:53] [INFO ] Computed 29 invariants in 7 ms
[2024-05-24 12:52:53] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-24 12:52:53] [INFO ] Invariant cache hit.
[2024-05-24 12:52:53] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-24 12:52:53] [INFO ] Invariant cache hit.
[2024-05-24 12:52:54] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 592 ms. Remains : 472/472 places, 474/474 transitions.
Built C files in :
/tmp/ltsmin5235716428354790198
[2024-05-24 12:52:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5235716428354790198
Running compilation step : cd /tmp/ltsmin5235716428354790198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 698 ms.
Running link step : cd /tmp/ltsmin5235716428354790198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5235716428354790198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5679624002137030070.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:53:09] [INFO ] Flatten gal took : 23 ms
[2024-05-24 12:53:09] [INFO ] Flatten gal took : 21 ms
[2024-05-24 12:53:09] [INFO ] Time to serialize gal into /tmp/LTL17924948048202358209.gal : 5 ms
[2024-05-24 12:53:09] [INFO ] Time to serialize properties into /tmp/LTL3856871184759088546.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17924948048202358209.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7667039828701910462.hoa' '-atoms' '/tmp/LTL3856871184759088546.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p401==1)"))U(X(X(G("(p7==1)"))))))
Formula 0 simplified : G!"(p401==1)" R XXF!"(p7==1)"
Detected timeout of ITS tools.
[2024-05-24 12:53:39] [INFO ] Flatten gal took : 15 ms
[2024-05-24 12:53:39] [INFO ] Applying decomposition
[2024-05-24 12:53:39] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5219172477232532997.txt' '-o' '/tmp/graph5219172477232532997.bin' '-w' '/tmp/graph5219172477232532997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5219172477232532997.bin' '-l' '-1' '-v' '-w' '/tmp/graph5219172477232532997.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:53:39] [INFO ] Decomposing Gal with order
[2024-05-24 12:53:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:53:39] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-24 12:53:39] [INFO ] Flatten gal took : 64 ms
[2024-05-24 12:53:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-24 12:53:39] [INFO ] Time to serialize gal into /tmp/LTL16439710816057789792.gal : 7 ms
[2024-05-24 12:53:39] [INFO ] Time to serialize properties into /tmp/LTL8392213078201238232.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16439710816057789792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8392213078201238232.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i20.u141.p401==1)"))U(X(X(G("(i27.i1.i1.u2.p7==1)"))))))
Formula 0 simplified : G!"(i20.u141.p401==1)" R XXF!"(i27.i1.i1.u2.p7==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15465616788420618252
[2024-05-24 12:53:54] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15465616788420618252
Running compilation step : cd /tmp/ltsmin15465616788420618252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 673 ms.
Running link step : cd /tmp/ltsmin15465616788420618252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15465616788420618252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U X(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-03 finished in 98721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p1))))))'
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 30 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
[2024-05-24 12:54:10] [INFO ] Invariant cache hit.
[2024-05-24 12:54:10] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-24 12:54:10] [INFO ] Invariant cache hit.
[2024-05-24 12:54:10] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-24 12:54:10] [INFO ] Invariant cache hit.
[2024-05-24 12:54:10] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s16 1), p1:(OR (EQ s16 1) (AND (EQ s338 1) (EQ s459 1) (EQ s470 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1115 reset in 165 ms.
Product exploration explored 100000 steps with 1105 reset in 172 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.9 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-24 12:54:11] [INFO ] Invariant cache hit.
[2024-05-24 12:54:11] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 10 ms returned sat
[2024-05-24 12:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:12] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2024-05-24 12:54:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:54:12] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-24 12:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:13] [INFO ] [Nat]Absence check using state equation in 910 ms returned sat
[2024-05-24 12:54:13] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 28 ms.
[2024-05-24 12:54:16] [INFO ] Added : 415 causal constraints over 83 iterations in 3426 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 15 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-24 12:54:16] [INFO ] Invariant cache hit.
[2024-05-24 12:54:16] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-24 12:54:16] [INFO ] Invariant cache hit.
[2024-05-24 12:54:17] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-24 12:54:17] [INFO ] Invariant cache hit.
[2024-05-24 12:54:17] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 472/472 places, 474/474 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-24 12:54:17] [INFO ] Invariant cache hit.
[2024-05-24 12:54:18] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 10 ms returned sat
[2024-05-24 12:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:18] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-24 12:54:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:54:18] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-24 12:54:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:54:19] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2024-05-24 12:54:19] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 33 ms.
[2024-05-24 12:54:23] [INFO ] Added : 415 causal constraints over 83 iterations in 3465 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1112 reset in 153 ms.
Product exploration explored 100000 steps with 1113 reset in 154 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Graph (trivial) has 383 edges and 472 vertex of which 6 / 472 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 729 edges and 467 vertex of which 435 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 225 rules applied. Total rules applied 227 place count 435 transition count 465
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 227 place count 435 transition count 467
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 257 place count 435 transition count 467
Discarding 166 places :
Symmetric choice reduction at 1 with 166 rule applications. Total rules 423 place count 269 transition count 301
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 166 rules applied. Total rules applied 589 place count 269 transition count 301
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 616 place count 242 transition count 274
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 643 place count 242 transition count 274
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 729 place count 242 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 731 place count 242 transition count 273
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 792 place count 181 transition count 211
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 853 place count 181 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 854 place count 181 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 855 place count 180 transition count 210
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 856 place count 180 transition count 210
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 884 place count 180 transition count 293
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 938 place count 126 transition count 185
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 992 place count 126 transition count 185
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1070 place count 48 transition count 55
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1148 place count 48 transition count 55
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 1148 rules in 58 ms. Remains 48 /472 variables (removed 424) and now considering 55/474 (removed 419) transitions.
[2024-05-24 12:54:23] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 55 rows 48 cols
[2024-05-24 12:54:23] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:54:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/472 places, 55/474 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 48/472 places, 55/474 transitions.
Built C files in :
/tmp/ltsmin17271140196829318597
[2024-05-24 12:54:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17271140196829318597
Running compilation step : cd /tmp/ltsmin17271140196829318597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 658 ms.
Running link step : cd /tmp/ltsmin17271140196829318597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17271140196829318597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16633450255009058174.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 14 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-24 12:54:38] [INFO ] Computed 29 invariants in 5 ms
[2024-05-24 12:54:39] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-24 12:54:39] [INFO ] Invariant cache hit.
[2024-05-24 12:54:39] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-24 12:54:39] [INFO ] Invariant cache hit.
[2024-05-24 12:54:39] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 472/472 places, 474/474 transitions.
Built C files in :
/tmp/ltsmin11069985326913429457
[2024-05-24 12:54:39] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11069985326913429457
Running compilation step : cd /tmp/ltsmin11069985326913429457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 671 ms.
Running link step : cd /tmp/ltsmin11069985326913429457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11069985326913429457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14260772123279307309.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:54:54] [INFO ] Flatten gal took : 21 ms
[2024-05-24 12:54:54] [INFO ] Flatten gal took : 13 ms
[2024-05-24 12:54:54] [INFO ] Time to serialize gal into /tmp/LTL15509107417204129185.gal : 3 ms
[2024-05-24 12:54:54] [INFO ] Time to serialize properties into /tmp/LTL14419927639217390169.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15509107417204129185.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15752302034066720648.hoa' '-atoms' '/tmp/LTL14419927639217390169.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(p16==1)")||(X(X(F("((p16==1)||(((p400==1)&&(p549==1))&&(p564==1)))")))))))
Formula 0 simplified : G(!"(p16==1)" & XXG!"((p16==1)||(((p400==1)&&(p549==1))&&(p564==1)))")
Detected timeout of ITS tools.
[2024-05-24 12:55:24] [INFO ] Flatten gal took : 15 ms
[2024-05-24 12:55:24] [INFO ] Applying decomposition
[2024-05-24 12:55:24] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2143368413546684942.txt' '-o' '/tmp/graph2143368413546684942.bin' '-w' '/tmp/graph2143368413546684942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2143368413546684942.bin' '-l' '-1' '-v' '-w' '/tmp/graph2143368413546684942.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:55:24] [INFO ] Decomposing Gal with order
[2024-05-24 12:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:55:24] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-24 12:55:24] [INFO ] Flatten gal took : 32 ms
[2024-05-24 12:55:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 12:55:24] [INFO ] Time to serialize gal into /tmp/LTL16400787905680183596.gal : 4 ms
[2024-05-24 12:55:24] [INFO ] Time to serialize properties into /tmp/LTL12036182850724447393.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16400787905680183596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12036182850724447393.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(("(i29.i0.i0.u7.p16==1)")||(X(X(F("((i29.i0.i0.u7.p16==1)||(((i20.u136.p400==1)&&(i28.u187.p549==1))&&(i28.u187.p564==1)))"))))))...156
Formula 0 simplified : G(!"(i29.i0.i0.u7.p16==1)" & XXG!"((i29.i0.i0.u7.p16==1)||(((i20.u136.p400==1)&&(i28.u187.p549==1))&&(i28.u187.p564==1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11306762662669373671
[2024-05-24 12:55:39] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11306762662669373671
Running compilation step : cd /tmp/ltsmin11306762662669373671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 653 ms.
Running link step : cd /tmp/ltsmin11306762662669373671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11306762662669373671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-07 finished in 104889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(F(p1)))))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 478 transition count 485
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 478 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 478 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 474 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 474 transition count 477
Applied a total of 26 rules in 29 ms. Remains 474 /485 variables (removed 11) and now considering 477/492 (removed 15) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-24 12:55:55] [INFO ] Computed 29 invariants in 5 ms
[2024-05-24 12:55:55] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-24 12:55:55] [INFO ] Invariant cache hit.
[2024-05-24 12:55:55] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-24 12:55:55] [INFO ] Invariant cache hit.
[2024-05-24 12:55:55] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 474/485 places, 477/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 611 ms. Remains : 474/485 places, 477/492 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s254 1), p1:(EQ s307 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1223 reset in 143 ms.
Product exploration explored 100000 steps with 1218 reset in 163 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/474 stabilizing places and 87/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 77 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-24 12:55:56] [INFO ] Invariant cache hit.
[2024-05-24 12:55:56] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-24 12:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:55:57] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2024-05-24 12:55:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:55:57] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-24 12:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:55:57] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-05-24 12:55:57] [INFO ] Computed and/alt/rep : 471/619/471 causal constraints (skipped 5 transitions) in 26 ms.
[2024-05-24 12:55:58] [INFO ] Added : 208 causal constraints over 42 iterations in 1243 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2024-05-24 12:55:58] [INFO ] Invariant cache hit.
[2024-05-24 12:55:59] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-24 12:55:59] [INFO ] Invariant cache hit.
[2024-05-24 12:55:59] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-24 12:55:59] [INFO ] Invariant cache hit.
[2024-05-24 12:55:59] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 474/474 places, 477/477 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/474 stabilizing places and 87/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-24 12:56:00] [INFO ] Invariant cache hit.
[2024-05-24 12:56:00] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 12:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:56:00] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-05-24 12:56:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:56:00] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 12:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:56:01] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2024-05-24 12:56:01] [INFO ] Computed and/alt/rep : 471/619/471 causal constraints (skipped 5 transitions) in 23 ms.
[2024-05-24 12:56:02] [INFO ] Added : 208 causal constraints over 42 iterations in 1210 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1221 reset in 137 ms.
Product exploration explored 100000 steps with 1222 reset in 146 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Graph (trivial) has 387 edges and 474 vertex of which 6 / 474 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 732 edges and 469 vertex of which 437 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 226 rules applied. Total rules applied 228 place count 437 transition count 468
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 228 place count 437 transition count 470
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 258 place count 437 transition count 470
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 425 place count 270 transition count 303
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 592 place count 270 transition count 303
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 619 place count 243 transition count 276
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 646 place count 243 transition count 276
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 733 place count 243 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 735 place count 243 transition count 275
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 796 place count 182 transition count 213
Deduced a syphon composed of 115 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 857 place count 182 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 182 transition count 213
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 859 place count 181 transition count 212
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 860 place count 181 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 889 place count 181 transition count 300
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 943 place count 127 transition count 192
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 997 place count 127 transition count 192
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1075 place count 49 transition count 62
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1153 place count 49 transition count 62
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 1153 rules in 71 ms. Remains 49 /474 variables (removed 425) and now considering 62/477 (removed 415) transitions.
[2024-05-24 12:56:03] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 12:56:03] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
// Phase 1: matrix 61 rows 49 cols
[2024-05-24 12:56:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:56:03] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/474 places, 62/477 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 49/474 places, 62/477 transitions.
Built C files in :
/tmp/ltsmin8093170598212756408
[2024-05-24 12:56:03] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8093170598212756408
Running compilation step : cd /tmp/ltsmin8093170598212756408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 670 ms.
Running link step : cd /tmp/ltsmin8093170598212756408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8093170598212756408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5075199059708479580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Applied a total of 0 rules in 12 ms. Remains 474 /474 variables (removed 0) and now considering 477/477 (removed 0) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-24 12:56:18] [INFO ] Computed 29 invariants in 5 ms
[2024-05-24 12:56:18] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-24 12:56:18] [INFO ] Invariant cache hit.
[2024-05-24 12:56:18] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-24 12:56:18] [INFO ] Invariant cache hit.
[2024-05-24 12:56:18] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 607 ms. Remains : 474/474 places, 477/477 transitions.
Built C files in :
/tmp/ltsmin5402833973221132761
[2024-05-24 12:56:18] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5402833973221132761
Running compilation step : cd /tmp/ltsmin5402833973221132761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin5402833973221132761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5402833973221132761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13479926832350735216.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:56:33] [INFO ] Flatten gal took : 10 ms
[2024-05-24 12:56:33] [INFO ] Flatten gal took : 9 ms
[2024-05-24 12:56:33] [INFO ] Time to serialize gal into /tmp/LTL1351257308421338790.gal : 3 ms
[2024-05-24 12:56:33] [INFO ] Time to serialize properties into /tmp/LTL10229777220785982726.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1351257308421338790.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12948133611862260698.hoa' '-atoms' '/tmp/LTL10229777220785982726.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i17.u110.p299==1)")||(X(X(F("(i20.u130.p361==1)"))))))))
Formula 0 simplified : XG(!"(i17.u110.p299==1)" & XXG!"(i20.u130.p361==1)")
Reverse transition relation is NOT exact ! Due to transitions t434, i0.t107, i0.t99, i2.t429, i2.t422, i3.t416, i3.t406, i4.t399, i4.u27.t392, i5.t385, i5....839
Computing Next relation with stutter on 4.57533e+13 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
170 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,1.75012,81864,1,0,101050,278,4587,157760,155,634,733574
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-08 finished in 71186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 478 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 211 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 210 transition count 240
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 481 place count 210 transition count 181
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 599 place count 151 transition count 181
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 626 place count 124 transition count 154
Iterating global reduction 4 with 27 rules applied. Total rules applied 653 place count 124 transition count 154
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 827 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 828 place count 37 transition count 66
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 855 place count 10 transition count 13
Iterating global reduction 5 with 27 rules applied. Total rules applied 882 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 884 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 885 place count 8 transition count 11
Applied a total of 885 rules in 65 ms. Remains 8 /485 variables (removed 477) and now considering 11/492 (removed 481) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 12:57:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:57:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 12:57:06] [INFO ] Invariant cache hit.
[2024-05-24 12:57:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:57:06] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-24 12:57:06] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:57:06] [INFO ] Invariant cache hit.
[2024-05-24 12:57:06] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/485 places, 11/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 8/485 places, 11/492 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-09 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 s4 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 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-09 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(((p1&&X(!p2))||G(!p2))))))'
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 34 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-24 12:57:06] [INFO ] Computed 29 invariants in 3 ms
[2024-05-24 12:57:06] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-24 12:57:06] [INFO ] Invariant cache hit.
[2024-05-24 12:57:06] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-24 12:57:06] [INFO ] Invariant cache hit.
[2024-05-24 12:57:07] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2, p2]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s434 0), p2:(AND (EQ s364 1) (EQ s459 1) (EQ s470 1)), p1:(NEQ s396 1)], nbAcceptance=1, 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 414 reset in 257 ms.
Product exploration explored 100000 steps with 413 reset in 281 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.17 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 243 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p2, p2, p2, p2]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 12:57:08] [INFO ] Invariant cache hit.
[2024-05-24 12:57:08] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 33 ms returned sat
[2024-05-24 12:57:08] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:57:08] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-24 12:57:08] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 12:57:09] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-24 12:57:09] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 13 factoid took 299 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 150 ms :[p2, p2, p2, p2]
Support contains 4 out of 472 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 7 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-24 12:57:09] [INFO ] Invariant cache hit.
[2024-05-24 12:57:09] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-24 12:57:09] [INFO ] Invariant cache hit.
[2024-05-24 12:57:10] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-24 12:57:10] [INFO ] Invariant cache hit.
[2024-05-24 12:57:10] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 472/472 places, 474/474 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), true, (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 100 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p2, p2, p2, p2]
Incomplete random walk after 10000 steps, including 42 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 12:57:10] [INFO ] Invariant cache hit.
[2024-05-24 12:57:10] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-24 12:57:11] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:57:11] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-24 12:57:11] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 12:57:11] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 12:57:11] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 113 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), true, (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 8 factoid took 187 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 154 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 245 ms :[p2, p2, p2, p2]
Product exploration explored 100000 steps with 415 reset in 163 ms.
Product exploration explored 100000 steps with 411 reset in 178 ms.
Built C files in :
/tmp/ltsmin15597919791300172791
[2024-05-24 12:57:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15597919791300172791
Running compilation step : cd /tmp/ltsmin15597919791300172791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 683 ms.
Running link step : cd /tmp/ltsmin15597919791300172791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15597919791300172791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11863202868978818563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 15 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-24 12:57:27] [INFO ] Invariant cache hit.
[2024-05-24 12:57:27] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 12:57:27] [INFO ] Invariant cache hit.
[2024-05-24 12:57:28] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-24 12:57:28] [INFO ] Invariant cache hit.
[2024-05-24 12:57:28] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 472/472 places, 474/474 transitions.
Built C files in :
/tmp/ltsmin16018897383826144480
[2024-05-24 12:57:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16018897383826144480
Running compilation step : cd /tmp/ltsmin16018897383826144480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 706 ms.
Running link step : cd /tmp/ltsmin16018897383826144480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16018897383826144480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3963682514993228863.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:57:43] [INFO ] Flatten gal took : 10 ms
[2024-05-24 12:57:43] [INFO ] Flatten gal took : 9 ms
[2024-05-24 12:57:43] [INFO ] Time to serialize gal into /tmp/LTL5346300727265642530.gal : 2 ms
[2024-05-24 12:57:43] [INFO ] Time to serialize properties into /tmp/LTL6984451130630516420.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5346300727265642530.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16135447186257539040.hoa' '-atoms' '/tmp/LTL6984451130630516420.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p515==0)"))&&(G(F((G("(((p430!=1)||(p549!=1))||(p564!=1))"))||(("(p468!=1)")&&(X("(((p430!=1)||(p549!=1))||(p564!=1))"))))))))
Formula 0 simplified : G!"(p515==0)" | G(F!"(((p430!=1)||(p549!=1))||(p564!=1))" & FG(!"(p468!=1)" | X!"(((p430!=1)||(p549!=1))||(p564!=1))"))
Detected timeout of ITS tools.
[2024-05-24 12:58:13] [INFO ] Flatten gal took : 9 ms
[2024-05-24 12:58:13] [INFO ] Applying decomposition
[2024-05-24 12:58:13] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18314062285024770679.txt' '-o' '/tmp/graph18314062285024770679.bin' '-w' '/tmp/graph18314062285024770679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18314062285024770679.bin' '-l' '-1' '-v' '-w' '/tmp/graph18314062285024770679.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:58:13] [INFO ] Decomposing Gal with order
[2024-05-24 12:58:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:58:13] [INFO ] Removed a total of 146 redundant transitions.
[2024-05-24 12:58:13] [INFO ] Flatten gal took : 19 ms
[2024-05-24 12:58:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 12:58:13] [INFO ] Time to serialize gal into /tmp/LTL13632852181710120394.gal : 4 ms
[2024-05-24 12:58:13] [INFO ] Time to serialize properties into /tmp/LTL7220803794986096352.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13632852181710120394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7220803794986096352.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i28.i2.u192.p515==0)"))&&(G(F((G("(((i23.i0.u155.p430!=1)||(i29.u197.p549!=1))||(i29.u199.p564!=1))"))||(("(i25.i2.u170.p468!=...239
Formula 0 simplified : G!"(i28.i2.u192.p515==0)" | G(F!"(((i23.i0.u155.p430!=1)||(i29.u197.p549!=1))||(i29.u199.p564!=1))" & FG(!"(i25.i2.u170.p468!=1)" | ...226
Reverse transition relation is NOT exact ! Due to transitions t434, i1.t429, i1.i0.t422, i2.t416, i2.i0.t406, i3.t399, i3.i1.u27.t392, i4.t385, i4.i1.u32.t...923
Computing Next relation with stutter on 4.57533e+13 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8623554605705419500
[2024-05-24 12:58:28] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8623554605705419500
Running compilation step : cd /tmp/ltsmin8623554605705419500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 684 ms.
Running link step : cd /tmp/ltsmin8623554605705419500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8623554605705419500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&[](<>(([]((LTLAPp1==true))||((LTLAPp2==true)&&X((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-10 finished in 97536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)&&p0) U X(G((p2 U p3)))))'
Support contains 6 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 31 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
[2024-05-24 12:58:43] [INFO ] Invariant cache hit.
[2024-05-24 12:58:44] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-24 12:58:44] [INFO ] Invariant cache hit.
[2024-05-24 12:58:44] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-24 12:58:44] [INFO ] Invariant cache hit.
[2024-05-24 12:58:44] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p3 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p3:(EQ s27 1), p2:(EQ s112 1), p0:(AND (EQ s319 1) (EQ s459 1) (EQ s470 1) (EQ s97 1)), p1:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-11 finished in 944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 478 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 479 place count 211 transition count 180
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 601 place count 150 transition count 180
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 628 place count 123 transition count 153
Iterating global reduction 3 with 27 rules applied. Total rules applied 655 place count 123 transition count 153
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 827 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 828 place count 37 transition count 66
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 856 place count 9 transition count 11
Iterating global reduction 4 with 28 rules applied. Total rules applied 884 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 886 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 887 place count 7 transition count 9
Applied a total of 887 rules in 23 ms. Remains 7 /485 variables (removed 478) and now considering 9/492 (removed 483) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-24 12:58:44] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:58:44] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 12:58:44] [INFO ] Invariant cache hit.
[2024-05-24 12:58:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:58:44] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 12:58:44] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 12:58:44] [INFO ] Invariant cache hit.
[2024-05-24 12:58:44] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/485 places, 9/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 7/485 places, 9/492 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-12 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 399 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 476 place count 212 transition count 243
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 476 place count 212 transition count 185
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 592 place count 154 transition count 185
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 618 place count 128 transition count 159
Iterating global reduction 2 with 26 rules applied. Total rules applied 644 place count 128 transition count 159
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 814 place count 43 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 815 place count 43 transition count 73
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 841 place count 17 transition count 22
Iterating global reduction 3 with 26 rules applied. Total rules applied 867 place count 17 transition count 22
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 3 with 6 rules applied. Total rules applied 873 place count 14 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 875 place count 14 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 876 place count 13 transition count 20
Applied a total of 876 rules in 20 ms. Remains 13 /485 variables (removed 472) and now considering 20/492 (removed 472) transitions.
[2024-05-24 12:58:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 12:58:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:58:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 12:58:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-24 12:58:45] [INFO ] Invariant cache hit.
[2024-05-24 12:58:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:58:45] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 12:58:45] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 12:58:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-24 12:58:45] [INFO ] Invariant cache hit.
[2024-05-24 12:58:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/485 places, 20/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 13/485 places, 20/492 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s3 1) (NEQ s10 1) (NEQ s12 1) (NEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7879 reset in 159 ms.
Product exploration explored 100000 steps with 7935 reset in 136 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2772 steps, including 228 resets, run visited all 1 properties in 14 ms. (steps per millisecond=198 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 12:58:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-24 12:58:46] [INFO ] Invariant cache hit.
[2024-05-24 12:58:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:58:46] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-24 12:58:46] [INFO ] Invariant cache hit.
[2024-05-24 12:58:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:58:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 12:58:46] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 12:58:46] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-24 12:58:46] [INFO ] Invariant cache hit.
[2024-05-24 12:58:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 13/13 places, 20/20 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 196 steps, including 16 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7929 reset in 83 ms.
Product exploration explored 100000 steps with 7842 reset in 90 ms.
Built C files in :
/tmp/ltsmin3061006944690710050
[2024-05-24 12:58:46] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2024-05-24 12:58:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:58:46] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2024-05-24 12:58:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:58:46] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2024-05-24 12:58:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:58:46] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3061006944690710050
Running compilation step : cd /tmp/ltsmin3061006944690710050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin3061006944690710050;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3061006944690710050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12281753213261875883.hoa' '--buchi-type=spotba'
LTSmin run took 503 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-13 finished in 2400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 402 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 236 place count 447 transition count 248
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 475 place count 213 transition count 243
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 477 place count 212 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 478 place count 211 transition count 242
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 478 place count 211 transition count 184
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 594 place count 153 transition count 184
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 621 place count 126 transition count 157
Iterating global reduction 4 with 27 rules applied. Total rules applied 648 place count 126 transition count 157
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 822 place count 39 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 823 place count 39 transition count 69
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 849 place count 13 transition count 18
Iterating global reduction 5 with 26 rules applied. Total rules applied 875 place count 13 transition count 18
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 5 with 4 rules applied. Total rules applied 879 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 880 place count 10 transition count 16
Applied a total of 880 rules in 19 ms. Remains 10 /485 variables (removed 475) and now considering 16/492 (removed 476) transitions.
[2024-05-24 12:58:47] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2024-05-24 12:58:47] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 12:58:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:58:47] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-24 12:58:47] [INFO ] Invariant cache hit.
[2024-05-24 12:58:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:58:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 12:58:47] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 12:58:47] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-24 12:58:47] [INFO ] Invariant cache hit.
[2024-05-24 12:58:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/485 places, 16/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 10/485 places, 16/492 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-14 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(G(p1)))) U p2)))'
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 479 transition count 486
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 479 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 479 transition count 485
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 475 transition count 481
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 475 transition count 481
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 475 transition count 478
Applied a total of 24 rules in 28 ms. Remains 475 /485 variables (removed 10) and now considering 478/492 (removed 14) transitions.
// Phase 1: matrix 478 rows 475 cols
[2024-05-24 12:58:47] [INFO ] Computed 29 invariants in 6 ms
[2024-05-24 12:58:47] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-24 12:58:47] [INFO ] Invariant cache hit.
[2024-05-24 12:58:48] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-24 12:58:48] [INFO ] Invariant cache hit.
[2024-05-24 12:58:48] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 475/485 places, 478/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 475/485 places, 478/492 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s437 1), p0:(NEQ s82 1), p1:(NEQ s364 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]]
Product exploration explored 100000 steps with 457 reset in 231 ms.
Product exploration explored 100000 steps with 462 reset in 239 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 739 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/475 stabilizing places and 88/478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 157 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 42 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 12:58:49] [INFO ] Invariant cache hit.
[2024-05-24 12:58:49] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 12:58:49] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 12:58:49] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 12:58:49] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 12:58:50] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-24 12:58:50] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 142 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=47 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 397 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2024-05-24 12:58:50] [INFO ] Invariant cache hit.
[2024-05-24 12:58:51] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-24 12:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:58:51] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2024-05-24 12:58:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:58:51] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 12:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:58:51] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-24 12:58:51] [INFO ] Computed and/alt/rep : 472/620/472 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-24 12:58:54] [INFO ] Added : 300 causal constraints over 62 iterations in 2436 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-05-24 12:58:54] [INFO ] Invariant cache hit.
[2024-05-24 12:58:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-24 12:58:54] [INFO ] Invariant cache hit.
[2024-05-24 12:58:54] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-24 12:58:54] [INFO ] Invariant cache hit.
[2024-05-24 12:58:54] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 475/475 places, 478/478 transitions.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 739 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/475 stabilizing places and 88/478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 169 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :4
Finished Best-First random walk after 9099 steps, including 3 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1516 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 326 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2024-05-24 12:58:56] [INFO ] Invariant cache hit.
[2024-05-24 12:58:56] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 12:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:58:56] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2024-05-24 12:58:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:58:56] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-24 12:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:58:56] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-24 12:58:56] [INFO ] Computed and/alt/rep : 472/620/472 causal constraints (skipped 5 transitions) in 24 ms.
[2024-05-24 12:58:59] [INFO ] Added : 300 causal constraints over 62 iterations in 2465 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 450 reset in 146 ms.
Product exploration explored 100000 steps with 460 reset in 152 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Graph (trivial) has 386 edges and 475 vertex of which 6 / 475 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 733 edges and 470 vertex of which 438 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 226 rules applied. Total rules applied 228 place count 438 transition count 469
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 228 place count 438 transition count 471
Deduced a syphon composed of 256 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 258 place count 438 transition count 471
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 425 place count 271 transition count 304
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 592 place count 271 transition count 304
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 619 place count 244 transition count 277
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 646 place count 244 transition count 277
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 733 place count 244 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 735 place count 244 transition count 276
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 796 place count 183 transition count 214
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 857 place count 183 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 183 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 859 place count 182 transition count 213
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 860 place count 182 transition count 213
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 888 place count 182 transition count 298
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 940 place count 130 transition count 194
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 992 place count 130 transition count 194
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1067 place count 55 transition count 69
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 1142 place count 55 transition count 69
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 1142 rules in 43 ms. Remains 55 /475 variables (removed 420) and now considering 69/478 (removed 409) transitions.
[2024-05-24 12:59:00] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 12:59:00] [INFO ] Flow matrix only has 68 transitions (discarded 1 similar events)
// Phase 1: matrix 68 rows 55 cols
[2024-05-24 12:59:00] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:59:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/475 places, 69/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 55/475 places, 69/478 transitions.
Built C files in :
/tmp/ltsmin16411711260022173076
[2024-05-24 12:59:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16411711260022173076
Running compilation step : cd /tmp/ltsmin16411711260022173076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 696 ms.
Running link step : cd /tmp/ltsmin16411711260022173076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16411711260022173076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10313750288439788078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Applied a total of 0 rules in 15 ms. Remains 475 /475 variables (removed 0) and now considering 478/478 (removed 0) transitions.
// Phase 1: matrix 478 rows 475 cols
[2024-05-24 12:59:15] [INFO ] Computed 29 invariants in 9 ms
[2024-05-24 12:59:15] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-24 12:59:15] [INFO ] Invariant cache hit.
[2024-05-24 12:59:15] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-24 12:59:15] [INFO ] Invariant cache hit.
[2024-05-24 12:59:15] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 475/475 places, 478/478 transitions.
Built C files in :
/tmp/ltsmin17198514444005784917
[2024-05-24 12:59:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17198514444005784917
Running compilation step : cd /tmp/ltsmin17198514444005784917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin17198514444005784917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17198514444005784917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased177764823161551928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 12:59:31] [INFO ] Flatten gal took : 8 ms
[2024-05-24 12:59:31] [INFO ] Flatten gal took : 9 ms
[2024-05-24 12:59:31] [INFO ] Time to serialize gal into /tmp/LTL2742070237483937048.gal : 2 ms
[2024-05-24 12:59:31] [INFO ] Time to serialize properties into /tmp/LTL43825283309647232.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2742070237483937048.gal' '-t' 'CGAL' '-hoa' '/tmp/aut475477159339976375.hoa' '-atoms' '/tmp/LTL43825283309647232.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(("(p91!=1)")||(X(G("(p428!=1)")))))U("(p515==1)"))))
Formula 0 simplified : X(F(!"(p91!=1)" & XF!"(p428!=1)") R !"(p515==1)")
Detected timeout of ITS tools.
[2024-05-24 13:00:01] [INFO ] Flatten gal took : 10 ms
[2024-05-24 13:00:01] [INFO ] Applying decomposition
[2024-05-24 13:00:01] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7771366441377475982.txt' '-o' '/tmp/graph7771366441377475982.bin' '-w' '/tmp/graph7771366441377475982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7771366441377475982.bin' '-l' '-1' '-v' '-w' '/tmp/graph7771366441377475982.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:00:01] [INFO ] Decomposing Gal with order
[2024-05-24 13:00:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:00:01] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-24 13:00:01] [INFO ] Flatten gal took : 20 ms
[2024-05-24 13:00:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 13:00:01] [INFO ] Time to serialize gal into /tmp/LTL4187354046875901932.gal : 4 ms
[2024-05-24 13:00:01] [INFO ] Time to serialize properties into /tmp/LTL9888969589470909837.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4187354046875901932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9888969589470909837.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G(("(i5.u36.p91!=1)")||(X(G("(i23.u159.p428!=1)")))))U("(i28.u188.p515==1)"))))
Formula 0 simplified : X(F(!"(i5.u36.p91!=1)" & XF!"(i23.u159.p428!=1)") R !"(i28.u188.p515==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7249920720125626671
[2024-05-24 13:00:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7249920720125626671
Running compilation step : cd /tmp/ltsmin7249920720125626671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin7249920720125626671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7249920720125626671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](((LTLAPp0==true)||X([]((LTLAPp1==true))))) U (LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-15 finished in 103877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-03
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 478 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 479 place count 211 transition count 181
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 599 place count 151 transition count 181
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 626 place count 124 transition count 154
Iterating global reduction 3 with 27 rules applied. Total rules applied 653 place count 124 transition count 154
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 823 place count 39 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 824 place count 39 transition count 68
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 851 place count 12 transition count 15
Iterating global reduction 4 with 27 rules applied. Total rules applied 878 place count 12 transition count 15
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 880 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 881 place count 10 transition count 13
Applied a total of 881 rules in 16 ms. Remains 10 /485 variables (removed 475) and now considering 13/492 (removed 479) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-24 13:00:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 13:00:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-24 13:00:31] [INFO ] Invariant cache hit.
[2024-05-24 13:00:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:00:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-24 13:00:31] [INFO ] Invariant cache hit.
[2024-05-24 13:00:31] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/485 places, 13/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 120 ms. Remains : 10/485 places, 13/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s6 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-03 finished in 371 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p1))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-07
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 401 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 447 transition count 246
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 480 place count 211 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 481 place count 210 transition count 240
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 481 place count 210 transition count 182
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 597 place count 152 transition count 182
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 624 place count 125 transition count 155
Iterating global reduction 3 with 27 rules applied. Total rules applied 651 place count 125 transition count 155
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 821 place count 40 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 822 place count 40 transition count 69
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 849 place count 13 transition count 16
Iterating global reduction 4 with 27 rules applied. Total rules applied 876 place count 13 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 4 with 2 rules applied. Total rules applied 878 place count 12 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 879 place count 11 transition count 14
Applied a total of 879 rules in 16 ms. Remains 11 /485 variables (removed 474) and now considering 14/492 (removed 478) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-05-24 13:00:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 13:00:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 13:00:32] [INFO ] Invariant cache hit.
[2024-05-24 13:00:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:00:32] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-24 13:00:32] [INFO ] Invariant cache hit.
[2024-05-24 13:00:32] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/485 places, 14/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 93 ms. Remains : 11/485 places, 14/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s1 1), p1:(OR (EQ s1 1) (AND (EQ s5 1) (EQ s8 1) (EQ s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 45 steps with 11 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-07 finished in 295 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(((p1&&X(!p2))||G(!p2))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-10
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2, p2]
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 397 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 235 place count 447 transition count 249
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 474 place count 214 transition count 243
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 477 place count 213 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 479 place count 211 transition count 183
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 595 place count 153 transition count 183
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 621 place count 127 transition count 157
Iterating global reduction 4 with 26 rules applied. Total rules applied 647 place count 127 transition count 157
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 813 place count 44 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 814 place count 44 transition count 73
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 840 place count 18 transition count 22
Iterating global reduction 5 with 26 rules applied. Total rules applied 866 place count 18 transition count 22
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 5 with 4 rules applied. Total rules applied 870 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 871 place count 15 transition count 20
Applied a total of 871 rules in 20 ms. Remains 15 /485 variables (removed 470) and now considering 20/492 (removed 472) transitions.
[2024-05-24 13:00:32] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2024-05-24 13:00:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 13:00:32] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-24 13:00:32] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-24 13:00:32] [INFO ] Invariant cache hit.
[2024-05-24 13:00:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 13:00:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-24 13:00:32] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-24 13:00:32] [INFO ] Invariant cache hit.
[2024-05-24 13:00:32] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/485 places, 20/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 207 ms. Remains : 15/485 places, 20/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s9 0), p2:(AND (EQ s3 1) (EQ s12 1) (EQ s14 1)), p1:(NEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8301 reset in 85 ms.
Product exploration explored 100000 steps with 8429 reset in 85 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/15 stabilizing places and 7/20 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 293 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p2, p2, p2, p2]
Finished random walk after 857 steps, including 74 resets, run visited all 4 properties in 8 ms. (steps per millisecond=107 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 11 factoid took 431 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 147 ms :[p2, p2, p2, p2]
Support contains 4 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 13:00:34] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-24 13:00:34] [INFO ] Invariant cache hit.
[2024-05-24 13:00:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 13:00:34] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-24 13:00:34] [INFO ] Invariant cache hit.
[2024-05-24 13:00:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 13:00:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-24 13:00:34] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-24 13:00:34] [INFO ] Invariant cache hit.
[2024-05-24 13:00:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 15/15 places, 20/20 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), true, (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 99 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[p2, p2, p2, p2]
Finished random walk after 1468 steps, including 138 resets, run visited all 4 properties in 5 ms. (steps per millisecond=293 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), true, (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 8 factoid took 190 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 165 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 208 ms :[p2, p2, p2, p2]
Product exploration explored 100000 steps with 8436 reset in 86 ms.
Product exploration explored 100000 steps with 8350 reset in 92 ms.
Built C files in :
/tmp/ltsmin15724202902694368729
[2024-05-24 13:00:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15724202902694368729
Running compilation step : cd /tmp/ltsmin15724202902694368729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin15724202902694368729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15724202902694368729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3082073165930871299.hoa' '--buchi-type=spotba'
LTSmin run took 310 ms.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-10 finished in 3737 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(G(p1)))) U p2)))'
[2024-05-24 13:00:36] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9686037077024510049
[2024-05-24 13:00:36] [INFO ] Computing symmetric may disable matrix : 492 transitions.
[2024-05-24 13:00:36] [INFO ] Applying decomposition
[2024-05-24 13:00:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:00:36] [INFO ] Computing symmetric may enable matrix : 492 transitions.
[2024-05-24 13:00:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:00:36] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2132171757824602150.txt' '-o' '/tmp/graph2132171757824602150.bin' '-w' '/tmp/graph2132171757824602150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2132171757824602150.bin' '-l' '-1' '-v' '-w' '/tmp/graph2132171757824602150.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:00:36] [INFO ] Decomposing Gal with order
[2024-05-24 13:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:00:36] [INFO ] Computing Do-Not-Accords matrix : 492 transitions.
[2024-05-24 13:00:36] [INFO ] Removed a total of 144 redundant transitions.
[2024-05-24 13:00:36] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:00:36] [INFO ] Flatten gal took : 20 ms
[2024-05-24 13:00:36] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9686037077024510049
Running compilation step : cd /tmp/ltsmin9686037077024510049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 13:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 13:00:36] [INFO ] Time to serialize gal into /tmp/LTLFireability6228263329127104641.gal : 5 ms
[2024-05-24 13:00:36] [INFO ] Time to serialize properties into /tmp/LTLFireability2295984941655247359.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6228263329127104641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2295984941655247359.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(("(i0.i1.u7.p16==1)")||(X(X(F("((i0.i1.u7.p16==1)||(((i21.i2.u146.p400==1)&&(i29.i1.u196.p549==1))&&(i29.i1.u200.p564==1)))")))))...157
Formula 0 simplified : G(!"(i0.i1.u7.p16==1)" & XXG!"((i0.i1.u7.p16==1)||(((i21.i2.u146.p400==1)&&(i29.i1.u196.p549==1))&&(i29.i1.u200.p564==1)))")
Reverse transition relation is NOT exact ! Due to transitions t434, i1.t429, i1.i2.t422, i2.t416, i2.i0.t406, i3.t399, i3.i1.t392, i4.t385, i4.i1.u33.t375,...966
Computing Next relation with stutter on 4.57533e+13 deadlock states
Compilation finished in 1001 ms.
Running link step : cd /tmp/ltsmin9686037077024510049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9686037077024510049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp2==true)||X(X(<>((LTLAPp3==true))))))' '--buchi-type=spotba'
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
189 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,1.9421,76596,1,0,117605,347,4783,173278,154,726,325797
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("(i28.i1.u185.p515==0)"))&&(G(F((("(i25.i1.u168.p468!=1)")&&(X(!("(((i23.i0.u155.p430==1)&&(i29.i1.u196.p549==1))&&(i29.i1.u200....257
Formula 1 simplified : G!"(i28.i1.u185.p515==0)" | G(F"(((i23.i0.u155.p430==1)&&(i29.i1.u196.p549==1))&&(i29.i1.u200.p564==1))" & FG(!"(i25.i1.u168.p468!=1...236
Computing Next relation with stutter on 4.57533e+13 deadlock states
595 unique states visited
351 strongly connected components in search stack
597 transitions explored
595 items max in DFS search stack
8745 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,89.3887,771392,1,0,1.51821e+06,388,5149,2.85974e+06,159,1275,1457599
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((G(("(i4.i0.u37.p91!=1)")||(X(G("(i23.i2.u159.p428!=1)")))))U("(i28.i1.u185.p515==1)"))))
Formula 2 simplified : X(F(!"(i4.i0.u37.p91!=1)" & XF!"(i23.i2.u159.p428!=1)") R !"(i28.i1.u185.p515==1)")
Computing Next relation with stutter on 4.57533e+13 deadlock states
239 unique states visited
14 strongly connected components in search stack
241 transitions explored
234 items max in DFS search stack
173 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,91.1211,800812,1,0,1.58835e+06,388,5328,2.93498e+06,159,1275,1586948
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 717349 ms.

BK_STOP 1716555863639

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-28b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is GPUForwardProgress-PT-28b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625400358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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