fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r181kn-smll-146444110300086
Last Updated
June 30, 2016

About the Execution of ITS-Tools for S_QuasiCertifProtocol-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4494.510 481845.00 487901.00 1600.50 FTTFFFTTFFFFFTFF normal

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)
.............
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_QuasiCertifProtocol-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444110300086
=====================================================================


--------------------
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 QuasiCertifProtocol-COL-06-LTLCardinality-0
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-1
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-15
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-2
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-3
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-4
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-5
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-6
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-7
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-8
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1464457999765


its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((X(F("2<=a3")))U(("3<=((((((n6_1+n6_2)+n6_0)+n6_5)+n6_6)+n6_3)+n6_4)")U("2<=a1"))))
Formula 0 simplified : !(XF"2<=a3" U ("3<=((((((n6_1+n6_2)+n6_0)+n6_5)+n6_6)+n6_3)+n6_4)" U "2<=a1"))
63 unique states visited
63 strongly connected components in search stack
63 transitions explored
63 items max in DFS search stack
37334 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,373.397,4025436,1,0,2332,1.49017e+07,23,3389,3603,1.28485e+07,6076
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((("2<=((((((s5_1+s5_0)+s5_3)+s5_2)+s5_5)+s5_4)+s5_6)")U("((((((((((((((((((((((((((((((((((((((((((((((((n8_2_0+n8_1_0)+n8_0_0)+n8_6_1)+n8_0_2)+n8_4_1)+n8_5_1)+n8_3_2)+n8_4_2)+n8_1_2)+n8_2_2)+n8_5_0)+n8_6_0)+n8_3_0)+n8_4_0)+n8_2_1)+n8_3_1)+n8_0_1)+n8_1_1)+n8_4_4)+n8_3_4)+n8_6_4)+n8_5_4)+n8_0_4)+n8_6_3)+n8_2_4)+n8_1_4)+n8_3_3)+n8_2_3)+n8_5_3)+n8_4_3)+n8_6_2)+n8_5_2)+n8_1_3)+n8_0_3)+n8_5_6)+n8_6_6)+n8_1_6)+n8_2_6)+n8_3_6)+n8_4_6)+n8_4_5)+n8_5_5)+n8_6_5)+n8_0_6)+n8_0_5)+n8_1_5)+n8_2_5)+n8_3_5)<=AstopOK"))U("1<=((((((Sstart_3+Sstart_2)+Sstart_1)+Sstart_0)+Sstart_6)+Sstart_5)+Sstart_4)")))
Formula 1 simplified : !(("2<=((((((s5_1+s5_0)+s5_3)+s5_2)+s5_5)+s5_4)+s5_6)" U "((((((((((((((((((((((((((((((((((((((((((((((((n8_2_0+n8_1_0)+n8_0_0)+n8_6_1)+n8_0_2)+n8_4_1)+n8_5_1)+n8_3_2)+n8_4_2)+n8_1_2)+n8_2_2)+n8_5_0)+n8_6_0)+n8_3_0)+n8_4_0)+n8_2_1)+n8_3_1)+n8_0_1)+n8_1_1)+n8_4_4)+n8_3_4)+n8_6_4)+n8_5_4)+n8_0_4)+n8_6_3)+n8_2_4)+n8_1_4)+n8_3_3)+n8_2_3)+n8_5_3)+n8_4_3)+n8_6_2)+n8_5_2)+n8_1_3)+n8_0_3)+n8_5_6)+n8_6_6)+n8_1_6)+n8_2_6)+n8_3_6)+n8_4_6)+n8_4_5)+n8_5_5)+n8_6_5)+n8_0_6)+n8_0_5)+n8_1_5)+n8_2_5)+n8_3_5)<=AstopOK") U "1<=((((((Sstart_3+Sstart_2)+Sstart_1)+Sstart_0)+Sstart_6)+Sstart_5)+Sstart_4)")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4621 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,419.619,4073512,1,0,2336,2.097e+07,46,3392,4559,1.72019e+07,6086
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(G("a1<=a2"))))
Formula 2 simplified : !XG"a1<=a2"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
545 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,425.053,4076700,1,0,2351,2.13733e+07,59,3406,4725,1.76748e+07,6131
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(X(G(F("2<=((((((c1_0+c1_1)+c1_2)+c1_3)+c1_4)+c1_5)+c1_6)"))))))
Formula 3 simplified : !GXGF"2<=((((((c1_0+c1_1)+c1_2)+c1_3)+c1_4)+c1_5)+c1_6)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
124 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,426.3,4076956,1,0,2473,2.13968e+07,68,3491,4754,1.77067e+07,6356
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(X("3<=((((((n1_0+n1_1)+n1_6)+n1_5)+n1_4)+n1_3)+n1_2)"))))
Formula 4 simplified : !XX"3<=((((((n1_0+n1_1)+n1_6)+n1_5)+n1_4)+n1_3)+n1_2)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,426.403,4077040,1,0,2483,2.14074e+07,71,3508,4773,1.77194e+07,6395
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(X(X(F("3<=a3"))))))
Formula 5 simplified : !XXXF"3<=a3"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,426.512,4077104,1,0,2600,2.14142e+07,80,3680,4775,1.77395e+07,6819
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(F(G("((((((n5_4+n5_5)+n5_2)+n5_3)+n5_0)+n5_1)+n5_6)<=a3")))))
Formula 6 simplified : !FG"((((((n5_4+n5_5)+n5_2)+n5_3)+n5_0)+n5_1)+n5_6)<=a3"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
211 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,428.626,4078752,1,0,2940,2.16234e+07,93,4134,4886,1.81547e+07,7814
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("((((((s6_0+s6_1)+s6_2)+s6_3)+s6_5)+s6_4)+s6_6)<=((((((CstopOK_0+CstopOK_1)+CstopOK_6)+CstopOK_5)+CstopOK_4)+CstopOK_3)+CstopOK_2)"))
Formula 7 simplified : !"((((((s6_0+s6_1)+s6_2)+s6_3)+s6_5)+s6_4)+s6_6)<=((((((CstopOK_0+CstopOK_1)+CstopOK_6)+CstopOK_5)+CstopOK_4)+CstopOK_3)+CstopOK_2)"
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,428.628,4078752,1,0,2940,2.16234e+07,96,4134,4901,1.81547e+07,7816
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G(G(G("3<=((((((n6_1+n6_2)+n6_0)+n6_5)+n6_6)+n6_3)+n6_4)"))))))
Formula 8 simplified : !G"3<=((((((n6_1+n6_2)+n6_0)+n6_5)+n6_6)+n6_3)+n6_4)"
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,428.63,4078760,1,0,2940,2.16234e+07,100,4134,4907,1.81547e+07,7822
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("2<=SstopAbort"))
Formula 9 simplified : !"2<=SstopAbort"
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,428.63,4078760,1,0,2940,2.16234e+07,103,4134,4909,1.81547e+07,7824
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("((((((((((((((((((((((((((((((((((((((((((((((((n7_2_0+n7_1_0)+n7_0_0)+n7_3_1)+n7_2_1)+n7_1_1)+n7_0_1)+n7_6_0)+n7_5_0)+n7_4_0)+n7_3_0)+n7_6_2)+n7_5_2)+n7_1_3)+n7_0_3)+n7_3_3)+n7_2_3)+n7_5_3)+n7_4_3)+n7_5_1)+n7_4_1)+n7_0_2)+n7_6_1)+n7_2_2)+n7_1_2)+n7_4_2)+n7_3_2)+n7_0_5)+n7_1_5)+n7_2_5)+n7_3_5)+n7_4_5)+n7_5_5)+n7_6_5)+n7_0_6)+n7_6_3)+n7_0_4)+n7_1_4)+n7_2_4)+n7_3_4)+n7_4_4)+n7_5_4)+n7_6_4)+n7_4_6)+n7_3_6)+n7_2_6)+n7_1_6)+n7_6_6)+n7_5_6)<=((((((((((((((((((((((((((((((((((((((((((((((((n8_2_0+n8_1_0)+n8_0_0)+n8_6_1)+n8_0_2)+n8_4_1)+n8_5_1)+n8_3_2)+n8_4_2)+n8_1_2)+n8_2_2)+n8_5_0)+n8_6_0)+n8_3_0)+n8_4_0)+n8_2_1)+n8_3_1)+n8_0_1)+n8_1_1)+n8_4_4)+n8_3_4)+n8_6_4)+n8_5_4)+n8_0_4)+n8_6_3)+n8_2_4)+n8_1_4)+n8_3_3)+n8_2_3)+n8_5_3)+n8_4_3)+n8_6_2)+n8_5_2)+n8_1_3)+n8_0_3)+n8_5_6)+n8_6_6)+n8_1_6)+n8_2_6)+n8_3_6)+n8_4_6)+n8_4_5)+n8_5_5)+n8_6_5)+n8_0_6)+n8_0_5)+n8_1_5)+n8_2_5)+n8_3_5)")))
Formula 10 simplified : !X"((((((((((((((((((((((((((((((((((((((((((((((((n7_2_0+n7_1_0)+n7_0_0)+n7_3_1)+n7_2_1)+n7_1_1)+n7_0_1)+n7_6_0)+n7_5_0)+n7_4_0)+n7_3_0)+n7_6_2)+n7_5_2)+n7_1_3)+n7_0_3)+n7_3_3)+n7_2_3)+n7_5_3)+n7_4_3)+n7_5_1)+n7_4_1)+n7_0_2)+n7_6_1)+n7_2_2)+n7_1_2)+n7_4_2)+n7_3_2)+n7_0_5)+n7_1_5)+n7_2_5)+n7_3_5)+n7_4_5)+n7_5_5)+n7_6_5)+n7_0_6)+n7_6_3)+n7_0_4)+n7_1_4)+n7_2_4)+n7_3_4)+n7_4_4)+n7_5_4)+n7_6_4)+n7_4_6)+n7_3_6)+n7_2_6)+n7_1_6)+n7_6_6)+n7_5_6)<=((((((((((((((((((((((((((((((((((((((((((((((((n8_2_0+n8_1_0)+n8_0_0)+n8_6_1)+n8_0_2)+n8_4_1)+n8_5_1)+n8_3_2)+n8_4_2)+n8_1_2)+n8_2_2)+n8_5_0)+n8_6_0)+n8_3_0)+n8_4_0)+n8_2_1)+n8_3_1)+n8_0_1)+n8_1_1)+n8_4_4)+n8_3_4)+n8_6_4)+n8_5_4)+n8_0_4)+n8_6_3)+n8_2_4)+n8_1_4)+n8_3_3)+n8_2_3)+n8_5_3)+n8_4_3)+n8_6_2)+n8_5_2)+n8_1_3)+n8_0_3)+n8_5_6)+n8_6_6)+n8_1_6)+n8_2_6)+n8_3_6)+n8_4_6)+n8_4_5)+n8_5_5)+n8_6_5)+n8_0_6)+n8_0_5)+n8_1_5)+n8_2_5)+n8_3_5)"
2 unique states visited
0 strongly connected components in search stack
1 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,428.653,4078760,1,0,2940,2.16234e+07,106,4134,5008,1.81547e+07,7826
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(F(("((((((n1_0+n1_1)+n1_6)+n1_5)+n1_4)+n1_3)+n1_2)<=AstopAbort")U("2<=((((((CstopOK_0+CstopOK_1)+CstopOK_6)+CstopOK_5)+CstopOK_4)+CstopOK_3)+CstopOK_2)")))))
Formula 11 simplified : !XF("((((((n1_0+n1_1)+n1_6)+n1_5)+n1_4)+n1_3)+n1_2)<=AstopAbort" U "2<=((((((CstopOK_0+CstopOK_1)+CstopOK_6)+CstopOK_5)+CstopOK_4)+CstopOK_3)+CstopOK_2)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
269 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,431.339,4079048,1,0,3119,2.16604e+07,115,4264,5027,1.81907e+07,8261
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(G(G(G("((((((CstopOK_0+CstopOK_1)+CstopOK_6)+CstopOK_5)+CstopOK_4)+CstopOK_3)+CstopOK_2)<=a3"))))))
Formula 12 simplified : !G"((((((CstopOK_0+CstopOK_1)+CstopOK_6)+CstopOK_5)+CstopOK_4)+CstopOK_3)+CstopOK_2)<=a3"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
173 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,433.078,4113372,1,0,3148,2.16633e+07,121,4402,5069,1.82102e+07,8544
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((G("3<=((((((n4_5+n4_6)+n4_3)+n4_4)+n4_1)+n4_2)+n4_0)"))U(X("1<=((((((((((((((((((((((((((((((((((((((((((((((((n7_2_0+n7_1_0)+n7_0_0)+n7_3_1)+n7_2_1)+n7_1_1)+n7_0_1)+n7_6_0)+n7_5_0)+n7_4_0)+n7_3_0)+n7_6_2)+n7_5_2)+n7_1_3)+n7_0_3)+n7_3_3)+n7_2_3)+n7_5_3)+n7_4_3)+n7_5_1)+n7_4_1)+n7_0_2)+n7_6_1)+n7_2_2)+n7_1_2)+n7_4_2)+n7_3_2)+n7_0_5)+n7_1_5)+n7_2_5)+n7_3_5)+n7_4_5)+n7_5_5)+n7_6_5)+n7_0_6)+n7_6_3)+n7_0_4)+n7_1_4)+n7_2_4)+n7_3_4)+n7_4_4)+n7_5_4)+n7_6_4)+n7_4_6)+n7_3_6)+n7_2_6)+n7_1_6)+n7_6_6)+n7_5_6)")))))
Formula 13 simplified : !X(G"3<=((((((n4_5+n4_6)+n4_3)+n4_4)+n4_1)+n4_2)+n4_0)" U X"1<=((((((((((((((((((((((((((((((((((((((((((((((((n7_2_0+n7_1_0)+n7_0_0)+n7_3_1)+n7_2_1)+n7_1_1)+n7_0_1)+n7_6_0)+n7_5_0)+n7_4_0)+n7_3_0)+n7_6_2)+n7_5_2)+n7_1_3)+n7_0_3)+n7_3_3)+n7_2_3)+n7_5_3)+n7_4_3)+n7_5_1)+n7_4_1)+n7_0_2)+n7_6_1)+n7_2_2)+n7_1_2)+n7_4_2)+n7_3_2)+n7_0_5)+n7_1_5)+n7_2_5)+n7_3_5)+n7_4_5)+n7_5_5)+n7_6_5)+n7_0_6)+n7_6_3)+n7_0_4)+n7_1_4)+n7_2_4)+n7_3_4)+n7_4_4)+n7_5_4)+n7_6_4)+n7_4_6)+n7_3_6)+n7_2_6)+n7_1_6)+n7_6_6)+n7_5_6)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,433.105,4114520,1,0,3148,2.16636e+07,128,4402,5133,1.82112e+07,8555
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(X(X("a2<=AstopOK")))))
Formula 14 simplified : !FXX"a2<=AstopOK"
3 unique states visited
0 strongly connected components in search stack
2 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,433.106,4114640,1,0,3148,2.16636e+07,137,4402,5137,1.82112e+07,8559
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X(G("Astart<=AstopOK")))))
Formula 15 simplified : !FXG"Astart<=AstopOK"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
40 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,433.498,4123896,1,0,3334,2.16673e+07,150,4588,5142,1.82248e+07,9192
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464458481610

--------------------
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
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 28, 2016 5:53:22 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2016 5:53:22 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 96 ms
May 28, 2016 5:53:22 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 270 places.
May 28, 2016 5:53:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 116 transitions.
May 28, 2016 5:53:23 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 406 ms
May 28, 2016 5:53:23 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.gal : 55 ms
May 28, 2016 5:53:23 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms

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="S_QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/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/S_QuasiCertifProtocol-PT-06.tgz
mv S_QuasiCertifProtocol-PT-06 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_QuasiCertifProtocol-PT-06, 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 r181kn-smll-146444110300086"
echo "====================================================================="
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
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 ;