Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 88K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is RwMutex-PT-r0010w0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263300496
=====================================================================

--------------------
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-r0010w0050-LTLFireability-00
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-01
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-02
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-03
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-04
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-05
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-06
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-07
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-08
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-09
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-10
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-11
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-12
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-13
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-14
FORMULA_NAME RwMutex-PT-r0010w0050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527823431848

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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.201805151631/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 16 LTL properties
Checking formula 0 : !((X("(p129>=1)")))
Formula 0 simplified : !X"(p129>=1)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 120 rows 130 cols
invariant :p68 + p8 = 1
invariant :p112 + p42 = 1
invariant :p10 + p70 = 1
invariant :p125 + p55 = 1
invariant :p128 + p58 = 1
invariant :p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + -1'p71 + -1'p81 + -1'p82 + -1'p83 + -1'p84 + -1'p85 + -1'p86 + -1'p87 + -1'p88 + -1'p89 + -1'p90 + -1'p91 + -1'p92 + -1'p93 + -1'p94 + -1'p95 + -1'p96 + -1'p97 + -1'p98 + -1'p99 = 31
invariant :p102 + p32 = 1
invariant :p26 + p96 = 1
invariant :p2 + p62 = 1
invariant :p118 + p48 = 1
invariant :p15 + p85 = 1
invariant :-1'p71 + p79 + -1'p81 + -1'p9 = -1
invariant :p63 + -1'p71 + p73 + -1'p81 = 0
invariant :p115 + p45 = 1
invariant :p120 + p50 = 1
invariant :p127 + p57 = 1
invariant :p62 + -1'p71 + p72 + -1'p81 = 0
invariant :p14 + p84 = 1
invariant :p117 + p47 = 1
invariant :p18 + p88 = 1
invariant :p129 + p59 = 1
invariant :p19 + p89 = 1
invariant :p65 + -1'p71 + p75 + -1'p81 = 0
invariant :p105 + p35 = 1
invariant :p108 + p38 = 1
invariant :p11 + p71 = 1
invariant :p69 + p9 = 1
invariant :p13 + p83 = 1
invariant :p110 + p40 = 1
invariant :p123 + p53 = 1
invariant :p66 + -1'p71 + p76 + -1'p81 = 0
invariant :p70 + -1'p71 + p80 + -1'p81 = 0
invariant :p130 + p60 = 1
invariant :p109 + p39 = 1
invariant :p3 + p63 = 1
invariant :p116 + p46 = 1
invariant :p16 + p86 = 1
invariant :p29 + p99 = 1
invariant :p100 + -1'p31 + -1'p32 + -1'p33 + -1'p34 + -1'p35 + -1'p36 + -1'p37 + -1'p38 + -1'p39 + -1'p40 + -1'p41 + -1'p42 + -1'p43 + -1'p44 + -1'p45 + -1'p46 + -1'p47 + -1'p48 + -1'p49 + -1'p50 + -1'p51 + -1'p52 + -1'p53 + -1'p54 + -1'p55 + -1'p56 + -1'p57 + -1'p58 + -1'p59 + -1'p60 + -1'p61 + p71 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 = -30
invariant :p22 + p92 = 1
invariant :-1'p7 + -1'p71 + p77 + -1'p81 = -1
invariant :p20 + p90 = 1
invariant :p124 + p54 = 1
invariant :p1 + p61 = 1
invariant :p104 + p34 = 1
invariant :p101 + p31 = 1
invariant :p111 + p41 = 1
invariant :p121 + p51 = 1
invariant :p5 + p65 = 1
invariant :p21 + p91 = 1
invariant :p23 + p93 = 1
invariant :p28 + p98 = 1
invariant :p64 + -1'p71 + p74 + -1'p81 = 0
invariant :p24 + p94 = 1
invariant :p4 + p64 = 1
invariant :p119 + p49 = 1
invariant :p113 + p43 = 1
invariant :-1'p71 + p78 + -1'p8 + -1'p81 = -1
invariant :p27 + p97 = 1
invariant :p12 + p82 = 1
invariant :p107 + p37 = 1
invariant :p25 + p95 = 1
invariant :p126 + p56 = 1
invariant :p17 + p87 = 1
invariant :p114 + p44 = 1
invariant :p6 + p66 = 1
invariant :p106 + p36 = 1
invariant :p67 + p7 = 1
invariant :p103 + p33 = 1
invariant :p122 + p52 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1158 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,11.6229,281856,1,0,8,753822,20,0,5208,174806,20
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X((X(F("(p94>=1)")))U(F(G("((p7>=1)&&(p77>=1))"))))))
Formula 1 simplified : !X(XF"(p94>=1)" U FG"((p7>=1)&&(p77>=1))")
3 unique states visited
3 strongly connected components in search stack
3 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,11.8086,286164,1,0,28,761035,33,10,5212,186506,86
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G("(((((((((((p49>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))")))
Formula 2 simplified : !G"(((((((((((p49>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"
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,11.8146,286424,1,0,29,761106,39,12,5242,186782,99
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((F(X(X("(p110>=1)"))))U(G(F("(p100>=1)")))))
Formula 3 simplified : !(FXX"(p110>=1)" U GF"(p100>=1)")
3 unique states visited
3 strongly connected components in search stack
4 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,11.8279,287124,1,0,30,761116,48,12,5243,187841,110
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((G(F(X("(((((((((((p53>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"))))U(F(("(p68>=1)")U("(((((((((((p57>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))")))))
Formula 4 simplified : !(GFX"(((((((((((p53>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))" U F("(p68>=1)" U "(((((((((((p57>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"))
1 unique states visited
0 strongly connected components in search stack
0 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,11.8306,287280,1,0,30,761116,57,12,5246,187841,114
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X("(((((((((((p33>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))")))
Formula 5 simplified : !X"(((((((((((p33>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=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,11.833,287280,1,0,30,761116,60,12,5249,187841,116
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((X(G(X("(((((((((((p32>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"))))U(X(G(F("(p66>=1)"))))))
Formula 6 simplified : !(XGX"(((((((((((p32>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))" U XGF"(p66>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.8891,288864,1,0,31,761250,69,12,5250,188080,127
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(((((((((((p41>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"))
Formula 7 simplified : !"(((((((((((p41>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"
1 unique states visited
0 strongly connected components in search stack
0 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,11.8912,288864,1,0,31,761250,72,12,5253,188080,129
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(X(F("(((((((((((p36>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))")))))
Formula 8 simplified : !XXF"(((((((((((p36>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
14 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,12.0256,291240,1,0,48,766466,81,20,5256,195598,179
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X(G(G("(p120>=1)"))))))
Formula 9 simplified : !XXG"(p120>=1)"
5 unique states visited
5 strongly connected components in search stack
5 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,12.0327,291496,1,0,49,766576,87,20,5257,195794,189
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(F(G("(p97>=1)")))))
Formula 10 simplified : !XFG"(p97>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.0899,292280,1,0,60,767875,100,31,5258,200064,271
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(G("(((((((((((p24>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"))))
Formula 11 simplified : !XG"(((((((((((p24>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=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,12.0948,292540,1,0,60,767893,106,31,5279,200083,276
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(X(X(("(p96>=1)")U("(((((((((((p30>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"))))))
Formula 12 simplified : !FXX("(p96>=1)" U "(((((((((((p30>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,12.1136,292540,1,0,60,767893,115,31,5291,200083,299
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G("(((((((((((p34>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))")))
Formula 13 simplified : !G"(((((((((((p34>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=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,12.1178,292800,1,0,60,767893,121,31,5294,200083,309
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X("(((((((((((p25>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))")))
Formula 14 simplified : !X"(((((((((((p25>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=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,12.1203,292800,1,0,60,767893,124,31,5306,200099,311
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X((X(X("((p11>=1)&&(p81>=1))")))U(F(F("(((((((((((p45>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))"))))))
Formula 15 simplified : !X(XX"((p11>=1)&&(p81>=1))" U F"(((((((((((p45>=1)&&(p72>=1))&&(p73>=1))&&(p74>=1))&&(p75>=1))&&(p76>=1))&&(p77>=1))&&(p78>=1))&&(p79>=1))&&(p80>=1))&&(p81>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,12.1463,292800,1,0,69,768217,133,39,5309,202361,366
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0050-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527823450019

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 01, 2018 3:23:54 AM fr.lip6.move.gal.application.Application start
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/, -smt]
Jun 01, 2018 3:23:54 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 3:23:54 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 124 ms
Jun 01, 2018 3:23:54 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 130 places.
Jun 01, 2018 3:23:55 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 120 transitions.
Jun 01, 2018 3:23:55 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 43 ms
Jun 01, 2018 3:23:55 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 156 ms
Jun 01, 2018 3:23:55 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
Jun 01, 2018 3:23:55 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 01, 2018 3:23:55 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 120 transitions.
Jun 01, 2018 3:23:56 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 70 place invariants in 88 ms
Jun 01, 2018 3:23:56 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 130 variables to be positive in 845 ms
Jun 01, 2018 3:23:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 120 transitions.
Jun 01, 2018 3:23:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/120 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:23:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:23:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 120 transitions.
Jun 01, 2018 3:23:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 3:24:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 120 transitions.
Jun 01, 2018 3:24:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/120) took 101 ms. Total solver calls (SAT/UNSAT): 53(52/1)
Jun 01, 2018 3:24:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(36/120) took 3200 ms. Total solver calls (SAT/UNSAT): 1198(1161/37)
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:480)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 01, 2018 3:24:08 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 13159ms conformant to PINS in folder :/home/mcc/execution

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-r0010w0050"
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

tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0010w0050.tgz
mv RwMutex-PT-r0010w0050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is RwMutex-PT-r0010w0050, 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 r212-smll-152732263300496"
echo "====================================================================="
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
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 ;