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.r303-tall-162124171100054.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 gold2020
Input is GPUForwardProgress-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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 27K 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 18K 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.4K May 11 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 15:38 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 18K 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-04b-00
FORMULA_NAME GPUForwardProgress-PT-04b-01
FORMULA_NAME GPUForwardProgress-PT-04b-02
FORMULA_NAME GPUForwardProgress-PT-04b-03
FORMULA_NAME GPUForwardProgress-PT-04b-04
FORMULA_NAME GPUForwardProgress-PT-04b-05
FORMULA_NAME GPUForwardProgress-PT-04b-06
FORMULA_NAME GPUForwardProgress-PT-04b-07
FORMULA_NAME GPUForwardProgress-PT-04b-08
FORMULA_NAME GPUForwardProgress-PT-04b-09
FORMULA_NAME GPUForwardProgress-PT-04b-10
FORMULA_NAME GPUForwardProgress-PT-04b-11
FORMULA_NAME GPUForwardProgress-PT-04b-12
FORMULA_NAME GPUForwardProgress-PT-04b-13
FORMULA_NAME GPUForwardProgress-PT-04b-14
FORMULA_NAME GPUForwardProgress-PT-04b-15

=== Now, execution of the tool begins

BK_START 1621335376030

[2021-05-18 10:56:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 10:56:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:56:17] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-18 10:56:17] [INFO ] Transformed 112 places.
[2021-05-18 10:56:17] [INFO ] Transformed 117 transitions.
[2021-05-18 10:56:17] [INFO ] Found NUPN structural information;
[2021-05-18 10:56:17] [INFO ] Parsed PT model containing 112 places and 117 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2159 resets, run finished after 233 ms. (steps per millisecond=429 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 117 rows 112 cols
[2021-05-18 10:56:18] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-18 10:56:18] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 15 ms returned sat
[2021-05-18 10:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:18] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-18 10:56:18] [INFO ] Computed and/alt/rep : 116/207/116 causal constraints in 10 ms.
[2021-05-18 10:56:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:18] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 398 ms returned sat
[2021-05-18 10:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:18] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-18 10:56:18] [INFO ] Computed and/alt/rep : 116/207/116 causal constraints in 18 ms.
[2021-05-18 10:56:18] [INFO ] Added : 105 causal constraints over 21 iterations in 210 ms. Result :sat
[2021-05-18 10:56:19] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-18 10:56:19] [INFO ] Flatten gal took : 39 ms
FORMULA GPUForwardProgress-PT-04b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:56:19] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2021-05-18 10:56:19] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2021-05-18 10:56:19] [INFO ] Flatten gal took : 24 ms
[2021-05-18 10:56:19] [INFO ] Input system was already deterministic with 117 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph6015858182563862188.txt, -o, /tmp/graph6015858182563862188.bin, -w, /tmp/graph6015858182563862188.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph6015858182563862188.bin, -l, -1, -v, -w, /tmp/graph6015858182563862188.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 117 rows 112 cols
[2021-05-18 10:56:19] [INFO ] Computed 6 place invariants in 3 ms
inv : p1 + p77 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 - p96 - p97 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 = 0
inv : p1 + p2 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 = 0
inv : p1 + p2 + p3 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 = 0
inv : p1 + p2 + p3 + p4 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 = 0
inv : p78 - p98 = 0
Total of 6 invariants.
[2021-05-18 10:56:19] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-18 10:56:19] [INFO ] Decomposing Gal with order
[2021-05-18 10:56:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:56:19] [INFO ] Removed a total of 25 redundant transitions.
[2021-05-18 10:56:19] [INFO ] Flatten gal took : 61 ms
[2021-05-18 10:56:19] [INFO ] Proved 112 variables to be positive in 135 ms
[2021-05-18 10:56:19] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2021-05-18 10:56:19] [INFO ] Computation of disable matrix completed :0/117 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:56:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:56:19] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2021-05-18 10:56:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:56:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-18 10:56:19] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
[2021-05-18 10:56:19] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((!(X(G((X("((i10.u39.p91==1)||(i11.u43.p103==1))"))&&(F("(i11.u42.p101==1)")))))))
Formula 0 simplified : XG(X"((i10.u39.p91==1)||(i11.u43.p103==1))" & F"(i11.u42.p101==1)")
built 20 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t4, t31, t107, i1.i1.t92, i1.i1.u8.t103, i4.i0.t75, i4.i0.u12.t86, i6.i1.t57, i6.i1.u24.t68, i7.i1.t39, i7.i1.u32.t50, i9.t19, i9.u35.t34, i11.t15, i11.u43.t8, i11.u43.t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/101/16/117
Computing Next relation with stutter on 146 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
8 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.10168,19508,1,0,5751,270,1247,7069,231,543,17317
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-04b-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("((i5.u21.p51==1)&&(i10.u37.p90!=1))"))||(G("(i10.u37.p90==1)"))))
Formula 1 simplified : !(F"((i5.u21.p51==1)&&(i10.u37.p90!=1))" | G"(i10.u37.p90==1)")
Computing Next relation with stutter on 146 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 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.161963,21920,1,0,12700,358,1506,13992,251,825,31038
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X((G("(i5.u18.p42==1)"))||(!(X((F("(i1.i1.u9.p22==1)"))&&("(i0.i1.u44.p110==1)"))))))))
Formula 2 simplified : !XX(G"(i5.u18.p42==1)" | !X("(i0.i1.u44.p110==1)" & F"(i1.i1.u9.p22==1)"))
Computing Next relation with stutter on 146 deadlock states
38 unique states visited
38 strongly connected components in search stack
39 transitions explored
38 items max in DFS search stack
13 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.284732,27516,1,0,24246,399,1644,26787,253,1018,53246
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(((X("(i10.u38.p88!=1)"))U(G(X(X(F("((i7.i0.u30.p71==1)||(i4.i0.u12.p38==1))"))))))U(G("(i10.u38.p88==1)")))))
Formula 3 simplified : !X((X"(i10.u38.p88!=1)" U GXXF"((i7.i0.u30.p71==1)||(i4.i0.u12.p38==1))") U G"(i10.u38.p88==1)")
Computing Next relation with stutter on 146 deadlock states
42 unique states visited
42 strongly connected components in search stack
42 transitions explored
42 items max in DFS search stack
8 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.371305,31304,1,0,30954,404,1658,36990,253,1036,66049
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((((X("(i11.u43.p103==1)"))||(X((F("(i3.u11.p25==1)"))&&("(i8.u26.p69==1)"))))U("((i9.u35.p79==1)&&(i11.u41.p99==1))"))||(X(G("(i2.u3.p15==1)"))))))
Formula 4 simplified : !F(((X"(i11.u43.p103==1)" | X("(i8.u26.p69==1)" & F"(i3.u11.p25==1)")) U "((i9.u35.p79==1)&&(i11.u41.p99==1))") | XG"(i2.u3.p15==1)")
Computing Next relation with stutter on 146 deadlock states
[2021-05-18 10:56:20] [INFO ] Computing symmetric co enabling matrix : 117 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
68 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.05654,60052,1,0,101527,445,1697,97442,254,1396,148668
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(X(((F(X(G("(i5.u18.p43==1)"))))||("(i8.u29.p68==1)"))U("((i5.u18.p43==1)&&(i8.u29.p68==1))"))))))
Formula 5 simplified : !XFX(("(i8.u29.p68==1)" | FXG"(i5.u18.p43==1)") U "((i5.u18.p43==1)&&(i8.u29.p68==1))")
Computing Next relation with stutter on 146 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.08373,61108,1,0,103782,447,1744,100344,254,1400,154127
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("(i11.u43.p107==1)")U(X(((X(X("(i11.u43.p107!=1)")))U(X((F("(i4.i0.u17.p23==1)"))U("(i11.u43.p107==1)"))))||("(i4.i0.u17.p23==1)")))))
Formula 6 simplified : !("(i11.u43.p107==1)" U X("(i4.i0.u17.p23==1)" | (XX"(i11.u43.p107!=1)" U X(F"(i4.i0.u17.p23==1)" U "(i11.u43.p107==1)"))))
Computing Next relation with stutter on 146 deadlock states
43 unique states visited
43 strongly connected components in search stack
43 transitions explored
43 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.16295,62640,1,0,107780,447,1774,103002,256,1403,163138
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((F((F(G(F("(((i1.i0.u6.p16==1)&&(i9.u35.p93==1))&&(i11.u43.p108==1))"))))||((F("(i6.i0.u22.p53==1)"))&&(F("(i8.u26.p61==1)")))))||("(i6.i0.u22.p53==1)"))))
Formula 7 simplified : !G("(i6.i0.u22.p53==1)" | F(FGF"(((i1.i0.u6.p16==1)&&(i9.u35.p93==1))&&(i11.u43.p108==1))" | (F"(i6.i0.u22.p53==1)" & F"(i8.u26.p61==1)")))
Computing Next relation with stutter on 146 deadlock states
44 unique states visited
44 strongly connected components in search stack
45 transitions explored
44 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.26579,66036,1,0,115915,447,1833,110812,258,1403,177497
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(("(i11.u42.p102==1)")U(X("(i11.u42.p102!=1)"))))))
Formula 8 simplified : !GX("(i11.u42.p102==1)" U X"(i11.u42.p102!=1)")
Computing Next relation with stutter on 146 deadlock states
46 unique states visited
46 strongly connected components in search stack
47 transitions explored
46 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.33866,69732,1,0,125291,455,1840,119142,259,1432,190126
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!((G(!(G(F("(i1.i1.u8.p20==1)")))))U("(i1.i1.u8.p20==1)"))))
Formula 9 simplified : G!GF"(i1.i1.u8.p20==1)" U "(i1.i1.u8.p20==1)"
Computing Next relation with stutter on 146 deadlock states
41 unique states visited
41 strongly connected components in search stack
43 transitions explored
41 items max in DFS search stack
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.56888,78180,1,0,145373,455,1857,143810,259,1432,228841
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(X(G("(i1.i1.u8.p20==1)")))))
Formula 10 simplified : !GXG"(i1.i1.u8.p20==1)"
Computing Next relation with stutter on 146 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.57019,78444,1,0,145373,455,1864,143810,259,1432,228861
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(!(X(F("(i5.u21.p51==1)"))))))
Formula 11 simplified : !G!XF"(i5.u21.p51==1)"
Computing Next relation with stutter on 146 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.5791,78708,1,0,146302,455,1888,144870,259,1432,231124
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-18 10:56:21] [INFO ] Built C files in 2257ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1621335382604

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is GPUForwardProgress-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171100054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-04b.tgz
mv GPUForwardProgress-PT-04b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;