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-3254
Executing tool itstools
Input is S_PermAdmissibility-COL-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-blw7-149441652100347
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496456292257


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(("(((((((aux11[0]+aux11[1])+aux11[2])+aux11[3])+aux11[4])+aux11[5])+aux11[6])+aux11[7])<=c20[0]")U(X("(((((((aux9[0]+aux9[1])+aux9[2])+aux9[3])+aux9[4])+aux9[5])+aux9[6])+aux9[7])<=c5[0]")))))
Formula 0 simplified : !G("(((((((aux11[0]+aux11[1])+aux11[2])+aux11[3])+aux11[4])+aux11[5])+aux11[6])+aux11[7])<=c20[0]" U X"(((((((aux9[0]+aux9[1])+aux9[2])+aux9[3])+aux9[4])+aux9[5])+aux9[6])+aux9[7])<=c5[0]")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1024 rows 208 cols
invariant : 1'c14[0] + 2'c13[0] + -1'aux11[0] + -1'aux11[1] + -1'aux11[2] + -1'aux11[3] + -1'aux11[4] + -1'aux11[5] + -1'aux11[6] + -1'aux11[7] + 2'c12[0]= 0
invariant : 4'c16[0] + 4'c15[0] + 3'c14[0] + 2'c13[0] + 1'aux11[0] + 1'aux11[1] + 1'aux11[2] + 1'aux11[3] + 1'aux11[4] + 1'aux11[5] + 1'aux11[6] + 1'aux11[7] + 2'in1[0] + 2'in1[1] + 2'in1[2] + 2'in1[3] + 2'in1[4] + 2'in1[5] + 2'in1[6] + 2'in1[7] + 2'c6[0] + 4'c8[0] + 4'c7[0] + 2'aux8[0] + 2'aux8[1] + 2'aux8[2] + 2'aux8[3] + 2'aux8[4] + 2'aux8[5] + 2'aux8[6] + 2'aux8[7] + 2'aux16[0] + 2'aux16[1] + 2'aux16[2] + 2'aux16[3] + 2'aux16[4] + 2'aux16[5] + 2'aux16[6] + 2'aux16[7] + 2'c20[0] + 4'out7[0] + 4'out7[1] + 4'out7[2] + 4'out7[3] + 4'out7[4] + 4'out7[5] + 4'out7[6] + 4'out7[7]= 4
invariant : -2'c8[0] + -2'c7[0] + -1'aux8[0] + -1'aux8[1] + -1'aux8[2] + -1'aux8[3] + -1'aux8[4] + -1'aux8[5] + -1'aux8[6] + -1'aux8[7] + 1'aux6[0] + 1'aux6[1] + 1'aux6[2] + 1'aux6[3] + 1'aux6[4] + 1'aux6[5] + 1'aux6[6] + 1'aux6[7]= 0
invariant : -2'c16[0] + -2'c15[0] + -1'aux16[0] + -1'aux16[1] + -1'aux16[2] + -1'aux16[3] + -1'aux16[4] + -1'aux16[5] + -1'aux16[6] + -1'aux16[7] + 1'aux14[0] + 1'aux14[1] + 1'aux14[2] + 1'aux14[3] + 1'aux14[4] + 1'aux14[5] + 1'aux14[6] + 1'aux14[7]= 0
invariant : -1'in1[0] + -1'in1[1] + -1'in1[2] + -1'in1[3] + -1'in1[4] + -1'in1[5] + -1'in1[6] + -1'in1[7] + 1'c6[0] + 2'c5[0]= 0
invariant : -1'c16[0] + -2'c15[0] + -2'c14[0] + -2'c13[0] + 1'aux12[0] + 1'aux12[1] + 1'aux12[2] + 1'aux12[3] + 1'aux12[4] + 1'aux12[5] + 1'aux12[6] + 1'aux12[7]= 0
invariant : 1'aux9[2] + 1'aux10[2] + 1'aux11[2] + 1'aux12[2] + 1'in1[2] + 1'in3[2] + 1'in2[2] + 1'in4[2] + 1'aux8[2] + 1'aux6[2] + 1'aux7[2] + 1'aux5[2] + 1'aux16[2] + 1'aux13[2] + 1'aux15[2] + 1'aux14[2] + 1'out1[2] + 1'out5[2] + 1'out4[2] + 1'out3[2] + 1'out2[2] + 1'out8[2] + 1'out7[2] + 1'out6[2]= 1
invariant : -1'c16[0] + -2'c15[0] + -2'c14[0] + -2'c13[0] + 1'aux9[0] + 1'aux9[1] + 1'aux9[2] + 1'aux9[3] + 1'aux9[4] + 1'aux9[5] + 1'aux9[6] + 1'aux9[7] + 1'aux10[0] + 1'aux10[1] + 1'aux10[2] + 1'aux10[3] + 1'aux10[4] + 1'aux10[5] + 1'aux10[6] + 1'aux10[7] + -1'aux11[0] + -1'aux11[1] + -1'aux11[2] + -1'aux11[3] + -1'aux11[4] + -1'aux11[5] + -1'aux11[6] + -1'aux11[7] + -4'c8[0] + -2'aux8[0] + -2'aux8[1] + -2'aux8[2] + -2'aux8[3] + -2'aux8[4] + -2'aux8[5] + -2'aux8[6] + -2'aux8[7] + 2'aux7[0] + 2'aux7[1] + 2'aux7[2] + 2'aux7[3] + 2'aux7[4] + 2'aux7[5] + 2'aux7[6] + 2'aux7[7]= 0
invariant : -1'in1[0] + -1'in1[1] + -1'in1[2] + -1'in1[3] + -1'in1[4] + -1'in1[5] + -1'in1[6] + -1'in1[7] + 1'in3[0] + 1'in3[1] + 1'in3[2] + 1'in3[3] + 1'in3[4] + 1'in3[5] + 1'in3[6] + 1'in3[7]= 0
invariant : -4'c16[0] + -4'c15[0] + -5'c14[0] + 2'c13[0] + 1'aux11[0] + 1'aux11[1] + 1'aux11[2] + 1'aux11[3] + 1'aux11[4] + 1'aux11[5] + 1'aux11[6] + 1'aux11[7] + 2'in1[0] + 2'in1[1] + 2'in1[2] + 2'in1[3] + 2'in1[4] + 2'in1[5] + 2'in1[6] + 2'in1[7] + 2'c6[0] + 4'c8[0] + 4'c7[0] + 2'aux8[0] + 2'aux8[1] + 2'aux8[2] + 2'aux8[3] + 2'aux8[4] + 2'aux8[5] + 2'aux8[6] + 2'aux8[7] + 4'aux13[0] + 4'aux13[1] + 4'aux13[2] + 4'aux13[3] + 4'aux13[4] + 4'aux13[5] + 4'aux13[6] + 4'aux13[7] + -4'c17[0] + 4'out4[0] + 4'out4[1] + 4'out4[2] + 4'out4[3] + 4'out4[4] + 4'out4[5] + 4'out4[6] + 4'out4[7]= 4
invariant : 1'c16[0] + 2'c15[0] + 1'c14[0] + -1'aux10[0] + -1'aux10[1] + -1'aux10[2] + -1'aux10[3] + -1'aux10[4] + -1'aux10[5] + -1'aux10[6] + -1'aux10[7] + 1'aux11[0] + 1'aux11[1] + 1'aux11[2] + 1'aux11[3] + 1'aux11[4] + 1'aux11[5] + 1'aux11[6] + 1'aux11[7] + 2'c11[0]= 0
invariant : 2'c16[0] + 2'c15[0] + 2'c14[0] + -1'aux13[0] + -1'aux13[1] + -1'aux13[2] + -1'aux13[3] + -1'aux13[4] + -1'aux13[5] + -1'aux13[6] + -1'aux13[7] + 2'c17[0] + 1'c18[0]= 0
invariant : 4'c16[0] + 4'c15[0] + 3'c14[0] + 2'c13[0] + 1'aux11[0] + 1'aux11[1] + 1'aux11[2] + 1'aux11[3] + 1'aux11[4] + 1'aux11[5] + 1'aux11[6] + 1'aux11[7] + 2'in1[0] + 2'in1[1] + 2'in1[2] + 2'in1[3] + 2'in1[4] + 2'in1[5] + 2'in1[6] + 2'in1[7] + 2'c6[0] + 4'c8[0] + 4'c7[0] + 2'aux8[0] + 2'aux8[1] + 2'aux8[2] + 2'aux8[3] + 2'aux8[4] + 2'aux8[5] + 2'aux8[6] + 2'aux8[7] + 4'c17[0] + 4'out2[0] + 4'out2[1] + 4'out2[2] + 4'out2[3] + 4'out2[4] + 4'out2[5] + 4'out2[6] + 4'out2[7]= 4
invariant : 4'c16[0] + 4'c15[0] + 3'c14[0] + 2'c13[0] + 1'aux11[0] + 1'aux11[1] + 1'aux11[2] + 1'aux11[3] + 1'aux11[4] + 1'aux11[5] + 1'aux11[6] + 1'aux11[7] + 2'in1[0] + 2'in1[1] + 2'in1[2] + 2'in1[3] + 2'in1[4] + 2'in1[5] + 2'in1[6] + 2'in1[7] + 2'c6[0] + 4'c8[0] + 4'c7[0] + 2'aux8[0] + 2'aux8[1] + 2'aux8[2] + 2'aux8[3] + 2'aux8[4] + 2'aux8[5] + 2'aux8[6] + 2'aux8[7] + 4'c17[0] + 4'out1[0] + 4'out1[1] + 4'out1[2] + 4'out1[3] + 4'out1[4] + 4'out1[5] + 4'out1[6] + 4'out1[7]= 4
invariant : -1'c16[0] + -2'c15[0] + -1'c14[0] + -1'aux9[0] + -1'aux9[1] + -1'aux9[2] + -1'aux9[3] + -1'aux9[4] + -1'aux9[5] + -1'aux9[6] + -1'aux9[7] + 1'aux10[0] + 1'aux10[1] + 1'aux10[2] + 1'aux10[3] + 1'aux10[4] + 1'aux10[5] + 1'aux10[6] + 1'aux10[7] + 2'c110[0]= 0
invariant : -1'in1[0] + -1'in1[1] + -1'in1[2] + -1'in1[3] + -1'in1[4] + -1'in1[5] + -1'in1[6] + -1'in1[7] + -1'c6[0] + -1'c8[0] + -2'c7[0] + 1'in2[0] + 1'in2[1] + 1'in2[2] + 1'in2[3] + 1'in2[4] + 1'in2[5] + 1'in2[6] + 1'in2[7]= 0
invariant : 4'c16[0] + 4'c15[0] + 3'c14[0] + 2'c13[0] + 1'aux11[0] + 1'aux11[1] + 1'aux11[2] + 1'aux11[3] + 1'aux11[4] + 1'aux11[5] + 1'aux11[6] + 1'aux11[7] + 2'in1[0] + 2'in1[1] + 2'in1[2] + 2'in1[3] + 2'in1[4] + 2'in1[5] + 2'in1[6] + 2'in1[7] + 2'c6[0] + 4'c8[0] + 4'c7[0] + 2'aux8[0] + 2'aux8[1] + 2'aux8[2] + 2'aux8[3] + 2'aux8[4] + 2'aux8[5] + 2'aux8[6] + 2'aux8[7] + 2'aux16[0] + 2'aux16[1] + 2'aux16[2] + 2'aux16[3] + 2'aux16[4] + 2'aux16[5] + 2'aux16[6] + 2'aux16[7] + 2'c20[0] + 4'out8[0] + 4'out8[1] + 4'out8[2] + 4'out8[3] + 4'out8[4] + 4'out8[5] + 4'out8[6] + 4'out8[7]= 4
invariant : 2'c15[0] + 2'c14[0] + -1'aux13[0] + -1'aux13[1] + -1'aux13[2] + -1'aux13[3] + -1'aux13[4] + -1'aux13[5] + -1'aux13[6] + -1'aux13[7] + 1'aux15[0] + 1'aux15[1] + 1'aux15[2] + 1'aux15[3] + 1'aux15[4] + 1'aux15[5] + 1'aux15[6] + 1'aux15[7]= 0
invariant : -4'c16[0] + -4'c15[0] + -5'c14[0] + 2'c13[0] + 1'aux11[0] + 1'aux11[1] + 1'aux11[2] + 1'aux11[3] + 1'aux11[4] + 1'aux11[5] + 1'aux11[6] + 1'aux11[7] + 2'in1[0] + 2'in1[1] + 2'in1[2] + 2'in1[3] + 2'in1[4] + 2'in1[5] + 2'in1[6] + 2'in1[7] + 2'c6[0] + 4'c8[0] + 4'c7[0] + 2'aux8[0] + 2'aux8[1] + 2'aux8[2] + 2'aux8[3] + 2'aux8[4] + 2'aux8[5] + 2'aux8[6] + 2'aux8[7] + 4'aux13[0] + 4'aux13[1] + 4'aux13[2] + 4'aux13[3] + 4'aux13[4] + 4'aux13[5] + 4'aux13[6] + 4'aux13[7] + -4'c17[0] + 4'out3[0] + 4'out3[1] + 4'out3[2] + 4'out3[3] + 4'out3[4] + 4'out3[5] + 4'out3[6] + 4'out3[7]= 4
invariant : 1'aux9[4] + 1'aux10[4] + 1'aux11[4] + 1'aux12[4] + 1'in1[4] + 1'in3[4] + 1'in2[4] + 1'in4[4] + 1'aux8[4] + 1'aux6[4] + 1'aux7[4] + 1'aux5[4] + 1'aux16[4] + 1'aux13[4] + 1'aux15[4] + 1'aux14[4] + 1'out1[4] + 1'out5[4] + 1'out4[4] + 1'out3[4] + 1'out2[4] + 1'out8[4] + 1'out7[4] + 1'out6[4]= 1
invariant : 1'aux9[6] + 1'aux10[6] + 1'aux11[6] + 1'aux12[6] + 1'in1[6] + 1'in3[6] + 1'in2[6] + 1'in4[6] + 1'aux8[6] + 1'aux6[6] + 1'aux7[6] + 1'aux5[6] + 1'aux16[6] + 1'aux13[6] + 1'aux15[6] + 1'aux14[6] + 1'out1[6] + 1'out5[6] + 1'out4[6] + 1'out3[6] + 1'out2[6] + 1'out8[6] + 1'out7[6] + 1'out6[6]= 1
invariant : -4'c16[0] + -4'c15[0] + -4'c14[0] + -1'aux16[0] + -1'aux16[1] + -1'aux16[2] + -1'aux16[3] + -1'aux16[4] + -1'aux16[5] + -1'aux16[6] + -1'aux16[7] + 2'aux13[0] + 2'aux13[1] + 2'aux13[2] + 2'aux13[3] + 2'aux13[4] + 2'aux13[5] + 2'aux13[6] + 2'aux13[7] + -2'c17[0] + 1'c20[0] + 2'c19[0]= 0
invariant : 4'c16[0] + 4'c15[0] + 3'c14[0] + 2'c13[0] + 1'aux11[0] + 1'aux11[1] + 1'aux11[2] + 1'aux11[3] + 1'aux11[4] + 1'aux11[5] + 1'aux11[6] + 1'aux11[7] + 2'in1[0] + 2'in1[1] + 2'in1[2] + 2'in1[3] + 2'in1[4] + 2'in1[5] + 2'in1[6] + 2'in1[7] + 2'c6[0] + 4'c8[0] + 4'c7[0] + 2'aux8[0] + 2'aux8[1] + 2'aux8[2] + 2'aux8[3] + 2'aux8[4] + 2'aux8[5] + 2'aux8[6] + 2'aux8[7] + 2'aux16[0] + 2'aux16[1] + 2'aux16[2] + 2'aux16[3] + 2'aux16[4] + 2'aux16[5] + 2'aux16[6] + 2'aux16[7] + -2'c20[0] + 4'out5[0] + 4'out5[1] + 4'out5[2] + 4'out5[3] + 4'out5[4] + 4'out5[5] + 4'out5[6] + 4'out5[7]= 4
invariant : 1'aux9[3] + 1'aux10[3] + 1'aux11[3] + 1'aux12[3] + 1'in1[3] + 1'in3[3] + 1'in2[3] + 1'in4[3] + 1'aux8[3] + 1'aux6[3] + 1'aux7[3] + 1'aux5[3] + 1'aux16[3] + 1'aux13[3] + 1'aux15[3] + 1'aux14[3] + 1'out1[3] + 1'out5[3] + 1'out4[3] + 1'out3[3] + 1'out2[3] + 1'out8[3] + 1'out7[3] + 1'out6[3]= 1
invariant : 1'aux9[0] + 1'aux10[0] + 1'aux11[0] + 1'aux12[0] + 1'in1[0] + 1'in3[0] + 1'in2[0] + 1'in4[0] + 1'aux8[0] + 1'aux6[0] + 1'aux7[0] + 1'aux5[0] + 1'aux16[0] + 1'aux13[0] + 1'aux15[0] + 1'aux14[0] + 1'out1[0] + 1'out5[0] + 1'out4[0] + 1'out3[0] + 1'out2[0] + 1'out8[0] + 1'out7[0] + 1'out6[0]= 1
invariant : -1'in1[0] + -1'in1[1] + -1'in1[2] + -1'in1[3] + -1'in1[4] + -1'in1[5] + -1'in1[6] + -1'in1[7] + -1'c6[0] + -1'c8[0] + -2'c7[0] + 1'in4[0] + 1'in4[1] + 1'in4[2] + 1'in4[3] + 1'in4[4] + 1'in4[5] + 1'in4[6] + 1'in4[7]= 0
invariant : 4'c16[0] + 4'c15[0] + 3'c14[0] + 2'c13[0] + -4'aux9[0] + -4'aux9[1] + -4'aux9[2] + -4'aux9[3] + -4'aux9[4] + -4'aux9[5] + -4'aux9[6] + -4'aux10[0] + -4'aux10[1] + -4'aux10[2] + -4'aux10[3] + -4'aux10[4] + -4'aux10[5] + -4'aux10[6] + -3'aux11[0] + -3'aux11[1] + -3'aux11[2] + -3'aux11[3] + -3'aux11[4] + -3'aux11[5] + -3'aux11[6] + 1'aux11[7] + -4'aux12[0] + -4'aux12[1] + -4'aux12[2] + -4'aux12[3] + -4'aux12[4] + -4'aux12[5] + -4'aux12[6] + -2'in1[0] + -2'in1[1] + -2'in1[2] + -2'in1[3] + -2'in1[4] + -2'in1[5] + -2'in1[6] + 2'in1[7] + 2'c6[0] + 4'c8[0] + 4'c7[0] + -4'in3[0] + -4'in3[1] + -4'in3[2] + -4'in3[3] + -4'in3[4] + -4'in3[5] + -4'in3[6] + -4'in2[0] + -4'in2[1] + -4'in2[2] + -4'in2[3] + -4'in2[4] + -4'in2[5] + -4'in2[6] + -4'in4[0] + -4'in4[1] + -4'in4[2] + -4'in4[3] + -4'in4[4] + -4'in4[5] + -4'in4[6] + -2'aux8[0] + -2'aux8[1] + -2'aux8[2] + -2'aux8[3] + -2'aux8[4] + -2'aux8[5] + -2'aux8[6] + 2'aux8[7] + -4'aux6[0] + -4'aux6[1] + -4'aux6[2] + -4'aux6[3] + -4'aux6[4] + -4'aux6[5] + -4'aux6[6] + -4'aux7[0] + -4'aux7[1] + -4'aux7[2] + -4'aux7[3] + -4'aux7[4] + -4'aux7[5] + -4'aux7[6] + -4'aux5[0] + -4'aux5[1] + -4'aux5[2] + -4'aux5[3] + -4'aux5[4] + -4'aux5[5] + -4'aux5[6] + -2'aux16[0] + -2'aux16[1] + -2'aux16[2] + -2'aux16[3] + -2'aux16[4] + -2'aux16[5] + -2'aux16[6] + 2'aux16[7] + -4'aux13[0] + -4'aux13[1] + -4'aux13[2] + -4'aux13[3] + -4'aux13[4] + -4'aux13[5] + -4'aux13[6] + -4'aux15[0] + -4'aux15[1] + -4'aux15[2] + -4'aux15[3] + -4'aux15[4] + -4'aux15[5] + -4'aux15[6] + -4'aux14[0] + -4'aux14[1] + -4'aux14[2] + -4'aux14[3] + -4'aux14[4] + -4'aux14[5] + -4'aux14[6] + -2'c20[0] + -4'out1[0] + -4'out1[1] + -4'out1[2] + -4'out1[3] + -4'out1[4] + -4'out1[5] + -4'out1[6] + -4'out5[0] + -4'out5[1] + -4'out5[2] + -4'out5[3] + -4'out5[4] + -4'out5[5] + -4'out5[6] + -4'out4[0] + -4'out4[1] + -4'out4[2] + -4'out4[3] + -4'out4[4] + -4'out4[5] + -4'out4[6] + -4'out3[0] + -4'out3[1] + -4'out3[2] + -4'out3[3] + -4'out3[4] + -4'out3[5] + -4'out3[6] + -4'out2[0] + -4'out2[1] + -4'out2[2] + -4'out2[3] + -4'out2[4] + -4'out2[5] + -4'out2[6] + -4'out8[0] + -4'out8[1] + -4'out8[2] + -4'out8[3] + -4'out8[4] + -4'out8[5] + -4'out8[6] + -4'out7[0] + -4'out7[1] + -4'out7[2] + -4'out7[3] + -4'out7[4] + -4'out7[5] + -4'out7[6] + 4'out6[7]= -24
invariant : -1'c16[0] + -2'c15[0] + -2'c14[0] + -2'c13[0] + 1'aux9[0] + 1'aux9[1] + 1'aux9[2] + 1'aux9[3] + 1'aux9[4] + 1'aux9[5] + 1'aux9[6] + 1'aux9[7] + 1'aux10[0] + 1'aux10[1] + 1'aux10[2] + 1'aux10[3] + 1'aux10[4] + 1'aux10[5] + 1'aux10[6] + 1'aux10[7] + -1'aux11[0] + -1'aux11[1] + -1'aux11[2] + -1'aux11[3] + -1'aux11[4] + -1'aux11[5] + -1'aux11[6] + -1'aux11[7] + -4'c6[0] + -4'c8[0] + -4'c7[0] + -2'aux8[0] + -2'aux8[1] + -2'aux8[2] + -2'aux8[3] + -2'aux8[4] + -2'aux8[5] + -2'aux8[6] + -2'aux8[7] + 2'aux5[0] + 2'aux5[1] + 2'aux5[2] + 2'aux5[3] + 2'aux5[4] + 2'aux5[5] + 2'aux5[6] + 2'aux5[7]= 0
invariant : 1'aux9[1] + 1'aux10[1] + 1'aux11[1] + 1'aux12[1] + 1'in1[1] + 1'in3[1] + 1'in2[1] + 1'in4[1] + 1'aux8[1] + 1'aux6[1] + 1'aux7[1] + 1'aux5[1] + 1'aux16[1] + 1'aux13[1] + 1'aux15[1] + 1'aux14[1] + 1'out1[1] + 1'out5[1] + 1'out4[1] + 1'out3[1] + 1'out2[1] + 1'out8[1] + 1'out7[1] + 1'out6[1]= 1
invariant : 1'aux9[5] + 1'aux10[5] + 1'aux11[5] + 1'aux12[5] + 1'in1[5] + 1'in3[5] + 1'in2[5] + 1'in4[5] + 1'aux8[5] + 1'aux6[5] + 1'aux7[5] + 1'aux5[5] + 1'aux16[5] + 1'aux13[5] + 1'aux15[5] + 1'aux14[5] + 1'out1[5] + 1'out5[5] + 1'out4[5] + 1'out3[5] + 1'out2[5] + 1'out8[5] + 1'out7[5] + 1'out6[5]= 1
invariant : -1'c14[0] + -2'c13[0] + 2'aux9[0] + 2'aux9[1] + 2'aux9[2] + 2'aux9[3] + 2'aux9[4] + 2'aux9[5] + 2'aux9[6] + 2'aux9[7] + -1'aux11[0] + -1'aux11[1] + -1'aux11[2] + -1'aux11[3] + -1'aux11[4] + -1'aux11[5] + -1'aux11[6] + -1'aux11[7] + -2'aux8[0] + -2'aux8[1] + -2'aux8[2] + -2'aux8[3] + -2'aux8[4] + -2'aux8[5] + -2'aux8[6] + -2'aux8[7] + 4'c9[0]= 0
28 unique states visited
12 strongly connected components in search stack
30 transitions explored
18 items max in DFS search stack
3221 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,32.2855,861464,1,0,51,3.84763e+06,64,55,11691,221181,221
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F(X("(((((((aux5[0]+aux5[1])+aux5[2])+aux5[3])+aux5[4])+aux5[5])+aux5[6])+aux5[7])>=1")))))
Formula 1 simplified : !FX"(((((((aux5[0]+aux5[1])+aux5[2])+aux5[3])+aux5[4])+aux5[5])+aux5[6])+aux5[7])>=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,32.2865,861604,1,0,51,3.84763e+06,73,56,11702,221185,228
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((X("c6[0]<=c110[0]"))U(X("c9[0]>=2")))))
Formula 2 simplified : !G(X"c6[0]<=c110[0]" U X"c9[0]>=2")
19 unique states visited
18 strongly connected components in search stack
21 transitions explored
18 items max in DFS search stack
5 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,32.3241,863660,1,0,51,3.84763e+06,83,56,11709,221185,233
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(("c6[0]<=(((((((aux16[0]+aux16[1])+aux16[2])+aux16[3])+aux16[4])+aux16[5])+aux16[6])+aux16[7])")U("c5[0]<=c12[0]")))))
Formula 3 simplified : !XG("c6[0]<=(((((((aux16[0]+aux16[1])+aux16[2])+aux16[3])+aux16[4])+aux16[5])+aux16[6])+aux16[7])" U "c5[0]<=c12[0]")
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
57 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,32.9008,889324,1,0,78,3.85185e+06,99,100,11770,274468,420
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(("(((((((out1[0]+out1[1])+out1[2])+out1[3])+out1[4])+out1[5])+out1[6])+out1[7])<=(((((((aux8[0]+aux8[1])+aux8[2])+aux8[3])+aux8[4])+aux8[5])+aux8[6])+aux8[7])")U("(((((((aux10[0]+aux10[1])+aux10[2])+aux10[3])+aux10[4])+aux10[5])+aux10[6])+aux10[7])<=c11[0]")))))
Formula 4 simplified : !GF("(((((((out1[0]+out1[1])+out1[2])+out1[3])+out1[4])+out1[5])+out1[6])+out1[7])<=(((((((aux8[0]+aux8[1])+aux8[2])+aux8[3])+aux8[4])+aux8[5])+aux8[6])+aux8[7])" U "(((((((aux10[0]+aux10[1])+aux10[2])+aux10[3])+aux10[4])+aux10[5])+aux10[6])+aux10[7])<=c11[0]")
23 unique states visited
0 strongly connected components in search stack
29 transitions explored
17 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,33.0827,897952,1,0,88,3.85221e+06,108,111,11797,280028,496
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(G(F("(((((((out2[0]+out2[1])+out2[2])+out2[3])+out2[4])+out2[5])+out2[6])+out2[7])<=(((((((out5[0]+out5[1])+out5[2])+out5[3])+out5[4])+out5[5])+out5[6])+out5[7])"))))))
Formula 5 simplified : !FGF"(((((((out2[0]+out2[1])+out2[2])+out2[3])+out2[4])+out2[5])+out2[6])+out2[7])<=(((((((out5[0]+out5[1])+out5[2])+out5[3])+out5[4])+out5[5])+out5[6])+out5[7])"
19 unique states visited
0 strongly connected components in search stack
32 transitions explored
17 items max in DFS search stack
12 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,33.2013,903164,1,0,90,3.85243e+06,117,114,11836,280343,544
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((X("c110[0]>=2"))U(G("(((((((aux6[0]+aux6[1])+aux6[2])+aux6[3])+aux6[4])+aux6[5])+aux6[6])+aux6[7])>=2")))))
Formula 6 simplified : !F(X"c110[0]>=2" U G"(((((((aux6[0]+aux6[1])+aux6[2])+aux6[3])+aux6[4])+aux6[5])+aux6[6])+aux6[7])>=2")
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,33.2135,903472,1,0,134,3.85284e+06,130,174,11864,283440,759
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("c110[0]>=3"))
Formula 7 simplified : !"c110[0]>=3"
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,33.2144,903596,1,0,134,3.85284e+06,133,174,11866,283444,764
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F(G("(((((((in1[0]+in1[1])+in1[2])+in1[3])+in1[4])+in1[5])+in1[6])+in1[7])<=(((((((aux12[0]+aux12[1])+aux12[2])+aux12[3])+aux12[4])+aux12[5])+aux12[6])+aux12[7])")))U(F(G("(((((((aux9[0]+aux9[1])+aux9[2])+aux9[3])+aux9[4])+aux9[5])+aux9[6])+aux9[7])<=(((((((aux5[0]+aux5[1])+aux5[2])+aux5[3])+aux5[4])+aux5[5])+aux5[6])+aux5[7])")))))
Formula 8 simplified : !(FG"(((((((in1[0]+in1[1])+in1[2])+in1[3])+in1[4])+in1[5])+in1[6])+in1[7])<=(((((((aux12[0]+aux12[1])+aux12[2])+aux12[3])+aux12[4])+aux12[5])+aux12[6])+aux12[7])" U FG"(((((((aux9[0]+aux9[1])+aux9[2])+aux9[3])+aux9[4])+aux9[5])+aux9[6])+aux9[7])<=(((((((aux5[0]+aux5[1])+aux5[2])+aux5[3])+aux5[4])+aux5[5])+aux5[6])+aux5[7])")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,33.3942,908052,1,0,161,3.85338e+06,146,234,11986,316453,962
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((("(((((((out6[0]+out6[1])+out6[2])+out6[3])+out6[4])+out6[5])+out6[6])+out6[7])<=(((((((aux12[0]+aux12[1])+aux12[2])+aux12[3])+aux12[4])+aux12[5])+aux12[6])+aux12[7])")U("(((((((aux13[0]+aux13[1])+aux13[2])+aux13[3])+aux13[4])+aux13[5])+aux13[6])+aux13[7])<=(((((((aux9[0]+aux9[1])+aux9[2])+aux9[3])+aux9[4])+aux9[5])+aux9[6])+aux9[7])"))U(("c5[0]<=(((((((aux13[0]+aux13[1])+aux13[2])+aux13[3])+aux13[4])+aux13[5])+aux13[6])+aux13[7])")U("c14[0]>=3"))))
Formula 9 simplified : !(("(((((((out6[0]+out6[1])+out6[2])+out6[3])+out6[4])+out6[5])+out6[6])+out6[7])<=(((((((aux12[0]+aux12[1])+aux12[2])+aux12[3])+aux12[4])+aux12[5])+aux12[6])+aux12[7])" U "(((((((aux13[0]+aux13[1])+aux13[2])+aux13[3])+aux13[4])+aux13[5])+aux13[6])+aux13[7])<=(((((((aux9[0]+aux9[1])+aux9[2])+aux9[3])+aux9[4])+aux9[5])+aux9[6])+aux9[7])") U ("c5[0]<=(((((((aux13[0]+aux13[1])+aux13[2])+aux13[3])+aux13[4])+aux13[5])+aux13[6])+aux13[7])" U "c14[0]>=3"))
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 items max in DFS search stack
75 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,34.137,938572,1,0,161,3.85482e+06,181,234,12312,318360,1144
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(("(((((((aux15[0]+aux15[1])+aux15[2])+aux15[3])+aux15[4])+aux15[5])+aux15[6])+aux15[7])>=1")U(F("(((((((out1[0]+out1[1])+out1[2])+out1[3])+out1[4])+out1[5])+out1[6])+out1[7])>=2")))))
Formula 10 simplified : !G("(((((((aux15[0]+aux15[1])+aux15[2])+aux15[3])+aux15[4])+aux15[5])+aux15[6])+aux15[7])>=1" U F"(((((((out1[0]+out1[1])+out1[2])+out1[3])+out1[4])+out1[5])+out1[6])+out1[7])>=2")
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
13 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,34.2652,943760,1,0,161,3.85482e+06,190,234,12328,318375,1182
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("(((((((aux6[0]+aux6[1])+aux6[2])+aux6[3])+aux6[4])+aux6[5])+aux6[6])+aux6[7])<=(((((((out3[0]+out3[1])+out3[2])+out3[3])+out3[4])+out3[5])+out3[6])+out3[7])"))
Formula 11 simplified : !"(((((((aux6[0]+aux6[1])+aux6[2])+aux6[3])+aux6[4])+aux6[5])+aux6[6])+aux6[7])<=(((((((out3[0]+out3[1])+out3[2])+out3[3])+out3[4])+out3[5])+out3[6])+out3[7])"
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,34.2666,943760,1,0,161,3.85482e+06,193,234,12345,318375,1184
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(("c17[0]<=(((((((aux13[0]+aux13[1])+aux13[2])+aux13[3])+aux13[4])+aux13[5])+aux13[6])+aux13[7])")U(G("(((((((out3[0]+out3[1])+out3[2])+out3[3])+out3[4])+out3[5])+out3[6])+out3[7])>=1")))))
Formula 12 simplified : !X("c17[0]<=(((((((aux13[0]+aux13[1])+aux13[2])+aux13[3])+aux13[4])+aux13[5])+aux13[6])+aux13[7])" U G"(((((((out3[0]+out3[1])+out3[2])+out3[3])+out3[4])+out3[5])+out3[6])+out3[7])>=1")
17 unique states visited
0 strongly connected components in search stack
29 transitions explored
15 items max in DFS search stack
56 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,34.8216,966804,1,0,197,3.85606e+06,214,314,12434,322798,1556
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X(G("(((((((in2[0]+in2[1])+in2[2])+in2[3])+in2[4])+in2[5])+in2[6])+in2[7])<=c7[0]")))U(F(X("(((((((in2[0]+in2[1])+in2[2])+in2[3])+in2[4])+in2[5])+in2[6])+in2[7])>=2")))))
Formula 13 simplified : !(XG"(((((((in2[0]+in2[1])+in2[2])+in2[3])+in2[4])+in2[5])+in2[6])+in2[7])<=c7[0]" U FX"(((((((in2[0]+in2[1])+in2[2])+in2[3])+in2[4])+in2[5])+in2[6])+in2[7])>=2")
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,34.8229,967204,1,0,197,3.85606e+06,223,314,12443,322798,1560
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(F(F("c9[0]<=c12[0]")))))
Formula 14 simplified : !XF"c9[0]<=c12[0]"
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,34.8235,967320,1,0,197,3.85606e+06,232,314,12446,322798,1564
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X(G(G("(((((((aux14[0]+aux14[1])+aux14[2])+aux14[3])+aux14[4])+aux14[5])+aux14[6])+aux14[7])>=1"))))))
Formula 15 simplified : !GXG"(((((((aux14[0]+aux14[1])+aux14[2])+aux14[3])+aux14[4])+aux14[5])+aux14[6])+aux14[7])>=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,34.825,967348,1,0,197,3.85606e+06,238,314,12461,322804,1572
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA PermAdmissibility-COL-01-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exit code :0

BK_STOP 1496456333651

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.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 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 03, 2017 2:18:13 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2017 2:18:13 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 03, 2017 2:18:14 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1254 ms
Jun 03, 2017 2:18:14 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 40 places.
Jun 03, 2017 2:18:14 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 03, 2017 2:18:14 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :input->aux9,aux10,aux11,aux12,in1,in3,in2,in4,aux8,aux6,aux7,aux5,aux16,aux13,aux15,aux14,out1,out5,out4,out3,out2,out8,out7,out6,
Dot->c16,c15,c14,c13,c6,c5,c8,c7,c9,c12,c110,c11,c17,c20,c18,c19,

Jun 03, 2017 2:18:15 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 16 transitions.
Jun 03, 2017 2:18:15 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 03, 2017 2:18:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 214 ms
Jun 03, 2017 2:18:15 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 25 ms
Jun 03, 2017 2:18:15 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 03, 2017 2:18:16 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 31 place invariants in 225 ms
Jun 03, 2017 2:18:35 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 208 variables to be positive in 18730 ms
Jun 03, 2017 2:18:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 1024 transitions.
Jun 03, 2017 2:18:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/1024 took 48 ms. Total solver calls (SAT/UNSAT): 158(0/158)
Jun 03, 2017 2:18:36 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :31/1024 took 1076 ms. Total solver calls (SAT/UNSAT): 5056(28/5028)
Jun 03, 2017 2:18:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :61/1024 took 2090 ms. Total solver calls (SAT/UNSAT): 9796(55/9741)
Jun 03, 2017 2:18:38 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :77/1024 took 3114 ms. Total solver calls (SAT/UNSAT): 12534(572/11962)
Jun 03, 2017 2:18:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :92/1024 took 4127 ms. Total solver calls (SAT/UNSAT): 15129(1131/13998)
Jun 03, 2017 2:18:40 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :107/1024 took 5171 ms. Total solver calls (SAT/UNSAT): 17724(1733/15991)
Jun 03, 2017 2:18:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :122/1024 took 6210 ms. Total solver calls (SAT/UNSAT): 20319(2292/18027)
Jun 03, 2017 2:18:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :146/1024 took 7220 ms. Total solver calls (SAT/UNSAT): 24186(2480/21706)
Jun 03, 2017 2:18:43 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :181/1024 took 8236 ms. Total solver calls (SAT/UNSAT): 29716(2512/27204)
Jun 03, 2017 2:18:53 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions switch11, switch10, switch9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/13/3/16
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states
Computing Next relation with stutter on 18688 deadlock states

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_PermAdmissibility-COL-01"
export BK_EXAMINATION="LTLCardinality"
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/S_PermAdmissibility-COL-01.tgz
mv S_PermAdmissibility-COL-01 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_PermAdmissibility-COL-01, 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 r120-blw7-149441652100347"
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 ;