Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972913900298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RwMutex-PT-r0020w0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913900298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.6K Apr 12 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 9 23:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 23:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 43K Mar 24 05:38 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 RwMutex-PT-r0020w0010-00
FORMULA_NAME RwMutex-PT-r0020w0010-01
FORMULA_NAME RwMutex-PT-r0020w0010-02
FORMULA_NAME RwMutex-PT-r0020w0010-03
FORMULA_NAME RwMutex-PT-r0020w0010-04
FORMULA_NAME RwMutex-PT-r0020w0010-05
FORMULA_NAME RwMutex-PT-r0020w0010-06
FORMULA_NAME RwMutex-PT-r0020w0010-07
FORMULA_NAME RwMutex-PT-r0020w0010-08
FORMULA_NAME RwMutex-PT-r0020w0010-09
FORMULA_NAME RwMutex-PT-r0020w0010-10
FORMULA_NAME RwMutex-PT-r0020w0010-11
FORMULA_NAME RwMutex-PT-r0020w0010-12
FORMULA_NAME RwMutex-PT-r0020w0010-13
FORMULA_NAME RwMutex-PT-r0020w0010-14
FORMULA_NAME RwMutex-PT-r0020w0010-15

=== Now, execution of the tool begins

BK_START 1589888140222

[2020-05-19 11:35:41] [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]
[2020-05-19 11:35:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 11:35:41] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-05-19 11:35:41] [INFO ] Transformed 80 places.
[2020-05-19 11:35:41] [INFO ] Transformed 60 transitions.
[2020-05-19 11:35:41] [INFO ] Parsed PT model containing 80 places and 60 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 269 ms. (steps per millisecond=371 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 60 rows 80 cols
[2020-05-19 11:35:41] [INFO ] Computed 50 place invariants in 5 ms
[2020-05-19 11:35:41] [INFO ] [Real]Absence check using 50 positive place invariants in 25 ms returned sat
[2020-05-19 11:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 11:35:42] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-19 11:35:42] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 6 ms.
[2020-05-19 11:35:42] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
[2020-05-19 11:35:42] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2020-05-19 11:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 11:35:42] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-19 11:35:42] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 3 ms.
[2020-05-19 11:35:42] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
[2020-05-19 11:35:42] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2020-05-19 11:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 11:35:42] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-19 11:35:42] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 5 ms.
[2020-05-19 11:35:42] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
[2020-05-19 11:35:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-19 11:35:42] [INFO ] Flatten gal took : 44 ms
FORMULA RwMutex-PT-r0020w0010-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0020w0010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 11:35:42] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 11:35:42] [INFO ] Applying decomposition
[2020-05-19 11:35:42] [INFO ] Flatten gal took : 10 ms
[2020-05-19 11:35:42] [INFO ] Input system was already deterministic with 60 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/graph612439798064554312.txt, -o, /tmp/graph612439798064554312.bin, -w, /tmp/graph612439798064554312.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/graph612439798064554312.bin, -l, -1, -v, -w, /tmp/graph612439798064554312.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 60 rows 80 cols
[2020-05-19 11:35:42] [INFO ] Decomposing Gal with order
[2020-05-19 11:35:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 11:35:42] [INFO ] Computed 50 place invariants in 14 ms
inv : p2 + p32 = 1
inv : p19 + p49 = 1
inv : p25 + p75 = 1
inv : p29 + p79 = 1
inv : p13 + p43 = 1
inv : p18 + p48 = 1
inv : p1 + p50 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p1 + p51 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p15 + p45 = 1
inv : p1 + p31 = 1
inv : p1 + p46 + p66 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p26 + p76 = 1
inv : p1 + p44 + p64 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p1 + p36 + p56 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p12 + p42 = 1
inv : p35 + p5 = 1
inv : p34 + p4 = 1
inv : p1 + p38 + p58 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p21 + p51 = 1
inv : p1 + p48 + p68 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p3 + p33 = 1
inv : p20 + p50 = 1
inv : p22 + p72 = 1
inv : p1 + p39 + p59 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p11 + p41 = 1
inv : p16 + p46 = 1
inv : p1 + p40 + p60 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p37 + p7 = 1
inv : p1 + p43 + p63 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p1 + p41 + p61 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p28 + p78 = 1
inv : p1 + p34 + p54 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p36 + p6 = 1
inv : p23 + p73 = 1
inv : p1 + p42 + p62 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p30 + p80 = 1
inv : p1 + p33 + p53 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p10 + p40 = 1
inv : p1 + p32 + p52 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p1 + p35 + p55 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p1 + p45 + p65 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p24 + p74 = 1
inv : p38 + p8 = 1
inv : p1 + p49 + p69 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p1 + p37 + p57 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p39 + p9 = 1
inv : p14 + p44 = 1
inv : p17 + p47 = 1
inv : p1 + p47 + p67 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p27 + p77 = 1
Total of 50 invariants.
[2020-05-19 11:35:42] [INFO ] Computed 50 place invariants in 16 ms
[2020-05-19 11:35:42] [INFO ] Removed a total of 360 redundant transitions.
[2020-05-19 11:35:42] [INFO ] Flatten gal took : 35 ms
[2020-05-19 11:35:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-19 11:35:42] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-19 11:35:42] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !(((!(F("((u27.p57>=1)&&(u27.p7>=1))")))U((!(G("(i8.u13.p76>=1)")))U("(i10.u15.p78>=1)"))))
Formula 0 simplified : !(!F"((u27.p57>=1)&&(u27.p7>=1))" U (!G"(i8.u13.p76>=1)" U "(i10.u15.p78>=1)"))
built 1 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
2 strongly connected components in search stack
3 transitions explored
3 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.049047,18344,1,0,539,59,1702,212,81,47,2715
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(F("(((i18.u1.p10>=1)&&(i18.u1.p60>=1))||((i0.u3.p13>=1)&&(i0.u3.p63>=1)))")))U(G(F(!(F(X("((i18.u1.p10>=1)&&(i18.u1.p60>=1))"))))))))
Formula 1 simplified : !(!F"(((i18.u1.p10>=1)&&(i18.u1.p60>=1))||((i0.u3.p13>=1)&&(i0.u3.p63>=1)))" U GF!FX"((i18.u1.p10>=1)&&(i18.u1.p60>=1))")
2 unique states visited
1 strongly connected components in search stack
3 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.051897,18748,1,0,580,59,1765,239,83,47,3031
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(X(F((F((X("((u7.p19>=1)&&(u7.p69>=1))"))||("((u7.p19>=1)&&(u7.p69>=1))")))&&(G("((u17.p3>=1)&&(u17.p53>=1))"))))))))
Formula 2 simplified : !GFXF(F("((u7.p19>=1)&&(u7.p69>=1))" | X"((u7.p19>=1)&&(u7.p69>=1))") & G"((u17.p3>=1)&&(u17.p53>=1))")
3 unique states visited
3 strongly connected components in search stack
4 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.054593,19012,1,0,671,59,1802,275,83,47,3440
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(G(F("(u17.p33>=1)"))))))
Formula 3 simplified : !GFGF"(u17.p33>=1)"
3 unique states visited
3 strongly connected components in search stack
4 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.055683,19012,1,0,698,59,1816,302,83,47,3617
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(F("(((((((((((((((((((((i6.u11.p23>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1))")))))
Formula 4 simplified : !F!F"(((((((((((((((((((((i6.u11.p23>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.069718,19764,1,0,4071,59,1964,2607,83,47,10197
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((G(("((i10.u20.p58>=1)&&(i10.u20.p8>=1))")U(G(X("((i10.u20.p58>=1)&&(i10.u20.p8>=1))")))))&&(F(X("((i5.u10.p72>=1)||(((((((((((((((((((((i19.u29.p30>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1)))"))))))
Formula 5 simplified : !X(G("((i10.u20.p58>=1)&&(i10.u20.p8>=1))" U GX"((i10.u20.p58>=1)&&(i10.u20.p8>=1))") & FX"((i5.u10.p72>=1)||(((((((((((((((((((((i19.u29.p30>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1)))")
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,0.073313,20380,1,0,4416,59,1983,2953,83,47,11279
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G("((((((((((((((((((((((i10.u15.p28>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1))||(((((((((((((((((((((i5.u10.p22>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1)))")))
Formula 6 simplified : !G"((((((((((((((((((((((i10.u15.p28>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1))||(((((((((((((((((((((i5.u10.p22>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1)))"
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,0.076979,20380,1,0,4416,59,2138,2955,83,47,11516
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F("(i5.u2.p41>=1)"))U((F("(u19.p36>=1)"))||("(i8.u13.p76>=1)"))))
Formula 7 simplified : !(F"(i5.u2.p41>=1)" U ("(i8.u13.p76>=1)" | F"(u19.p36>=1)"))
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,0.082174,20644,1,0,4800,59,2233,3308,83,47,13016
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((("((i8.u26.p20>=1)&&(i8.u26.p70>=1))")U((X(G("(u9.p51>=1)")))||("(u9.p51>=1)")))||(G("(u9.p51>=1)")))))
Formula 8 simplified : !F(G"(u9.p51>=1)" | ("((i8.u26.p20>=1)&&(i8.u26.p70>=1))" U ("(u9.p51>=1)" | XG"(u9.p51>=1)")))
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,0.084296,20644,1,0,4868,59,2268,3378,83,47,13345
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((!(("(i5.u2.p41>=1)")U("((i7.u21.p59>=1)&&(i7.u21.p9>=1))")))||("((i7.u21.p59>=1)&&(i7.u21.p9>=1))"))))
Formula 9 simplified : !X("((i7.u21.p59>=1)&&(i7.u21.p9>=1))" | !("(i5.u2.p41>=1)" U "((i7.u21.p59>=1)&&(i7.u21.p9>=1))"))
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.084848,20644,1,0,4868,59,2276,3378,83,47,13422
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0020w0010-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("(u27.p37>=1)")U(G((((F(!(F("((i19.u18.p34>=1)||(u27.p37>=1))"))))&&("(i0.u3.p13>=1)"))&&("(i0.u3.p63>=1)"))&&("(u27.p37<1)")))))
Formula 10 simplified : !("(u27.p37>=1)" U G("(i0.u3.p13>=1)" & "(i0.u3.p63>=1)" & "(u27.p37<1)" & F!F"((i19.u18.p34>=1)||(u27.p37>=1))"))
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.090247,21016,1,0,5151,59,2392,3622,85,47,14925
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(G(((((X("((i11.u6.p17>=1)&&(i11.u6.p67>=1))"))&&(!(G("((i11.u6.p17>=1)&&(i11.u6.p67>=1))"))))&&("(i11.u6.p17>=1)"))&&("(i11.u6.p67>=1)"))U("((u8.p2>=1)&&(u8.p52>=1))"))))))
Formula 11 simplified : !GFG(("(i11.u6.p17>=1)" & "(i11.u6.p67>=1)" & X"((i11.u6.p17>=1)&&(i11.u6.p67>=1))" & !G"((i11.u6.p17>=1)&&(i11.u6.p67>=1))") U "((u8.p2>=1)&&(u8.p52>=1))")
1 unique states visited
1 strongly connected components in search stack
1 transitions explored
1 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.093655,21224,1,0,5347,59,2463,3753,88,47,15788
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((F("(((((((((((((((((((((i18.u28.p25>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1))"))U(((G("(i7.u12.p74>=1)"))||("(u25.p35>=1)"))U("(u25.p35>=1)")))))
Formula 12 simplified : !X(F"(((((((((((((((((((((i18.u28.p25>=1)&&(u8.p52>=1))&&(u17.p53>=1))&&(i19.u18.p54>=1))&&(u25.p55>=1))&&(u19.p56>=1))&&(u27.p57>=1))&&(i10.u20.p58>=1))&&(i7.u21.p59>=1))&&(i18.u1.p60>=1))&&(i5.u2.p61>=1))&&(u22.p62>=1))&&(i0.u3.p63>=1))&&(u4.p64>=1))&&(i9.u5.p65>=1))&&(u23.p66>=1))&&(i11.u6.p67>=1))&&(i6.u24.p68>=1))&&(u7.p69>=1))&&(i8.u26.p70>=1))&&(u9.p71>=1))" U (("(u25.p35>=1)" | G"(i7.u12.p74>=1)") U "(u25.p35>=1)"))
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,0.096266,21224,1,0,5415,59,2538,3801,88,47,16173
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F("(i5.u2.p41>=1)")))
Formula 13 simplified : !F"(i5.u2.p41>=1)"
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,0.09735,21224,1,0,5488,59,2561,3894,88,47,16351
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RwMutex-PT-r0020w0010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-19 11:35:42] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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)
[2020-05-19 11:35:42] [INFO ] Built C files in 339ms 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 1589888142938

--------------------
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="RwMutex-PT-r0020w0010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RwMutex-PT-r0020w0010, 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 r156-oct2-158972913900298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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