About the Execution of 2020-gold for GPUForwardProgress-PT-16a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
269.140 | 5427.00 | 10451.00 | 216.40 | FFTTFFFFTFFTFFFF | 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-162124171100073.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-16a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100073
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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 17K 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.0K May 11 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:39 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 20K 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-16a-00
FORMULA_NAME GPUForwardProgress-PT-16a-01
FORMULA_NAME GPUForwardProgress-PT-16a-02
FORMULA_NAME GPUForwardProgress-PT-16a-03
FORMULA_NAME GPUForwardProgress-PT-16a-04
FORMULA_NAME GPUForwardProgress-PT-16a-05
FORMULA_NAME GPUForwardProgress-PT-16a-06
FORMULA_NAME GPUForwardProgress-PT-16a-07
FORMULA_NAME GPUForwardProgress-PT-16a-08
FORMULA_NAME GPUForwardProgress-PT-16a-09
FORMULA_NAME GPUForwardProgress-PT-16a-10
FORMULA_NAME GPUForwardProgress-PT-16a-11
FORMULA_NAME GPUForwardProgress-PT-16a-12
FORMULA_NAME GPUForwardProgress-PT-16a-13
FORMULA_NAME GPUForwardProgress-PT-16a-14
FORMULA_NAME GPUForwardProgress-PT-16a-15
=== Now, execution of the tool begins
BK_START 1621335595045
[2021-05-18 10:59:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:59:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:59:56] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2021-05-18 10:59:56] [INFO ] Transformed 72 places.
[2021-05-18 10:59:56] [INFO ] Transformed 89 transitions.
[2021-05-18 10:59:56] [INFO ] Found NUPN structural information;
[2021-05-18 10:59:56] [INFO ] Parsed PT model containing 72 places and 89 transitions in 77 ms.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 390 resets, run finished after 347 ms. (steps per millisecond=288 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 71 rows 72 cols
[2021-05-18 10:59:57] [INFO ] Computed 18 place invariants in 5 ms
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 15 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 8 ms returned unsat
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 10 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 6 ms returned unsat
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 6 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 6 ms returned unsat
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 6 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 7 ms returned unsat
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 7 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 6 ms returned unsat
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 7 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 7 ms returned unsat
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 8 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 6 ms returned unsat
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 9 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 9 ms returned unsat
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 7 ms returned sat
[2021-05-18 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:59:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-18 10:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:59:57] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 6 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
[2021-05-18 10:59:58] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 10:59:58] [INFO ] Flatten gal took : 37 ms
FORMULA GPUForwardProgress-PT-16a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:59:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 10:59:58] [INFO ] Flatten gal took : 14 ms
[2021-05-18 10:59:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPUForwardProgress-PT-16a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:59:58] [INFO ] Applying decomposition
[2021-05-18 10:59:58] [INFO ] Flatten gal took : 9 ms
[2021-05-18 10:59:58] [INFO ] Input system was already deterministic with 71 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/graph16184442884061271798.txt, -o, /tmp/graph16184442884061271798.bin, -w, /tmp/graph16184442884061271798.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/graph16184442884061271798.bin, -l, -1, -v, -w, /tmp/graph16184442884061271798.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:59:58] [INFO ] Decomposing Gal with order
[2021-05-18 10:59:58] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 71 rows 72 cols
[2021-05-18 10:59:58] [INFO ] Computed 18 place invariants in 2 ms
inv : p17 + p18 + p19 + p20 - p68 - p69 - p70 - p71 = 0
inv : p29 + p30 + p31 + p32 - p68 - p69 - p70 - p71 = 0
inv : p49 + p50 + p51 + p52 - p68 - p69 - p70 - p71 = 0
inv : p41 + p42 + p43 + p44 - p68 - p69 - p70 - p71 = 0
inv : p5 + p6 + p7 + p8 - p68 - p69 - p70 - p71 = 0
inv : p53 + p54 + p55 + p56 - p68 - p69 - p70 - p71 = 0
inv : p37 + p38 + p39 + p40 - p68 - p69 - p70 - p71 = 0
inv : p1 + p2 + p3 + p4 - p68 - p69 - p70 - p71 = 0
inv : p45 + p46 + p47 + p48 - p68 - p69 - p70 - p71 = 0
inv : p33 + p34 + p35 + p36 - p68 - p69 - p70 - p71 = 0
inv : p21 + p22 + p23 + p24 - p68 - p69 - p70 - p71 = 0
inv : p13 + p14 + p15 + p16 - p68 - p69 - p70 - p71 = 0
inv : p66 + p67 - p69 - p70 - p71 = 0
inv : p57 + p58 + p59 + p60 - p68 - p69 - p70 - p71 = 0
inv : p9 + p10 + p11 + p12 - p68 - p69 - p70 - p71 = 0
inv : p25 + p26 + p27 + p28 - p68 - p69 - p70 - p71 = 0
inv : p65 - p68 = 0
inv : p61 + p62 + p63 + p64 - p68 - p69 - p70 - p71 = 0
Total of 18 invariants.
[2021-05-18 10:59:58] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-18 10:59:58] [INFO ] Removed a total of 60 redundant transitions.
[2021-05-18 10:59:58] [INFO ] Flatten gal took : 34 ms
[2021-05-18 10:59:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-18 10:59:58] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2021-05-18 10:59:58] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((F(G("((u4.p18==0)||(u6.p28==1))"))))
Formula 0 simplified : !FG"((u4.p18==0)||(u6.p28==1))"
built 17 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t55, i16.u16.t6, i16.u17.t2, i16.u17.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/67/4/71
Computing Next relation with stutter on 65536 deadlock states
[2021-05-18 10:59:58] [INFO ] Proved 72 variables to be positive in 164 ms
[2021-05-18 10:59:58] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2021-05-18 10:59:58] [INFO ] Computation of disable matrix completed :0/71 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:59:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:59:58] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2021-05-18 10:59:58] [INFO ] Computation of Complete enable matrix. took 2 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
10 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.103434,19976,1,0,8878,218,945,10701,165,563,15957
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-16a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!((X((X("((u3.p15==0)||(u0.p3==1))"))&&("((u3.p15==0)||(u0.p3==1))")))U(!(G(F(X(X("((u3.p15==0)||(u0.p3==1))")))))))))
Formula 1 simplified : X("((u3.p15==0)||(u0.p3==1))" & X"((u3.p15==0)||(u0.p3==1))") U !GFXX"((u3.p15==0)||(u0.p3==1))"
Computing Next relation with stutter on 65536 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 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.12991,22092,1,0,11646,219,1069,13738,167,579,20213
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-16a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(!("((u1.p5==0)||(u13.p56==1))"))))
Formula 2 simplified : !X!"((u1.p5==0)||(u13.p56==1))"
Computing Next relation with stutter on 65536 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,0.131509,22356,1,0,11687,219,1077,13761,168,579,20458
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-16a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G(F("((u0.p3==0)||(u8.p33==1))")))))
Formula 3 simplified : GF"((u0.p3==0)||(u8.p33==1))"
Computing Next relation with stutter on 65536 deadlock states
[2021-05-18 10:59:58] [INFO ] Computing symmetric co enabling matrix : 71 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
53 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.653816,45060,1,0,71299,220,1103,78606,169,611,75424
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-16a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X("((u12.p51==0)||(u13.p56==1))"))))
Formula 4 simplified : !FX"((u12.p51==0)||(u13.p56==1))"
Computing Next relation with stutter on 65536 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,0.656228,45324,1,0,71299,220,1123,78606,169,611,75436
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-16a-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(X(X(F(X(X(F("((u11.p46==0)||(u5.p22==1))"))))))))))
Formula 5 simplified : !XFXXFXXF"((u11.p46==0)||(u5.p22==1))"
Computing Next relation with stutter on 65536 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.671993,45824,1,0,73132,220,1187,80705,170,611,78550
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-16a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((((G("((u0.p3==0)||(u13.p56==1))"))&&(X("((u0.p3==0)||(u13.p56==1))")))&&(("((u14.p57==0)||(u11.p45==1))")U("((u1.p5==0)||(u15.p63==1))"))))
Formula 6 simplified : !(G"((u0.p3==0)||(u13.p56==1))" & X"((u0.p3==0)||(u13.p56==1))" & ("((u14.p57==0)||(u11.p45==1))" U "((u1.p5==0)||(u15.p63==1))"))
Computing Next relation with stutter on 65536 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,0.71138,48256,1,0,77434,220,1282,85681,170,611,85955
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-16a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G(F(((F("((u14.p59==0)||(u8.p33==1))"))U("(u11.p45==1)"))||((X(X("((u8.p33==0)||(u9.p38==1))")))U(("(u2.p12==1)")U("((u14.p59==0)||(u8.p33==1))"))))))))
Formula 7 simplified : !FGF((F"((u14.p59==0)||(u8.p33==1))" U "(u11.p45==1)") | (XX"((u8.p33==0)||(u9.p38==1))" U ("(u2.p12==1)" U "((u14.p59==0)||(u8.p33==1))")))
Computing Next relation with stutter on 65536 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 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,0.716377,48740,1,0,77670,220,1339,85923,171,611,86381
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-16a-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:59:59] [INFO ] Built C files in 1161ms 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 1621335600472
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-16a"
export BK_EXAMINATION="LTLCardinality"
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-16a, examination is LTLCardinality"
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-162124171100073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-16a.tgz
mv GPUForwardProgress-PT-16a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;