Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156000165.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-20a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156000165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 24K May 12 08:13 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-20a-00
FORMULA_NAME GPUForwardProgress-PT-20a-01
FORMULA_NAME GPUForwardProgress-PT-20a-02
FORMULA_NAME GPUForwardProgress-PT-20a-03
FORMULA_NAME GPUForwardProgress-PT-20a-04
FORMULA_NAME GPUForwardProgress-PT-20a-05
FORMULA_NAME GPUForwardProgress-PT-20a-06
FORMULA_NAME GPUForwardProgress-PT-20a-07
FORMULA_NAME GPUForwardProgress-PT-20a-08
FORMULA_NAME GPUForwardProgress-PT-20a-09
FORMULA_NAME GPUForwardProgress-PT-20a-10
FORMULA_NAME GPUForwardProgress-PT-20a-11
FORMULA_NAME GPUForwardProgress-PT-20a-12
FORMULA_NAME GPUForwardProgress-PT-20a-13
FORMULA_NAME GPUForwardProgress-PT-20a-14
FORMULA_NAME GPUForwardProgress-PT-20a-15

=== Now, execution of the tool begins

BK_START 1621272156187

Running Version 0
[2021-05-17 17:22:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 17:22:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 17:22:37] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-17 17:22:37] [INFO ] Transformed 88 places.
[2021-05-17 17:22:37] [INFO ] Transformed 109 transitions.
[2021-05-17 17:22:37] [INFO ] Found NUPN structural information;
[2021-05-17 17:22:37] [INFO ] Parsed PT model containing 88 places and 109 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 17:22:37] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Support contains 55 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Applied a total of 0 rules in 10 ms. Remains 88 /88 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 88 cols
[2021-05-17 17:22:38] [INFO ] Computed 22 place invariants in 13 ms
[2021-05-17 17:22:38] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 87 rows 88 cols
[2021-05-17 17:22:38] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 17:22:38] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:38] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 88 cols
[2021-05-17 17:22:38] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 17:22:38] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 87/87 transitions.
[2021-05-17 17:22:38] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 17:22:38] [INFO ] Flatten gal took : 37 ms
FORMULA GPUForwardProgress-PT-20a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 17:22:38] [INFO ] Flatten gal took : 13 ms
[2021-05-17 17:22:38] [INFO ] Input system was already deterministic with 87 transitions.
Incomplete random walk after 100000 steps, including 301 resets, run finished after 408 ms. (steps per millisecond=245 ) properties (out of 33) seen :32
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 88 cols
[2021-05-17 17:22:39] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 17:22:39] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 5 ms returned sat
[2021-05-17 17:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 17:22:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 17:22:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:39] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2021-05-17 17:22:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 17:22:39] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 5 ms returned sat
[2021-05-17 17:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 17:22:39] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-17 17:22:39] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2021-05-17 17:22:39] [INFO ] Computed and/alt/rep : 80/300/80 causal constraints (skipped 6 transitions) in 9 ms.
[2021-05-17 17:22:39] [INFO ] Added : 80 causal constraints over 16 iterations in 140 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0||X((F(p1)&&(F(p2) U p3))))) U G(p4)))], workingDir=/home/mcc/execution]
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 4 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:39] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 17:22:39] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:39] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:22:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:39] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:39] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 509 ms :[(NOT p4), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (NOT p3) (NOT p1)), (NOT p1), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : GPUForwardProgress-PT-20a-00 automaton TGBA [mat=[[{ cond=(NOT p4), acceptance={0} source=0 dest: 0}, { cond=p4, acceptance={} source=0 dest: 0}, { cond=(NOT p4), acceptance={} source=0 dest: 1}, { cond=p4, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p4 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(NOT p3), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p4 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p4 (NOT p3)), acceptance={} source=7 dest: 9}, { cond=(AND p4 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p4 (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND p4 (NOT p3)), acceptance={} source=9 dest: 9}, { cond=(AND p4 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND p4 (NOT p2)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p4:(AND (EQ s24 1) (EQ s82 1) (EQ s86 1)), p0:(EQ s27 1), p1:(EQ s58 1), p3:(AND (EQ s78 1) (EQ s82 1) (EQ s86 1)), p2:(OR (EQ s20 0) (EQ s82 0) (EQ s86 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-00 finished in 787 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((X(X(!p1))||p0))&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 3 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:40] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:40] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:40] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 17:22:40] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:40] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:22:40] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-20a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s58 1) (NEQ s82 1) (NEQ s86 1)), p2:(AND (EQ s58 1) (EQ s82 1) (EQ s86 1)), p1:(AND (EQ s78 1) (EQ s82 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-01 finished in 398 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0&&X((G(p2)||p1)))) U (X(G((p0&&X((G(p2)||p3)))))||(X((p0&&X((G(p2)||p4))))&&F(((p0&&F(p5))||G(F(p5))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 3 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:40] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:40] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:40] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-17 17:22:40] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:40] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:40] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 17:22:40] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 1139 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), true, (AND p0 (NOT p1) (NOT p4) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p5))), (AND (NOT p5) p0), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p5))), (NOT p5), (AND (NOT p2) (NOT p3) (NOT p5)), (NOT p2), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p0) p3) (AND (NOT p0) p2)), (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) (NOT p3) p0)), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p5))), (OR (AND (NOT p0) (NOT p2) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p5))), (AND (NOT p5) (NOT p2)), (OR (AND (NOT p5) (NOT p2) (NOT p0) p3) (AND (NOT p5) (NOT p2) p0 (NOT p3))), (AND (NOT p5) (NOT p2) (NOT p3)), (OR (AND p0 (NOT p5) (NOT p2) (NOT p3)) (AND (NOT p0) p3 (NOT p5)) (AND (NOT p0) p2 (NOT p5)))]
Running random walk in product with property : GPUForwardProgress-PT-20a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p5)), acceptance={} source=0 dest: 4}, { cond=(NOT p5), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p5)), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 8}, { cond=p0, acceptance={0, 1} source=2 dest: 9}, { cond=p0, acceptance={1} source=2 dest: 10}, { cond=(AND p0 (NOT p5)), acceptance={} source=2 dest: 11}], [{ cond=(AND p0 (NOT p5)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p5)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p5), acceptance={} source=3 dest: 12}, { cond=(AND p0 (NOT p5)), acceptance={} source=3 dest: 13}, { cond=(AND (NOT p0) (NOT p5)), acceptance={} source=3 dest: 14}, { cond=(AND p0 (NOT p5)), acceptance={} source=3 dest: 15}], [{ cond=(AND p0 (NOT p5)), acceptance={} source=4 dest: 13}, { cond=(AND (NOT p0) (NOT p5)), acceptance={} source=4 dest: 14}], [{ cond=(NOT p5), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p5)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 (NOT p5)), acceptance={1} source=5 dest: 5}, { cond=(AND p0 (NOT p5)), acceptance={0, 1} source=5 dest: 15}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p4) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p4) p2 (NOT p3)), acceptance={} source=7 dest: 16}, { cond=(AND p0 (NOT p1) (NOT p4) p3), acceptance={} source=7 dest: 17}, { cond=(AND p0 (NOT p1) (NOT p4) (NOT p2) p3), acceptance={} source=7 dest: 18}, { cond=(AND p0 (NOT p1) (NOT p4) p2 p3), acceptance={} source=7 dest: 19}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p4)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p4) p2), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p4) (NOT p2) (NOT p3)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND (NOT p0) (NOT p4) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) (NOT p5) (NOT p4) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p4) (NOT p2) (NOT p3)), acceptance={0, 1} source=9 dest: 9}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p4) (NOT p2) (NOT p3)), acceptance={1} source=9 dest: 10}, { cond=(AND p0 (NOT p4) p2 (NOT p3)), acceptance={} source=9 dest: 10}, { cond=(AND p0 (NOT p5) (NOT p4) (NOT p3)), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p0) (NOT p4) p2 (NOT p3)), acceptance={} source=9 dest: 20}, { cond=(AND (NOT p0) (NOT p4) p2 (NOT p3)), acceptance={0} source=9 dest: 21}, { cond=(AND (NOT p0) (NOT p5) (NOT p4) p2 (NOT p3)), acceptance={} source=9 dest: 23}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p2) p3), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p0) (NOT p4) (NOT p2) p3), acceptance={0, 1} source=10 dest: 2}, { cond=(AND (NOT p0) (NOT p4) (NOT p2) p3), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p0) (NOT p5) (NOT p4) (NOT p2) p3), acceptance={} source=10 dest: 5}, { cond=(AND p0 (NOT p4) p3), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p4) (NOT p2) p3), acceptance={0, 1} source=10 dest: 9}, { cond=(AND p0 (NOT p4) p2 p3), acceptance={0} source=10 dest: 9}, { cond=(AND p0 (NOT p4) (NOT p2) p3), acceptance={1} source=10 dest: 10}, { cond=(AND p0 (NOT p4) p2 p3), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p5) (NOT p4) p3), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p0) (NOT p4) p2 p3), acceptance={} source=10 dest: 20}, { cond=(AND (NOT p0) (NOT p4) p2 p3), acceptance={0} source=10 dest: 21}, { cond=(AND (NOT p0) (NOT p5) (NOT p4) p2 p3), acceptance={} source=10 dest: 23}], [{ cond=(AND p0 (NOT p5) (NOT p4) (NOT p2)), acceptance={} source=11 dest: 4}, { cond=(AND p0 (NOT p5) (NOT p4) (NOT p2)), acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p5) (NOT p4)), acceptance={} source=11 dest: 13}, { cond=(AND (NOT p0) (NOT p5) (NOT p4) (NOT p2)), acceptance={} source=11 dest: 14}, { cond=(AND p0 (NOT p5) (NOT p4)), acceptance={} source=11 dest: 15}, { cond=(AND p0 (NOT p5) (NOT p4) p2), acceptance={} source=11 dest: 22}, { cond=(AND p0 (NOT p5) (NOT p4) p2), acceptance={} source=11 dest: 23}, { cond=(AND (NOT p0) (NOT p5) (NOT p4) p2), acceptance={} source=11 dest: 24}], [{ cond=(AND p0 (NOT p5)), acceptance={} source=12 dest: 14}], [{ cond=(OR (AND (NOT p0) (NOT p5) (NOT p1) (NOT p2)) (AND (NOT p5) (NOT p1) (NOT p2) (NOT p3))), acceptance={} source=13 dest: 14}, { cond=(OR (AND (NOT p0) (NOT p5) (NOT p1) p2) (AND (NOT p5) (NOT p1) p2 (NOT p3))), acceptance={} source=13 dest: 24}, { cond=(AND p0 (NOT p5) (NOT p1) p2 p3), acceptance={} source=13 dest: 25}, { cond=(AND p0 (NOT p5) (NOT p1) p3), acceptance={} source=13 dest: 26}, { cond=(AND p0 (NOT p5) (NOT p1) (NOT p2) p3), acceptance={} source=13 dest: 27}], [{ cond=(NOT p5), acceptance={0, 1} source=14 dest: 14}], [{ cond=(AND (NOT p5) (NOT p2) (NOT p3)), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p0) (NOT p5) (NOT p2) (NOT p3)), acceptance={0, 1} source=15 dest: 5}, { cond=(AND p0 (NOT p5) (NOT p2) (NOT p3)), acceptance={1} source=15 dest: 5}, { cond=(AND p0 (NOT p5) (NOT p2) (NOT p3)), acceptance={0, 1} source=15 dest: 15}, { cond=(AND p0 (NOT p5) p2 (NOT p3)), acceptance={0} source=15 dest: 15}, { cond=(AND (NOT p5) p2 (NOT p3)), acceptance={} source=15 dest: 22}, { cond=(AND (NOT p0) (NOT p5) p2 (NOT p3)), acceptance={0} source=15 dest: 23}, { cond=(AND p0 (NOT p5) p2 (NOT p3)), acceptance={} source=15 dest: 23}], [{ cond=(NOT p2), acceptance={} source=16 dest: 6}, { cond=p2, acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=17 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=17 dest: 16}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={} source=18 dest: 6}, { cond=p0, acceptance={} source=18 dest: 17}, { cond=p0, acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=19 dest: 6}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=19 dest: 16}, { cond=p0, acceptance={} source=19 dest: 17}, { cond=(AND p0 (NOT p2)), acceptance={} source=19 dest: 18}, { cond=(AND p0 p2), acceptance={} source=19 dest: 19}], [{ cond=(AND p0 (NOT p5) (NOT p2)), acceptance={} source=20 dest: 4}, { cond=(AND p0 (NOT p5) (NOT p2)), acceptance={} source=20 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=20 dest: 6}, { cond=p0, acceptance={} source=20 dest: 7}, { cond=(AND p0 (NOT p5)), acceptance={} source=20 dest: 13}, { cond=(AND p0 (NOT p5)), acceptance={} source=20 dest: 15}, { cond=(AND (NOT p0) p2), acceptance={} source=20 dest: 16}, { cond=(AND p0 (NOT p5) p2), acceptance={} source=20 dest: 22}, { cond=(AND p0 (NOT p5) p2), acceptance={} source=20 dest: 23}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=21 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=21 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=21 dest: 3}, { cond=(AND (NOT p0) (NOT p5) (NOT p2)), acceptance={} source=21 dest: 5}, { cond=p0, acceptance={} source=21 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=21 dest: 9}, { cond=(AND p0 p2), acceptance={0} source=21 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={1} source=21 dest: 10}, { cond=(AND p0 p2), acceptance={} source=21 dest: 10}, { cond=(AND p0 (NOT p5)), acceptance={} source=21 dest: 11}, { cond=(AND (NOT p0) p2), acceptance={} source=21 dest: 20}, { cond=(AND (NOT p0) p2), acceptance={0} source=21 dest: 21}, { cond=(AND (NOT p0) (NOT p5) p2), acceptance={} source=21 dest: 23}], [{ cond=(AND p0 (NOT p5)), acceptance={} source=22 dest: 13}, { cond=(AND (NOT p0) (NOT p5) (NOT p2)), acceptance={} source=22 dest: 14}, { cond=(AND (NOT p0) (NOT p5) p2), acceptance={} source=22 dest: 24}], [{ cond=(AND (NOT p5) (NOT p2)), acceptance={} source=23 dest: 4}, { cond=(AND (NOT p0) (NOT p5) (NOT p2)), acceptance={0, 1} source=23 dest: 5}, { cond=(AND p0 (NOT p5) (NOT p2)), acceptance={1} source=23 dest: 5}, { cond=(AND p0 (NOT p5) (NOT p2)), acceptance={0, 1} source=23 dest: 15}, { cond=(AND p0 (NOT p5) p2), acceptance={0} source=23 dest: 15}, { cond=(AND (NOT p5) p2), acceptance={} source=23 dest: 22}, { cond=(AND (NOT p0) (NOT p5) p2), acceptance={0} source=23 dest: 23}, { cond=(AND p0 (NOT p5) p2), acceptance={} source=23 dest: 23}], [{ cond=(AND (NOT p5) (NOT p2)), acceptance={} source=24 dest: 14}, { cond=(AND (NOT p5) p2), acceptance={} source=24 dest: 24}], [{ cond=(AND (NOT p0) (NOT p5) (NOT p2) p3), acceptance={} source=25 dest: 14}, { cond=(AND (NOT p0) (NOT p5) p2 p3), acceptance={} source=25 dest: 24}, { cond=(AND p0 (NOT p5) p2), acceptance={} source=25 dest: 25}, { cond=(AND p0 (NOT p5)), acceptance={} source=25 dest: 26}, { cond=(AND p0 (NOT p5) (NOT p2)), acceptance={} source=25 dest: 27}], [{ cond=(AND (NOT p5) (NOT p2) (NOT p3)), acceptance={} source=26 dest: 14}, { cond=(AND (NOT p5) p2 (NOT p3)), acceptance={} source=26 dest: 24}], [{ cond=(OR (AND (NOT p0) (NOT p5) p2) (AND (NOT p0) (NOT p5) p3)), acceptance={} source=27 dest: 14}, { cond=(AND p0 (NOT p5)), acceptance={} source=27 dest: 26}, { cond=(AND p0 (NOT p5)), acceptance={} source=27 dest: 27}]], initial=0, aps=[p0:(OR (NEQ s50 1) (NEQ s82 1) (NEQ s86 1)), p5:(AND (NEQ s56 0) (NEQ s82 0) (NEQ s86 0)), p1:(OR (NEQ s56 1) (NEQ s82 1) (NEQ s86 1)), p4:(OR (NEQ s56 1) (NEQ s82 1) (NEQ s86 1)), p2:(NEQ s11 1), p3:(OR (NEQ s56 1) (NEQ s82 1) (NEQ s86 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40035 reset in 420 ms.
Product exploration explored 100000 steps with 39947 reset in 351 ms.
Graph (complete) has 276 edges and 87 vertex of which 66 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, (NOT p5), p1, p4, p2, p3]
Stuttering acceptance computed with spot in 1083 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), true, (AND p0 (NOT p1) (NOT p4) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p5))), (AND (NOT p5) p0), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p5))), (NOT p5), (AND (NOT p2) (NOT p3) (NOT p5)), (NOT p2), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p0) p3) (AND (NOT p0) p2)), (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) (NOT p3) p0)), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p5))), (OR (AND (NOT p0) (NOT p2) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p5))), (AND (NOT p5) (NOT p2)), (OR (AND (NOT p5) (NOT p2) (NOT p0) p3) (AND (NOT p5) (NOT p2) p0 (NOT p3))), (AND (NOT p5) (NOT p2) (NOT p3)), (OR (AND p0 (NOT p5) (NOT p2) (NOT p3)) (AND (NOT p0) p3 (NOT p5)) (AND (NOT p0) p2 (NOT p5)))]
Product exploration explored 100000 steps with 40010 reset in 291 ms.
Product exploration explored 100000 steps with 39930 reset in 289 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true, false, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 1579 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), true, (AND p0 (NOT p1) (NOT p4) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p5))), (AND (NOT p5) p0), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p5))), (NOT p5), (AND (NOT p2) (NOT p3) (NOT p5)), (NOT p2), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p0) p3) (AND (NOT p0) p2)), (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) (NOT p3) p0)), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p5))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p5))), (AND (NOT p5) (NOT p2)), (OR (AND (NOT p5) (NOT p2) (NOT p0) p3) (AND (NOT p5) (NOT p2) p0 (NOT p3))), (AND (NOT p5) (NOT p2) (NOT p3)), (OR (AND p0 (NOT p5) (NOT p2) (NOT p3)) (AND (NOT p0) p3 (NOT p5)) (AND (NOT p0) p2 (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p5))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 87/87 places, 87/87 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 87 transition count 105
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 87 transition count 105
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 18 rules in 17 ms. Remains 87 /87 variables (removed 0) and now considering 105/87 (removed -18) transitions.
[2021-05-17 17:22:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2021-05-17 17:22:46] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:47] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 105/87 transitions.
Product exploration explored 100000 steps with 39955 reset in 392 ms.
Product exploration explored 100000 steps with 39968 reset in 359 ms.
[2021-05-17 17:22:47] [INFO ] Flatten gal took : 8 ms
[2021-05-17 17:22:47] [INFO ] Flatten gal took : 6 ms
[2021-05-17 17:22:47] [INFO ] Time to serialize gal into /tmp/LTL18214285475694265634.gal : 81 ms
[2021-05-17 17:22:47] [INFO ] Time to serialize properties into /tmp/LTL17300720578448840865.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18214285475694265634.gal, -t, CGAL, -LTL, /tmp/LTL17300720578448840865.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18214285475694265634.gal -t CGAL -LTL /tmp/LTL17300720578448840865.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X((X(("(((p56==0)||(p83==0))||(p87==0))")||(G("(p11==0)"))))&&("(((p50==0)||(p83==0))||(p87==0))")))U((X(G(("(((p50==0)||(p83==0))||(p87==0))")&&(X(("(((p56==0)||(p83==0))||(p87==0))")||(G("(p11==0)")))))))||((X(("(((p50==0)||(p83==0))||(p87==0))")&&(X(("(((p56==0)||(p83==0))||(p87==0))")||(G("(p11==0)"))))))&&(F((("(((p50==0)||(p83==0))||(p87==0))")&&(F("(((p56==1)&&(p83==1))&&(p87==1))")))||(G(F("(((p56==1)&&(p83==1))&&(p87==1))")))))))))
Formula 0 simplified : !(X("(((p50==0)||(p83==0))||(p87==0))" & X("(((p56==0)||(p83==0))||(p87==0))" | G"(p11==0)")) U (XG("(((p50==0)||(p83==0))||(p87==0))" & X("(((p56==0)||(p83==0))||(p87==0))" | G"(p11==0)")) | (X("(((p50==0)||(p83==0))||(p87==0))" & X("(((p56==0)||(p83==0))||(p87==0))" | G"(p11==0)")) & F(("(((p50==0)||(p83==0))||(p87==0))" & F"(((p56==1)&&(p83==1))&&(p87==1))") | GF"(((p56==1)&&(p83==1))&&(p87==1))"))))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t45, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/4/87
Computing Next relation with stutter on 1.04858e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
45 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,0.479323,32900,1,0,169,104092,213,93,3135,53605,199
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-20a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPUForwardProgress-PT-20a-02 finished in 7844 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 3 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:48] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:48] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:48] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:48] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:48] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:48] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20a-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s48 1) (EQ s82 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-03 finished in 245 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 3 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:48] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:48] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:48] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:48] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:48] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:48] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : GPUForwardProgress-PT-20a-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (OR (NEQ s6 1) (NEQ s82 1) (NEQ s86 1)) (NEQ s62 1)) (NEQ s15 1)), p0:(AND (EQ s23 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Graph (complete) has 276 edges and 87 vertex of which 66 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 7 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 87/87 places, 87/87 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 87 transition count 102
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 87 transition count 102
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 102/87 (removed -15) transitions.
[2021-05-17 17:22:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 87 cols
[2021-05-17 17:22:50] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:22:50] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 102/87 transitions.
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Product exploration explored 100000 steps with 50000 reset in 449 ms.
[2021-05-17 17:22:51] [INFO ] Flatten gal took : 6 ms
[2021-05-17 17:22:51] [INFO ] Flatten gal took : 6 ms
[2021-05-17 17:22:51] [INFO ] Time to serialize gal into /tmp/LTL10104507359933517092.gal : 3 ms
[2021-05-17 17:22:51] [INFO ] Time to serialize properties into /tmp/LTL6272120111246734367.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10104507359933517092.gal, -t, CGAL, -LTL, /tmp/LTL6272120111246734367.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10104507359933517092.gal -t CGAL -LTL /tmp/LTL6272120111246734367.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p23==0)&&(p11==0))")&&(F("(((((p6==0)||(p83==0))||(p87==0))&&(p62==0))||(p15==0))")))))
Formula 0 simplified : !X("((p23==0)&&(p11==0))" & F"(((((p6==0)||(p83==0))||(p87==0))&&(p62==0))||(p15==0))")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t45, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/4/87
Computing Next relation with stutter on 1.04858e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
46 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,0.47126,30832,1,0,168,104092,198,92,3136,53605,186
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-20a-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-20a-05 finished in 2926 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(F(p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 3 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:51] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:51] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:51] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:51] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:51] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:51] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20a-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-06 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((F(p1)&&p0)||(p2&&G(p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 87 transition count 70
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 70 transition count 70
Applied a total of 34 rules in 7 ms. Remains 70 /88 variables (removed 18) and now considering 70/87 (removed 17) transitions.
// Phase 1: matrix 70 rows 70 cols
[2021-05-17 17:22:51] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:51] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 70 rows 70 cols
[2021-05-17 17:22:51] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-17 17:22:52] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2021-05-17 17:22:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 70 cols
[2021-05-17 17:22:52] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:52] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 70/88 places, 70/87 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-20a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p3))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s52 1) (OR (NEQ s26 1) (NEQ s65 1) (NEQ s69 1))), p2:(NEQ s52 1), p3:(OR (NEQ s26 1) (NEQ s65 1) (NEQ s69 1)), p1:(NEQ s59 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-07 finished in 327 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U X(G((p1&&X(X(G(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 2 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:52] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:22:52] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:52] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:22:52] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:52] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:52] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20a-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 7}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND p0 p1), acceptance={0, 1} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 9}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 9}, { cond=(NOT p0), acceptance={} source=7 dest: 10}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p0 p1 p2), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=8 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=8 dest: 9}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=8 dest: 9}, { cond=(AND p0 p1 p2), acceptance={} source=8 dest: 9}, { cond=(NOT p0), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=9 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=9 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=9 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=9 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p1 p2), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 4}, { cond=p1, acceptance={} source=10 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 6}, { cond=(AND p1 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(EQ s27 0), p0:(EQ s27 1), p2:(EQ s35 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-08 finished in 498 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 3 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:52] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:52] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:52] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:22:52] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:52] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:52] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-17 17:22:52] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-20a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s43 1), p0:(AND (NEQ s10 0) (NEQ s82 0) (NEQ s86 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-09 finished in 317 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 86 transition count 68
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 68 transition count 68
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 0 with 2 rules applied. Total rules applied 38 place count 67 transition count 67
Applied a total of 38 rules in 9 ms. Remains 67 /88 variables (removed 21) and now considering 67/87 (removed 20) transitions.
// Phase 1: matrix 67 rows 67 cols
[2021-05-17 17:22:53] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:22:53] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 67 rows 67 cols
[2021-05-17 17:22:53] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-17 17:22:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 17:22:53] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2021-05-17 17:22:53] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 67 rows 67 cols
[2021-05-17 17:22:53] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:22:53] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 67/88 places, 67/87 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s54 1), p1:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-10 finished in 275 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 2 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:53] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:22:53] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:53] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-17 17:22:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:53] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:22:53] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:22:53] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20a-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s55 1) (EQ s84 1)), p1:(NEQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-11 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (p1||G(p0))) U (G(p2)||((p0 U (p3||G(p0)))&&X((X(!p0) U ((X(!p0)&&p4)||X(G(!p0)))))))))], workingDir=/home/mcc/execution]
Support contains 24 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 88 cols
[2021-05-17 17:22:53] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 17:22:53] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 87 rows 88 cols
[2021-05-17 17:22:53] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 17:22:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:22:53] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 88 cols
[2021-05-17 17:22:53] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 17:22:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 719 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), true, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND p2 (NOT p3) (NOT p0) (NOT p1)), p0, p0, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, false, (AND p0 (NOT p2)), p0, (AND (NOT p2) p0), (AND p0 (NOT p2)), false, false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-20a-12 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p0)), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(OR (AND p2 p3 p1) (AND p2 p0)), acceptance={1, 2} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 2} source=0 dest: 4}, { cond=(AND p2 (NOT p3) p0), acceptance={2} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 7}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 18}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 19}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 20}], [{ cond=true, acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=3 dest: 7}, { cond=(OR (AND (NOT p2) p3 p1 p4) (AND (NOT p2) p0 p4)), acceptance={0, 1, 2} source=3 dest: 8}, { cond=(OR (AND p2 p3 p1 p4) (AND p2 p0 p4)), acceptance={1, 2} source=3 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 2} source=3 dest: 9}, { cond=(AND p2 (NOT p3) p0), acceptance={2} source=3 dest: 9}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=3 dest: 10}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=3 dest: 10}, { cond=(AND p2 p0 (NOT p1) p4), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p2) p0 (NOT p1) p4), acceptance={} source=3 dest: 12}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 13}, { cond=(AND p2 p3 (NOT p0) (NOT p1) p4), acceptance={} source=3 dest: 14}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1) p4), acceptance={} source=3 dest: 15}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 16}, { cond=(OR (AND (NOT p2) p0 (NOT p4)) (AND (NOT p2) p1 (NOT p4))), acceptance={0, 1, 2} source=3 dest: 17}, { cond=(OR (AND p2 p0 (NOT p4)) (AND p2 p1 (NOT p4))), acceptance={1, 2} source=3 dest: 17}, { cond=(AND p2 p0 (NOT p1) (NOT p4)), acceptance={} source=3 dest: 18}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4)), acceptance={} source=3 dest: 19}, { cond=(AND p2 (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=3 dest: 20}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p2 (NOT p3) p0), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p4)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p0 (NOT p4)), acceptance={0, 1, 2} source=7 dest: 7}], [{ cond=(AND (NOT p2) p0 p4), acceptance={0, 1, 2} source=8 dest: 8}, { cond=(AND p2 p0 p4), acceptance={1, 2} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 2} source=8 dest: 9}, { cond=(AND p2 (NOT p3) p0), acceptance={2} source=8 dest: 9}, { cond=(AND p2 p0 (NOT p1) p4), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p2) p0 (NOT p1) p4), acceptance={} source=8 dest: 12}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=8 dest: 13}, { cond=(AND (NOT p2) p0 (NOT p4)), acceptance={0, 1, 2} source=8 dest: 17}, { cond=(AND p2 p0 (NOT p4)), acceptance={1, 2} source=8 dest: 17}, { cond=(AND p2 p0 (NOT p1) (NOT p4)), acceptance={} source=8 dest: 18}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4)), acceptance={} source=8 dest: 19}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 2} source=9 dest: 4}, { cond=(AND p2 (NOT p3) p0), acceptance={2} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND p2 p0), acceptance={1, 2} source=10 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 2} source=10 dest: 4}, { cond=(AND p2 (NOT p3) p0), acceptance={2} source=10 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=10 dest: 18}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=10 dest: 19}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=11 dest: 21}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=11 dest: 22}], [{ cond=(AND p2 p0 (NOT p1) (NOT p4)), acceptance={} source=12 dest: 19}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 22}], [{ cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=13 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p4)), acceptance={} source=14 dest: 7}, { cond=(AND p2 p0), acceptance={} source=14 dest: 16}, { cond=(AND p2 p0 (NOT p4)), acceptance={} source=14 dest: 20}], [{ cond=p0, acceptance={} source=15 dest: 6}, { cond=(AND p0 (NOT p4)), acceptance={} source=15 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=16 dest: 1}, { cond=(AND p2 p0), acceptance={} source=16 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=17 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=17 dest: 7}, { cond=(AND (NOT p2) p3 (NOT p0) p1 p4), acceptance={0, 1} source=17 dest: 8}, { cond=(AND (NOT p2) p0 p4), acceptance={0, 1, 2} source=17 dest: 8}, { cond=(AND p2 p3 (NOT p0) p1 p4), acceptance={1} source=17 dest: 8}, { cond=(AND p2 p0 p4), acceptance={1, 2} source=17 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 2} source=17 dest: 9}, { cond=(AND p2 (NOT p3) p0), acceptance={2} source=17 dest: 9}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0, 1} source=17 dest: 10}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={1} source=17 dest: 10}, { cond=(AND p2 p0 (NOT p1) p4), acceptance={} source=17 dest: 11}, { cond=(AND (NOT p2) p0 (NOT p1) p4), acceptance={} source=17 dest: 12}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=17 dest: 13}, { cond=(AND p2 p3 (NOT p0) (NOT p1) p4), acceptance={} source=17 dest: 14}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1) p4), acceptance={} source=17 dest: 15}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=17 dest: 16}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p4)), acceptance={0, 1} source=17 dest: 17}, { cond=(AND (NOT p2) p0 (NOT p4)), acceptance={0, 1, 2} source=17 dest: 17}, { cond=(AND p2 (NOT p0) p1 (NOT p4)), acceptance={1} source=17 dest: 17}, { cond=(AND p2 p0 (NOT p4)), acceptance={1, 2} source=17 dest: 17}, { cond=(AND p2 p0 (NOT p1) (NOT p4)), acceptance={} source=17 dest: 18}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4)), acceptance={} source=17 dest: 19}, { cond=(AND p2 (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=17 dest: 20}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=18 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=18 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=18 dest: 16}, { cond=(AND p2 p0 (NOT p1) (NOT p4)), acceptance={} source=18 dest: 18}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4)), acceptance={} source=18 dest: 19}, { cond=(AND p2 (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=18 dest: 20}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=18 dest: 21}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=18 dest: 22}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=19 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=19 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p4)), acceptance={} source=19 dest: 19}, { cond=(AND p0 (NOT p1)), acceptance={} source=19 dest: 22}], [{ cond=(NOT p2), acceptance={} source=20 dest: 6}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=20 dest: 7}, { cond=p2, acceptance={} source=20 dest: 16}, { cond=(AND p2 (NOT p4)), acceptance={} source=20 dest: 20}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=21 dest: 23}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=21 dest: 24}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=22 dest: 23}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=23 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=23 dest: 23}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=24 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=24 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=24 dest: 23}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=24 dest: 24}]], initial=0, aps=[p2:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s9 1) (NEQ s13 1) (NEQ s17 1) (NEQ s21 1) (NEQ s25 1) (NEQ s29 1) (NEQ s33 1) (NEQ s37 1) (NEQ s41 1) (NEQ s45 1) (NEQ s49 1) (NEQ s53 1) (NEQ s57 1) (NEQ s61 1) (NEQ s65 1) (NEQ s69 1) (NEQ s73 1) (NEQ s77 1) (NEQ s81 1) (NEQ s84 1) (AND (OR (NEQ s1 1) (NEQ s5 1) (NEQ s9 1) (NEQ s13 1) (NEQ s17 1) (NEQ s21 1) (NEQ s25 1) (NEQ s29 1) (NEQ s33 1) (NEQ s37 1) (NEQ s41 1) (NEQ s45 1) (NEQ s49 1) (NEQ s53 1) (NEQ s57 1) (NEQ s61 1) (NEQ s65 1) (NEQ s69 1) (NEQ s73 1) (NEQ s77 1) (NEQ s81 1) (NEQ s84 1)) (NEQ s78 1))), p3:(AND (OR (NEQ s1 1) (NEQ s5 1) (NEQ s9 1) (NEQ s13 1) (NEQ s17 1) (NEQ s21 1) (NEQ s25 1) (NEQ s29 1) (NEQ s33 1) (NEQ s37 1) (NEQ s41 1) (NEQ s45 1) (NEQ s49 1) (NEQ s53 1) (NEQ s57 1) (NEQ s61 1) (NEQ s65 1) (NEQ s69 1) (NEQ s73 1) (NEQ s77 1) (NEQ s81 1) (NEQ s84 1)) (NEQ s78 1)), p0:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s9 1) (NEQ s13 1) (NEQ s17 1) (NEQ s21 1) (NEQ s25 1) (NEQ s29 1) (NEQ s33 1) (NEQ s37 1) (NEQ s41 1) (NEQ s45 1) (NEQ s49 1) (NEQ s53 1) (NEQ s57 1) (NEQ s61 1) (NEQ s65 1) (NEQ s69 1) (NEQ s73 1) (NEQ s77 1) (NEQ s81 1) (NEQ s84 1)), p1:(AND (NEQ s78 1) (OR (NEQ s1 1) (NEQ s5 1) (NEQ s9 1) (NEQ s13 1) (NEQ s17 1) (NEQ s21 1) (NEQ s25 1) (NEQ s29 1) (NEQ s33 1) (NEQ s37 1) (NEQ s41 1) (NEQ s45 1) (NEQ s49 1) (NEQ s53 1) (NEQ s57 1) (NEQ s61 1) (NEQ s65 1) (NEQ s69 1) (NEQ s73 1) (NEQ s77 1) (NEQ s81 1) (NEQ s84 1))), p4:(AND (OR (NEQ s1 1) (NEQ s5 1) (NEQ s9 1) (NEQ s13 1) (NEQ s17 1) (NEQ s21 1) (NEQ s25 1) (NEQ s29 1) (NEQ s33 1) (NEQ s37 1) (NEQ s41 1) (NEQ s45 1) (NEQ s49 1) (NEQ s53 1) (NEQ s57 1) (NEQ s61 1) (NEQ s65 1) (NEQ s69 1) (NEQ s73 1) (NEQ s77 1) (NEQ s81 1) (NEQ s84 1) (NEQ s22 1)) (NEQ s22 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 944 reset in 432 ms.
Product exploration explored 100000 steps with 997 reset in 493 ms.
Graph (complete) has 278 edges and 88 vertex of which 66 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Knowledge obtained : [p2, p3, p0, p1, p4]
Stuttering acceptance computed with spot in 734 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), true, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND p2 (NOT p3) (NOT p0) (NOT p1)), p0, p0, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, false, (AND p0 (NOT p2)), p0, (AND (NOT p2) p0), (AND p0 (NOT p2)), false, false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 964 reset in 398 ms.
Product exploration explored 100000 steps with 979 reset in 392 ms.
Applying partial POR strategy [false, true, true, false, false, true, true, false, false, false, false, false, false, true, false, false, true, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 773 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), true, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND p2 (NOT p3) (NOT p0) (NOT p1)), p0, p0, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, false, (AND p0 (NOT p2)), p0, (AND (NOT p2) p0), (AND p0 (NOT p2)), false, false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 24 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 88 transition count 105
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 88 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 88 transition count 105
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 19 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 105/87 (removed -18) transitions.
[2021-05-17 17:22:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 105 rows 88 cols
[2021-05-17 17:22:58] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 17:22:58] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 105/87 transitions.
Product exploration explored 100000 steps with 983 reset in 417 ms.
Product exploration explored 100000 steps with 956 reset in 393 ms.
[2021-05-17 17:22:59] [INFO ] Flatten gal took : 7 ms
[2021-05-17 17:22:59] [INFO ] Flatten gal took : 7 ms
[2021-05-17 17:22:59] [INFO ] Time to serialize gal into /tmp/LTL5167444154015819658.gal : 2 ms
[2021-05-17 17:22:59] [INFO ] Time to serialize properties into /tmp/LTL3617178798836465951.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5167444154015819658.gal, -t, CGAL, -LTL, /tmp/LTL3617178798836465951.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5167444154015819658.gal -t CGAL -LTL /tmp/LTL3617178798836465951.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))")U((G("((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))"))||("((p78==0)&&((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0)))")))U((G("(((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))||(((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))&&(p78==0)))"))||((("((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))")U(("(((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))&&(p78==0))")||(G("((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))"))))&&(X((X("((((((((((((((((((((((p1==1)&&(p5==1))&&(p9==1))&&(p13==1))&&(p17==1))&&(p21==1))&&(p25==1))&&(p29==1))&&(p33==1))&&(p37==1))&&(p41==1))&&(p45==1))&&(p49==1))&&(p53==1))&&(p57==1))&&(p61==1))&&(p65==1))&&(p69==1))&&(p73==1))&&(p77==1))&&(p81==1))&&(p84==1))"))U((("((((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))||(p22==0))&&(p22==0))")&&(X("((((((((((((((((((((((p1==1)&&(p5==1))&&(p9==1))&&(p13==1))&&(p17==1))&&(p21==1))&&(p25==1))&&(p29==1))&&(p33==1))&&(p37==1))&&(p41==1))&&(p45==1))&&(p49==1))&&(p53==1))&&(p57==1))&&(p61==1))&&(p65==1))&&(p69==1))&&(p73==1))&&(p77==1))&&(p81==1))&&(p84==1))")))||(X(G("((((((((((((((((((((((p1==1)&&(p5==1))&&(p9==1))&&(p13==1))&&(p17==1))&&(p21==1))&&(p25==1))&&(p29==1))&&(p33==1))&&(p37==1))&&(p41==1))&&(p45==1))&&(p49==1))&&(p53==1))&&(p57==1))&&(p61==1))&&(p65==1))&&(p69==1))&&(p73==1))&&(p77==1))&&(p81==1))&&(p84==1))"))))))))))
Formula 0 simplified : !(("((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))" U ("((p78==0)&&((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0)))" | G"((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))")) U (G"(((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))||(((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))&&(p78==0)))" | (("((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))" U ("(((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))&&(p78==0))" | G"((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))")) & X(X"((((((((((((((((((((((p1==1)&&(p5==1))&&(p9==1))&&(p13==1))&&(p17==1))&&(p21==1))&&(p25==1))&&(p29==1))&&(p33==1))&&(p37==1))&&(p41==1))&&(p45==1))&&(p49==1))&&(p53==1))&&(p57==1))&&(p61==1))&&(p65==1))&&(p69==1))&&(p73==1))&&(p77==1))&&(p81==1))&&(p84==1))" U (("((((((((((((((((((((((((p1==0)||(p5==0))||(p9==0))||(p13==0))||(p17==0))||(p21==0))||(p25==0))||(p29==0))||(p33==0))||(p37==0))||(p41==0))||(p45==0))||(p49==0))||(p53==0))||(p57==0))||(p61==0))||(p65==0))||(p69==0))||(p73==0))||(p77==0))||(p81==0))||(p84==0))||(p22==0))&&(p22==0))" & X"((((((((((((((((((((((p1==1)&&(p5==1))&&(p9==1))&&(p13==1))&&(p17==1))&&(p21==1))&&(p25==1))&&(p29==1))&&(p33==1))&&(p37==1))&&(p41==1))&&(p45==1))&&(p49==1))&&(p53==1))&&(p57==1))&&(p61==1))&&(p65==1))&&(p69==1))&&(p73==1))&&(p77==1))&&(p81==1))&&(p84==1))") | XG"((((((((((((((((((((((p1==1)&&(p5==1))&&(p9==1))&&(p13==1))&&(p17==1))&&(p21==1))&&(p25==1))&&(p29==1))&&(p33==1))&&(p37==1))&&(p41==1))&&(p45==1))&&(p49==1))&&(p53==1))&&(p57==1))&&(p61==1))&&(p65==1))&&(p69==1))&&(p73==1))&&(p77==1))&&(p81==1))&&(p84==1))")))))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t45, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/4/87
Computing Next relation with stutter on 1.04858e+06 deadlock states
171 unique states visited
0 strongly connected components in search stack
336 transitions explored
44 items max in DFS search stack
309 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.41409,97920,1,0,789,439661,502,756,3717,467445,4568
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-20a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPUForwardProgress-PT-20a-12 finished in 9714 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0&&X(X((p1||G(p2)))))) U p3)))], workingDir=/home/mcc/execution]
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 2 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:23:03] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:23:03] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:23:03] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:23:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:23:03] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 87 cols
[2021-05-17 17:23:03] [INFO ] Computed 21 place invariants in 34 ms
[2021-05-17 17:23:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 87/87 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p3), (NOT p3), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20a-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s23 1), p0:(EQ s67 0), p1:(AND (EQ s74 1) (EQ s82 1) (EQ s86 1)), p2:(NEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 95 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-13 finished in 394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0 U p1))||((p0 U p1)&&F(G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 87 transition count 69
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 69 transition count 69
Applied a total of 36 rules in 4 ms. Remains 69 /88 variables (removed 19) and now considering 69/87 (removed 18) transitions.
// Phase 1: matrix 69 rows 69 cols
[2021-05-17 17:23:03] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:23:03] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 69 rows 69 cols
[2021-05-17 17:23:03] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-17 17:23:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-17 17:23:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2021-05-17 17:23:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 69 rows 69 cols
[2021-05-17 17:23:03] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-17 17:23:03] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 69/88 places, 69/87 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s64 1) (EQ s68 1)), p1:(AND (EQ s51 1) (EQ s64 1) (EQ s68 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 751 steps with 2 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-15 finished in 249 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621272185696

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-20a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-20a, 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 r292-tall-162124156000165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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