About the Execution of 2020-gold for GPUForwardProgress-PT-12a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
335.048 | 6201.00 | 13301.00 | 214.30 | FFFFFTFFFFFFFFFF | normal |
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-162124171100066.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-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.3K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.7K May 11 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 11 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 15K 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-12a-00
FORMULA_NAME GPUForwardProgress-PT-12a-01
FORMULA_NAME GPUForwardProgress-PT-12a-02
FORMULA_NAME GPUForwardProgress-PT-12a-03
FORMULA_NAME GPUForwardProgress-PT-12a-04
FORMULA_NAME GPUForwardProgress-PT-12a-05
FORMULA_NAME GPUForwardProgress-PT-12a-06
FORMULA_NAME GPUForwardProgress-PT-12a-07
FORMULA_NAME GPUForwardProgress-PT-12a-08
FORMULA_NAME GPUForwardProgress-PT-12a-09
FORMULA_NAME GPUForwardProgress-PT-12a-10
FORMULA_NAME GPUForwardProgress-PT-12a-11
FORMULA_NAME GPUForwardProgress-PT-12a-12
FORMULA_NAME GPUForwardProgress-PT-12a-13
FORMULA_NAME GPUForwardProgress-PT-12a-14
FORMULA_NAME GPUForwardProgress-PT-12a-15
=== Now, execution of the tool begins
BK_START 1621335494997
[2021-05-18 10:58:16] [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:58:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:58:16] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-18 10:58:16] [INFO ] Transformed 56 places.
[2021-05-18 10:58:16] [INFO ] Transformed 69 transitions.
[2021-05-18 10:58:16] [INFO ] Found NUPN structural information;
[2021-05-18 10:58:16] [INFO ] Parsed PT model containing 56 places and 69 transitions in 73 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 538 resets, run finished after 322 ms. (steps per millisecond=310 ) properties seen :[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, 1, 1]
// Phase 1: matrix 55 rows 56 cols
[2021-05-18 10:58:17] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-18 10:58:17] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 14 ms returned sat
[2021-05-18 10:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:58:17] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-18 10:58:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-18 10:58:17] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2021-05-18 10:58:17] [INFO ] Computed and/alt/rep : 54/256/54 causal constraints in 6 ms.
[2021-05-18 10:58:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:58:17] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 14 ms returned sat
[2021-05-18 10:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:58:17] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-18 10:58:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2021-05-18 10:58:17] [INFO ] Computed and/alt/rep : 54/256/54 causal constraints in 5 ms.
[2021-05-18 10:58:17] [INFO ] Added : 53 causal constraints over 12 iterations in 80 ms. Result :sat
[2021-05-18 10:58:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 10:58:17] [INFO ] Flatten gal took : 31 ms
FORMULA GPUForwardProgress-PT-12a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:58:17] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:58:17] [INFO ] Applying decomposition
[2021-05-18 10:58:17] [INFO ] Flatten gal took : 11 ms
[2021-05-18 10:58:17] [INFO ] Input system was already deterministic with 55 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/graph6024200891698277102.txt, -o, /tmp/graph6024200891698277102.bin, -w, /tmp/graph6024200891698277102.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/graph6024200891698277102.bin, -l, -1, -v, -w, /tmp/graph6024200891698277102.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 55 rows 56 cols
[2021-05-18 10:58:17] [INFO ] Computed 14 place invariants in 3 ms
inv : p25 + p26 + p27 + p28 - p52 - p53 - p54 - p55 = 0
inv : p50 + p51 - p53 - p54 - p55 = 0
inv : p37 + p38 + p39 + p40 - p52 - p53 - p54 - p55 = 0
inv : p41 + p42 + p43 + p44 - p52 - p53 - p54 - p55 = 0
inv : p1 + p2 + p3 + p4 - p52 - p53 - p54 - p55 = 0
inv : p17 + p18 + p19 + p20 - p52 - p53 - p54 - p55 = 0
inv : p9 + p10 + p11 + p12 - p52 - p53 - p54 - p55 = 0
inv : p33 + p34 + p35 + p36 - p52 - p53 - p54 - p55 = 0
inv : p45 + p46 + p47 + p48 - p52 - p53 - p54 - p55 = 0
inv : p29 + p30 + p31 + p32 - p52 - p53 - p54 - p55 = 0
inv : p21 + p22 + p23 + p24 - p52 - p53 - p54 - p55 = 0
inv : p49 - p52 = 0
inv : p13 + p14 + p15 + p16 - p52 - p53 - p54 - p55 = 0
inv : p5 + p6 + p7 + p8 - p52 - p53 - p54 - p55 = 0
Total of 14 invariants.
[2021-05-18 10:58:17] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-18 10:58:17] [INFO ] Decomposing Gal with order
[2021-05-18 10:58:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:58:17] [INFO ] Removed a total of 44 redundant transitions.
[2021-05-18 10:58:17] [INFO ] Flatten gal took : 43 ms
[2021-05-18 10:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-18 10:58:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2021-05-18 10:58:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 15 LTL properties
Checking formula 0 : !((G(F(G("(((u10.p42==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))")))))
Formula 0 simplified : !GFG"(((u10.p42==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))"
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t43, i12.u12.t6, i12.u13.t2, i12.u13.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/51/4/55
Computing Next relation with stutter on 4096 deadlock states
[2021-05-18 10:58:17] [INFO ] Proved 56 variables to be positive in 146 ms
[2021-05-18 10:58:17] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2021-05-18 10:58:17] [INFO ] Computation of disable matrix completed :0/55 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:58:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:58:17] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2021-05-18 10:58:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 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.19688,24988,1,0,21122,220,737,24789,156,539,26427
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("(u4.p19!=1)"))||(X(F((X("(u4.p19!=1)"))U(F(X("(u2.p11==1)"))))))))
Formula 1 simplified : !(G"(u4.p19!=1)" | XF(X"(u4.p19!=1)" U FX"(u2.p11==1)"))
Computing Next relation with stutter on 4096 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2 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.218851,25632,1,0,22645,220,916,26391,168,553,29381
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(((((!(X("(u11.p47==1)")))||(G("(u11.p47==1)")))||("(u8.p36!=1)"))||("(i12.u12.p51!=1)"))||("(i12.u13.p55!=1)"))))
Formula 2 simplified : !G("(i12.u12.p51!=1)" | "(i12.u13.p55!=1)" | "(u8.p36!=1)" | !X"(u11.p47==1)" | G"(u11.p47==1)")
Computing Next relation with stutter on 4096 deadlock states
26 unique states visited
4 strongly connected components in search stack
28 transitions explored
26 items max in DFS search stack
132 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.54677,87440,1,0,183862,221,1023,167383,174,623,229295
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G((G(!(("(u5.p23==1)")U("(u11.p47==1)"))))&&(G((F("(u10.p43==1)"))U(!(F("(u11.p47==1)")))))))))
Formula 3 simplified : G(G!("(u5.p23==1)" U "(u11.p47==1)") & G(F"(u10.p43==1)" U !F"(u11.p47==1)"))
Computing Next relation with stutter on 4096 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.54905,87720,1,0,183879,221,1036,167412,174,623,229412
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G("(((u8.p36!=1)||(i12.u12.p51!=1))||(i12.u13.p55!=1))"))U(G((G("((i12.u13.p54==1)||(((u8.p34==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1)))"))U("(i12.u12.p50==1)"))))))
Formula 4 simplified : !X(G"(((u8.p36!=1)||(i12.u12.p51!=1))||(i12.u13.p55!=1))" U G(G"((i12.u13.p54==1)||(((u8.p34==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1)))" U "(i12.u12.p50==1)"))
Computing Next relation with stutter on 4096 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.55672,88612,1,0,183886,221,1092,167416,176,623,229494
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(X((((G(X("(u9.p38==1)")))||("(i12.u13.p53==1)"))||("(u4.p19==1)"))||("((((((((((((((u0.p1==1)&&(u1.p5==1))&&(u2.p9==1))&&(u3.p13==1))&&(u4.p17==1))&&(u5.p21==1))&&(u6.p25==1))&&(u7.p29==1))&&(u8.p33==1))&&(u9.p37==1))&&(u10.p41==1))&&(u11.p45==1))&&(i12.u12.p49==1))&&(i12.u12.p52==1))")))))
Formula 5 simplified : X("((((((((((((((u0.p1==1)&&(u1.p5==1))&&(u2.p9==1))&&(u3.p13==1))&&(u4.p17==1))&&(u5.p21==1))&&(u6.p25==1))&&(u7.p29==1))&&(u8.p33==1))&&(u9.p37==1))&&(u10.p41==1))&&(u11.p45==1))&&(i12.u12.p49==1))&&(i12.u12.p52==1))" | "(i12.u13.p53==1)" | "(u4.p19==1)" | GX"(u9.p38==1)")
Computing Next relation with stutter on 4096 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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.55906,88612,1,0,183886,221,1184,167416,180,623,229529
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-12a-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(G("(u1.p6==1)")))U(X("(u1.p7==1)"))))
Formula 6 simplified : !(XG"(u1.p6==1)" U X"(u1.p7==1)")
Computing Next relation with stutter on 4096 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.55995,88612,1,0,183886,221,1195,167416,184,623,229557
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((X("(u2.p10==1)"))U("(u0.p3==1)"))&&((G(F("(((u9.p38==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))")))U(X((F("(u0.p3==1)"))||("(u7.p30==1)"))))))
Formula 7 simplified : !((X"(u2.p10==1)" U "(u0.p3==1)") & (GF"(((u9.p38==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))" U X("(u7.p30==1)" | F"(u0.p3==1)")))
Computing Next relation with stutter on 4096 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.56232,88612,1,0,183886,221,1204,167416,184,623,229612
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(G("(u0.p2==1)")))))
Formula 8 simplified : !GXG"(u0.p2==1)"
Computing Next relation with stutter on 4096 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.56301,88612,1,0,183886,221,1218,167416,184,623,229645
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((((X("(u10.p43!=1)"))U("(((u5.p24!=1)||(i12.u12.p51!=1))||(i12.u13.p55!=1))"))||(G("(u6.p27==1)")))U(F(X("(u6.p27==1)")))))
Formula 9 simplified : !(((X"(u10.p43!=1)" U "(((u5.p24!=1)||(i12.u12.p51!=1))||(i12.u13.p55!=1))") | G"(u6.p27==1)") U FX"(u6.p27==1)")
Computing Next relation with stutter on 4096 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.56939,88612,1,0,184424,221,1260,168007,184,623,230597
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X(X(((((G("(u7.p31==1)"))&&("(u11.p46==1)"))&&("(i12.u12.p51==1)"))&&("(i12.u13.p55==1)"))&&("(u9.p39==1)"))))))
Formula 10 simplified : !FXX("(i12.u12.p51==1)" & "(i12.u13.p55==1)" & "(u9.p39==1)" & "(u11.p46==1)" & G"(u7.p31==1)")
Computing Next relation with stutter on 4096 deadlock states
[2021-05-18 10:58:19] [INFO ] Computing symmetric co enabling matrix : 55 transitions.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 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.73172,96488,1,0,204765,221,1341,187298,184,624,257918
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G(X(!(X((F(G("(u11.p47==1)")))||("(u11.p47==1)"))))))))
Formula 11 simplified : !FGX!X("(u11.p47==1)" | FG"(u11.p47==1)")
Computing Next relation with stutter on 4096 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.73407,96752,1,0,204775,221,1348,187327,184,624,258050
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((((!(G("(((u0.p4==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))")))||("(u2.p11!=1)"))U(G(F(X(G(F("(u2.p11==1)"))))))))
Formula 12 simplified : !(("(u2.p11!=1)" | !G"(((u0.p4==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))") U GFXGF"(u2.p11==1)")
Computing Next relation with stutter on 4096 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 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.73842,96752,1,0,205126,221,1348,187833,184,632,258702
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X(!(F(((F("(u0.p3==1)"))&&(X("(((u9.p40==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))")))&&("(u4.p19==1)")))))&&(!(G(X("(u2.p11==1)"))))))
Formula 13 simplified : !(X!F("(u4.p19==1)" & F"(u0.p3==1)" & X"(((u9.p40==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))") & !GX"(u2.p11==1)")
Computing Next relation with stutter on 4096 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.74641,97016,1,0,205942,221,1362,188582,184,632,260005
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(X(G((((((X("(((u5.p22==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))"))&&("(u4.p18==1)"))&&("(i12.u12.p51==1)"))&&("(i12.u13.p55==1)"))U(G("(i12.u13.p54==1)")))U("(((u4.p18!=1)||(i12.u12.p51!=1))||(i12.u13.p55!=1))"))))))
Formula 14 simplified : !FXG((("(i12.u12.p51==1)" & "(i12.u13.p55==1)" & "(u4.p18==1)" & X"(((u5.p22==1)&&(i12.u12.p51==1))&&(i12.u13.p55==1))") U G"(i12.u13.p54==1)") U "(((u4.p18!=1)||(i12.u12.p51!=1))||(i12.u13.p55!=1))")
Computing Next relation with stutter on 4096 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
18 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.93219,101272,1,0,216865,221,1549,200333,189,637,278509
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12a-15 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:58:20] [INFO ] Built C files in 2615ms 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 1621335501198
--------------------
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-12a"
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-12a, 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-162124171100066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-12a.tgz
mv GPUForwardProgress-PT-12a 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 '
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 ;