Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Feb 12 03:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 03:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 02:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 02:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 5 00:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K Feb 5 00:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 07:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 4 07:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 1 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 01:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 49K Mar 10 17:31 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 Parking-PT-208-LTLFireability-00
FORMULA_NAME Parking-PT-208-LTLFireability-01
FORMULA_NAME Parking-PT-208-LTLFireability-02
FORMULA_NAME Parking-PT-208-LTLFireability-03
FORMULA_NAME Parking-PT-208-LTLFireability-04
FORMULA_NAME Parking-PT-208-LTLFireability-05
FORMULA_NAME Parking-PT-208-LTLFireability-06
FORMULA_NAME Parking-PT-208-LTLFireability-07
FORMULA_NAME Parking-PT-208-LTLFireability-08
FORMULA_NAME Parking-PT-208-LTLFireability-09
FORMULA_NAME Parking-PT-208-LTLFireability-10
FORMULA_NAME Parking-PT-208-LTLFireability-11
FORMULA_NAME Parking-PT-208-LTLFireability-12
FORMULA_NAME Parking-PT-208-LTLFireability-13
FORMULA_NAME Parking-PT-208-LTLFireability-14
FORMULA_NAME Parking-PT-208-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552922905464

Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/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 : !((G("((u25.p85>=1)&&(u29.p117>=1))")))
Formula 0 simplified : !G"((u25.p85>=1)&&(u29.p117>=1))"
built 55 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t168, t169, t170, t171, t196, t197, t198, t199, u17.t61, u17.t62, u17.t63, u17.t64, u32.t3, u32.t4, u32.t5, u32.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :84/105/12/201
Computing Next relation with stutter on 289 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
11 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.159559,20256,1,0,8282,1033,1578,8423,298,3934,21451
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F(G(("(u28.p106>=1)")U("(u33.p0>=1)"))))))
Formula 1 simplified : !FG("(u28.p106>=1)" U "(u33.p0>=1)")
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.173841,21368,1,0,8518,1041,1621,8566,300,3998,22730
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("((u23.p82>=1)&&(u30.p123>=1))")))
Formula 2 simplified : !G"((u23.p82>=1)&&(u30.p123>=1))"
Computing Next relation with stutter on 289 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.178607,21368,1,0,8518,1041,1649,8566,300,3998,22756
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("(u14.p48>=1)")))
Formula 3 simplified : !X"(u14.p48>=1)"
Computing Next relation with stutter on 289 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.179002,21368,1,0,8518,1041,1652,8566,300,3998,22776
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X((F("(u28.p106>=1)"))U(X("((u22.p80>=1)&&(u28.p104>=1))"))))))
Formula 4 simplified : !FX(F"(u28.p106>=1)" U X"((u22.p80>=1)&&(u28.p104>=1))")
Computing Next relation with stutter on 289 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.18847,21604,1,0,9431,1078,1690,9751,300,4418,25349
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(("((u5.p10>=1)&&(u12.p31>=1))")U("(u14.p48>=1)")))U((X("((u17.p70>=1)&&(u13.p42>=1))"))U(G("((u12.p36>=1)&&(u16.p65>=1))")))))
Formula 5 simplified : !(X("((u5.p10>=1)&&(u12.p31>=1))" U "(u14.p48>=1)") U (X"((u17.p70>=1)&&(u13.p42>=1))" U G"((u12.p36>=1)&&(u16.p65>=1))"))
Computing Next relation with stutter on 289 deadlock states
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.205229,23796,1,0,10501,1207,1766,11066,300,4900,27379
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F("(u29.p114>=1)"))U(G(("(u5.p10>=1)")U("(u27.p98>=1)")))))
Formula 6 simplified : !(F"(u29.p114>=1)" U G("(u5.p10>=1)" U "(u27.p98>=1)"))
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.23676,25364,1,0,12944,1485,1861,15672,301,6406,34468
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(("((u27.p99>=1)&&(u32.p136>=1))")U(F("((u10.p19>=1)&&(u14.p51>=1))")))))
Formula 7 simplified : !X("((u27.p99>=1)&&(u32.p136>=1))" U F"((u10.p19>=1)&&(u14.p51>=1))")
Computing Next relation with stutter on 289 deadlock states
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,0.252404,25892,1,0,14354,1500,1915,17222,301,6522,37523
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((("(u11.p24>=1)")U("((u12.p36>=1)&&(u16.p65>=1))"))U(G(X("((u20.p76>=1)&&(u27.p97>=1))"))))))
Formula 8 simplified : !G(("(u11.p24>=1)" U "((u12.p36>=1)&&(u16.p65>=1))") U GX"((u20.p76>=1)&&(u27.p97>=1))")
Computing Next relation with stutter on 289 deadlock states
27 unique states visited
27 strongly connected components in search stack
28 transitions explored
27 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.34571,29056,1,0,21956,1624,2014,25008,301,7729,60623
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(F(F("((u32.p136>=1)&&(u28.p108>=1))")))))
Formula 9 simplified : !F"((u32.p136>=1)&&(u28.p108>=1))"
Computing Next relation with stutter on 289 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.356005,29320,1,0,22412,1627,2035,25565,301,7847,61968
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(("((u8.p16>=1)&&(u15.p57>=1))")U(X(F("((u23.p82>=1)&&(u30.p123>=1))"))))))
Formula 10 simplified : !X("((u8.p16>=1)&&(u15.p57>=1))" U XF"((u23.p82>=1)&&(u30.p123>=1))")
Computing Next relation with stutter on 289 deadlock states
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,0.389396,29848,1,0,23806,1666,2066,27080,301,8105,65291
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F("(u13.p40>=1)"))))
Formula 11 simplified : !GF"(u13.p40>=1)"
Computing Next relation with stutter on 289 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.416514,30112,1,0,24321,1674,2125,27825,301,8264,66336
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("((u11.p21>=1)&&(u16.p66>=1))"))
Formula 12 simplified : !"((u11.p21>=1)&&(u16.p66>=1))"
Computing Next relation with stutter on 289 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.417134,30376,1,0,24321,1674,2131,27825,301,8264,66365
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(G("((u12.p33>=1)&&(u17.p70>=1))"))))
Formula 13 simplified : !XG"((u12.p33>=1)&&(u17.p70>=1))"
Computing Next relation with stutter on 289 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.418423,30640,1,0,24321,1674,2152,27825,301,8264,66422
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(("(u28.p106>=1)")U("(u2.p4>=1)"))))
Formula 14 simplified : !G("(u28.p106>=1)" U "(u2.p4>=1)")
Computing Next relation with stutter on 289 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.419787,30640,1,0,24321,1674,2178,27825,301,8264,66470
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("((u7.p14>=1)&&(u13.p38>=1))"))
Formula 15 simplified : !"((u7.p14>=1)&&(u13.p38>=1))"
Computing Next relation with stutter on 289 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.420069,30640,1,0,24321,1674,2183,27825,301,8264,66497
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 117 rows 137 cols
invariant :u7:p13 + u7:p14 + u33:p0 = 1
invariant :u29:p111 + u29:p112 + u29:p113 + u29:p114 + u29:p115 + u29:p116 + u29:p117 + u29:p118 + u33:p0 = 1
invariant :u32:p133 + u32:p134 + u32:p135 + u32:p136 + u33:p0 = 1
invariant :u26:p87 + u26:p88 + u26:p89 + u26:p90 + u26:p91 + u26:p92 + u26:p93 + -1'u27:p102 + -1'u28:p110 + -1'u29:p118 + -1'u30:p130 + -1'u31:p132 + -4'u33:p0 = -4
invariant :u26:p94 + u27:p102 + u28:p110 + u29:p118 + u30:p130 + u31:p132 + 5'u33:p0 = 5
invariant :u11:p21 + u11:p22 + u11:p23 + u11:p24 + u11:p25 + u11:p26 + u11:p27 + -1'u12:p36 + -1'u13:p44 + -1'u14:p52 + -1'u15:p64 + -1'u16:p66 + -4'u33:p0 = -4
invariant :u6:p11 + u6:p12 + u33:p0 = 1
invariant :u23:p81 + u23:p82 + u33:p0 = 1
invariant :u20:p75 + u20:p76 + u33:p0 = 1
invariant :u5:p9 + u5:p10 + u33:p0 = 1
invariant :u16:p65 + u16:p66 + u33:p0 = 1
invariant :u28:p103 + u28:p104 + u28:p105 + u28:p106 + u28:p107 + u28:p108 + u28:p109 + u28:p110 + u33:p0 = 1
invariant :u10:p19 + u10:p20 + u33:p0 = 1
invariant :u13:p37 + u13:p38 + u13:p39 + u13:p40 + u13:p41 + u13:p42 + u13:p43 + u13:p44 + u33:p0 = 1
invariant :u4:p7 + u4:p8 + u33:p0 = 1
invariant :u12:p29 + u12:p30 + u12:p31 + u12:p32 + u12:p33 + u12:p34 + u12:p35 + u12:p36 + u33:p0 = 1
invariant :u17:p67 + u17:p68 + u17:p69 + u17:p70 + u33:p0 = 1
invariant :u24:p83 + u24:p84 + u33:p0 = 1
invariant :u3:p5 + u3:p6 + u33:p0 = 1
invariant :u18:p71 + u18:p72 + u33:p0 = 1
invariant :u11:p28 + u12:p36 + u13:p44 + u14:p52 + u15:p64 + u16:p66 + 5'u33:p0 = 5
invariant :u21:p77 + u21:p78 + u33:p0 = 1
invariant :u9:p17 + u9:p18 + u33:p0 = 1
invariant :u2:p3 + u2:p4 + u33:p0 = 1
invariant :u27:p95 + u27:p96 + u27:p97 + u27:p98 + u27:p99 + u27:p100 + u27:p101 + u27:p102 + u33:p0 = 1
invariant :u1:p1 + u1:p2 + u33:p0 = 1
invariant :u25:p85 + u25:p86 + u33:p0 = 1
invariant :u8:p15 + u8:p16 + u33:p0 = 1
invariant :u15:p53 + u15:p54 + u15:p55 + u15:p56 + u15:p57 + u15:p58 + u15:p59 + u15:p60 + u15:p61 + u15:p62 + u15:p63 + u15:p64 + u33:p0 = 1
invariant :u14:p45 + u14:p46 + u14:p47 + u14:p48 + u14:p49 + u14:p50 + u14:p51 + u14:p52 + u33:p0 = 1
invariant :u30:p119 + u30:p120 + u30:p121 + u30:p122 + u30:p123 + u30:p124 + u30:p125 + u30:p126 + u30:p127 + u30:p128 + u30:p129 + u30:p130 + u33:p0 = 1
invariant :u31:p131 + u31:p132 + u33:p0 = 1
invariant :u19:p73 + u19:p74 + u33:p0 = 1
invariant :u22:p79 + u22:p80 + u33:p0 = 1
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 1552922910784

--------------------
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/ -smt
+ 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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 18, 2019 3:28:28 PM 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]
Mar 18, 2019 3:28:28 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 18, 2019 3:28:28 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 91 ms
Mar 18, 2019 3:28:28 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 137 places.
Mar 18, 2019 3:28:28 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 201 transitions.
Mar 18, 2019 3:28:28 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Mar 18, 2019 3:28:28 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 32 ms
Mar 18, 2019 3:28:28 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 18, 2019 3:28:28 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 84 ms
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 46 ms
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t131,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t148,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t151,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t179,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 8 events :t168,t168,t168,t168,t163,t163,t163,t163,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 8 events :t196,t196,t196,t196,t191,t191,t191,t191,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t123,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 6 events :t139,t137,t135,t131,t131,t131,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t176,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t121,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t133,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 6 events :t129,t127,t125,t121,t121,t121,
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 36 redundant transitions.
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 162 ms
Mar 18, 2019 3:28:29 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Mar 18, 2019 3:28:29 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 33 ms
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 84 identical transitions.
Mar 18, 2019 3:28:29 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 117 transitions.
Mar 18, 2019 3:28:30 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 34 place invariants in 162 ms
Skipping mayMatrices nes/nds SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.computeAndDeclareInvariants(KInductionSolver.java:293)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:71)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 18, 2019 3:28:30 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 702ms 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="Parking-PT-208"
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-3954"
echo " Executing tool itstools"
echo " Input is Parking-PT-208, 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 r107-oct2-155272230600322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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
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 ;