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-162124171100053.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100053
=====================================================================

--------------------
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 1621335372002

[2021-05-18 10:56:13] [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:56:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:56:13] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2021-05-18 10:56:13] [INFO ] Transformed 112 places.
[2021-05-18 10:56:13] [INFO ] Transformed 117 transitions.
[2021-05-18 10:56:13] [INFO ] Found NUPN structural information;
[2021-05-18 10:56:13] [INFO ] Parsed PT model containing 112 places and 117 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2135 resets, run finished after 367 ms. (steps per millisecond=272 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 117 rows 112 cols
[2021-05-18 10:56:14] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-18 10:56:14] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 15 ms returned sat
[2021-05-18 10:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:14] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-18 10:56:14] [INFO ] Computed and/alt/rep : 116/207/116 causal constraints in 14 ms.
[2021-05-18 10:56:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:14] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 87 ms returned sat
[2021-05-18 10:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:14] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-18 10:56:14] [INFO ] Computed and/alt/rep : 116/207/116 causal constraints in 9 ms.
[2021-05-18 10:56:14] [INFO ] Added : 103 causal constraints over 21 iterations in 210 ms. Result :sat
[2021-05-18 10:56:14] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 10:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:14] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-18 10:56:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:14] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 13 ms returned unsat
[2021-05-18 10:56:14] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 10:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:14] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-18 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:15] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 12 ms returned unsat
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 10:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-18 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:15] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 12 ms returned unsat
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 10:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-18 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:15] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 13 ms returned unsat
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 10:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-18 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:15] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 13 ms returned unsat
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 10:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-18 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:15] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 12 ms returned unsat
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 10:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-18 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:15] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 12 ms returned unsat
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 10:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-18 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:15] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 12 ms returned unsat
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-18 10:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:15] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-18 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:56:25] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 9119 ms returned unknown
[2021-05-18 10:56:25] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-18 10:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:56:25] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-18 10:56:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:56:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:56:34] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 9084 ms returned unknown
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2021-05-18 10:56:34] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 10:56:34] [INFO ] Flatten gal took : 39 ms
FORMULA GPUForwardProgress-PT-04b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:56:34] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:56:34] [INFO ] Applying decomposition
[2021-05-18 10:56:34] [INFO ] Flatten gal took : 12 ms
[2021-05-18 10:56:34] [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/graph3770549020907640197.txt, -o, /tmp/graph3770549020907640197.bin, -w, /tmp/graph3770549020907640197.weights], 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:34] [INFO ] Computed 6 place invariants in 2 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:34] [INFO ] Computed 6 place invariants in 3 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3770549020907640197.bin, -l, -1, -v, -w, /tmp/graph3770549020907640197.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:56:34] [INFO ] Decomposing Gal with order
[2021-05-18 10:56:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:56:34] [INFO ] Removed a total of 26 redundant transitions.
[2021-05-18 10:56:34] [INFO ] Flatten gal took : 65 ms
[2021-05-18 10:56:34] [INFO ] Proved 112 variables to be positive in 183 ms
[2021-05-18 10:56:34] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2021-05-18 10:56:34] [INFO ] Computation of disable matrix completed :0/117 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:56:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:56:34] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2021-05-18 10:56:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-18 10:56:34] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:56:34] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2021-05-18 10:56:34] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/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 9 LTL properties
Checking formula 0 : !((!(F((!(X(G(F(G("((i2.u21.p49==1)&&(i1.i0.u12.p31==1))"))))))&&(!(G("((i4.i1.u44.p111==0)||(i2.u21.p50==1))")))))))
Formula 0 simplified : F(!XGFG"((i2.u21.p49==1)&&(i1.i0.u12.p31==1))" & !G"((i4.i1.u44.p111==0)||(i2.u21.p50==1))")
built 17 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 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 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, t68, t107, i0.t103, i0.i2.u8.t92, i1.i2.t75, i1.i2.u15.t86, i3.i1.u24.t57, i5.t50, i5.i2.u31.t39, i7.t19, i7.u33.t34, i8.t10, i8.t8, i8.u39.t15, 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
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
33 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.342385,28820,1,0,26796,215,1577,39891,198,580,41806
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(F(G(F("((i1.i2.u16.p23!=0)&&(i7.u33.p81!=1))")))))))
Formula 1 simplified : !GFGF"((i1.i2.u16.p23!=0)&&(i7.u33.p81!=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
15 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.495026,33552,1,0,37934,287,1671,53631,202,881,58981
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((F("((i5.i0.u27.p64==0)||(i3.i1.u17.p58==1))"))&&(G("(i2.u18.p43==1)"))))||(G("(i2.u18.p43==1)")))U("((i5.i0.u27.p64==0)||(i3.i1.u17.p58==1))"))))
Formula 2 simplified : !X((G"(i2.u18.p43==1)" | X(F"((i5.i0.u27.p64==0)||(i3.i1.u17.p58==1))" & G"(i2.u18.p43==1)")) U "((i5.i0.u27.p64==0)||(i3.i1.u17.p58==1))")
Computing Next relation with stutter on 146 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.497241,34184,1,0,37934,287,1680,53631,202,881,59032
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-04b-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((F((!(G("((i0.i0.u5.p14==0)||(i6.u35.p88==1))")))||("((i2.u18.p51!=0)&&(i7.u33.p80!=1))")))&&(F("((i0.i0.u5.p14==0)||(i6.u35.p88==1))")))))
Formula 3 simplified : !F(F("((i2.u18.p51!=0)&&(i7.u33.p80!=1))" | !G"((i0.i0.u5.p14==0)||(i6.u35.p88==1))") & F"((i0.i0.u5.p14==0)||(i6.u35.p88==1))")
Computing Next relation with stutter on 146 deadlock states
[2021-05-18 10:56:35] [INFO ] Computing symmetric co enabling matrix : 117 transitions.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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.5873,38380,1,0,47925,287,1728,65899,204,883,79223
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F("(i4.i1.u43.p109==1)")))
Formula 4 simplified : !F"(i4.i1.u43.p109==1)"
Computing Next relation with stutter on 146 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.601781,39172,1,0,49981,287,1765,66818,205,883,82981
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-04b-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(F((X("((i7.u33.p82==0)||(i4.i0.u1.p4==1))"))&&("((i5.i1.u29.p70==0)||(i6.u37.p92==1))"))))))
Formula 5 simplified : GF("((i5.i1.u29.p70==0)||(i6.u37.p92==1))" & X"((i7.u33.p82==0)||(i4.i0.u1.p4==1))")
Computing Next relation with stutter on 146 deadlock states
43 unique states visited
42 strongly connected components in search stack
44 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,0.676605,40992,1,0,53098,290,1799,71265,207,898,90433
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X((!(G("(i1.i0.u10.p33==1)")))||("(i5.i2.u32.p76==1)")))||(X("(i5.i2.u32.p76==1)"))))
Formula 6 simplified : !(X("(i5.i2.u32.p76==1)" | !G"(i1.i0.u10.p33==1)") | X"(i5.i2.u32.p76==1)")
Computing Next relation with stutter on 146 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.677681,40992,1,0,53098,290,1814,71265,208,898,90451
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-04b-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F("(((i8.u39.p101==0)||(i5.i1.u30.p72==1))&&(i4.i0.u0.p2==1))"))))
Formula 7 simplified : F"(((i8.u39.p101==0)||(i5.i1.u30.p72==1))&&(i4.i0.u0.p2==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
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.682112,41252,1,0,53288,290,1842,71536,208,898,91371
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((F("((i5.i2.u32.p76==0)||(i1.i0.u10.p33==1))"))U(X(((G("((i4.i0.u1.p3!=0)&&(i4.i0.u1.p3!=1))"))U(F("((i4.i0.u1.p3==0)||(i4.i0.u1.p3==1))")))U("((i4.i0.u1.p3==0)||(i4.i0.u1.p3==1))"))))))
Formula 8 simplified : !G(F"((i5.i2.u32.p76==0)||(i1.i0.u10.p33==1))" U X((G"((i4.i0.u1.p3!=0)&&(i4.i0.u1.p3!=1))" U F"((i4.i0.u1.p3==0)||(i4.i0.u1.p3==1))") U "((i4.i0.u1.p3==0)||(i4.i0.u1.p3==1))"))
Computing Next relation with stutter on 146 deadlock states
83 unique states visited
0 strongly connected components in search stack
84 transitions explored
43 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.68776,41540,1,0,53288,290,1867,71536,210,898,92130
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-04b-15 TRUE 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:35] [INFO ] Built C files in 1080ms 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 1621335396651

--------------------
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-04b"
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-04b, 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-162124171100053"
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 [ "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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;