fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r070-csrt-149440964600077
Last Updated
June 27, 2017

About the Execution of ITS-Tools for ResAllocation-PT-R003C010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
351.290 4331.00 9290.00 148.60 FFTFFTFFFFTFFFFF 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-3254
Executing tool itstools
Input is ResAllocation-PT-R003C010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-csrt-149440964600077
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496306779750


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 : !(("p_9_2>=3"))
Formula 0 simplified : !"p_9_2>=3"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 40 rows 60 cols
invariant : -1'p_0_0 + -1'r_0_0 + 1'r_1_0 + 1'p_2_0= 0
invariant : -1'p_0_2 + -1'r_0_2 + 1'r_1_2 + -1'r_2_2 + 1'r_3_2 + -1'r_4_2 + 1'r_5_2 + 1'p_6_2= 0
invariant : 1'p_0_0 + 1'r_0_0 + 1'p_1_0= 1
invariant : 1'p_0_2 + 1'r_0_2 + -1'r_1_2 + 1'r_2_2 + 1'p_3_2= 1
invariant : -1'p_0_2 + -1'r_0_2 + 1'r_1_2 + -1'r_2_2 + 1'r_3_2 + 1'p_4_2= 0
invariant : 1'p_0_1 + 1'r_0_1 + 1'p_1_1= 1
invariant : 1'p_0_2 + 1'r_0_2 + -1'r_1_2 + 1'r_2_2 + -1'r_3_2 + 1'r_4_2 + -1'r_5_2 + 1'r_6_2 + 1'p_7_2= 1
invariant : 1'p_0_2 + 1'r_0_2 + -1'r_1_2 + 1'r_2_2 + -1'r_3_2 + 1'r_4_2 + 1'p_5_2= 1
invariant : 1'p_0_0 + 1'r_0_0 + -1'r_1_0 + 1'r_2_0 + 1'p_3_0= 1
invariant : 1'p_0_0 + 1'r_0_0 + -1'r_1_0 + 1'r_2_0 + -1'r_3_0 + 1'r_4_0 + 1'p_5_0= 1
invariant : -1'p_0_0 + -1'r_0_0 + 1'r_1_0 + -1'r_2_0 + 1'r_3_0 + -1'r_4_0 + 1'r_5_0 + 1'p_6_0= 0
invariant : 1'p_0_1 + 1'r_0_1 + -1'r_1_1 + 1'r_2_1 + -1'r_3_1 + 1'r_4_1 + -1'r_5_1 + 1'r_6_1 + -1'r_7_1 + 1'r_8_1 + 1'p_9_1= 1
invariant : 1'p_0_2 + 1'r_0_2 + -1'r_1_2 + 1'r_2_2 + -1'r_3_2 + 1'r_4_2 + -1'r_5_2 + 1'r_6_2 + -1'r_7_2 + 1'r_8_2 + 1'p_9_2= 1
invariant : -1'p_0_0 + -1'r_0_0 + 1'r_1_0 + -1'r_2_0 + 1'r_3_0 + -1'r_4_0 + 1'r_5_0 + -1'r_6_0 + 1'r_7_0 + -1'r_8_0 + 1'r_9_0= 0
invariant : -1'p_0_0 + -1'r_0_0 + 1'r_1_0 + -1'r_2_0 + 1'r_3_0 + 1'p_4_0= 0
invariant : 1'p_0_0 + 1'r_0_0 + -1'r_1_0 + 1'r_2_0 + -1'r_3_0 + 1'r_4_0 + -1'r_5_0 + 1'r_6_0 + 1'p_7_0= 1
invariant : -1'p_0_2 + -1'r_0_2 + 1'r_1_2 + -1'r_2_2 + 1'r_3_2 + -1'r_4_2 + 1'r_5_2 + -1'r_6_2 + 1'r_7_2 + 1'p_8_2= 0
invariant : -1'p_0_1 + -1'r_0_1 + 1'r_1_1 + -1'r_2_1 + 1'r_3_1 + -1'r_4_1 + 1'r_5_1 + 1'p_6_1= 0
invariant : -1'p_0_2 + -1'r_0_2 + 1'r_1_2 + 1'p_2_2= 0
invariant : -1'p_0_1 + -1'r_0_1 + 1'r_1_1 + -1'r_2_1 + 1'r_3_1 + -1'r_4_1 + 1'r_5_1 + -1'r_6_1 + 1'r_7_1 + 1'p_8_1= 0
invariant : 1'p_0_2 + 1'r_0_2 + 1'p_1_2= 1
invariant : 1'p_0_1 + 1'r_0_1 + -1'r_1_1 + 1'r_2_1 + 1'p_3_1= 1
invariant : 1'p_0_1 + 1'r_0_1 + -1'r_1_1 + 1'r_2_1 + -1'r_3_1 + 1'r_4_1 + 1'p_5_1= 1
invariant : -1'p_0_1 + -1'r_0_1 + 1'r_1_1 + -1'r_2_1 + 1'r_3_1 + -1'r_4_1 + 1'r_5_1 + -1'r_6_1 + 1'r_7_1 + -1'r_8_1 + 1'r_9_1= 0
invariant : -1'p_0_1 + -1'r_0_1 + 1'r_1_1 + 1'p_2_1= 0
invariant : -1'p_0_2 + -1'r_0_2 + 1'r_1_2 + -1'r_2_2 + 1'r_3_2 + -1'r_4_2 + 1'r_5_2 + -1'r_6_2 + 1'r_7_2 + -1'r_8_2 + 1'r_9_2= 0
invariant : 1'p_0_0 + 1'r_0_0 + -1'r_1_0 + 1'r_2_0 + -1'r_3_0 + 1'r_4_0 + -1'r_5_0 + 1'r_6_0 + -1'r_7_0 + 1'r_8_0 + 1'p_9_0= 1
invariant : 1'p_0_1 + 1'r_0_1 + -1'r_1_1 + 1'r_2_1 + -1'r_3_1 + 1'r_4_1 + -1'r_5_1 + 1'r_6_1 + 1'p_7_1= 1
invariant : -1'p_0_0 + -1'r_0_0 + 1'r_1_0 + -1'r_2_0 + 1'r_3_0 + -1'r_4_0 + 1'r_5_0 + -1'r_6_0 + 1'r_7_0 + 1'p_8_0= 0
invariant : -1'p_0_1 + -1'r_0_1 + 1'r_1_1 + -1'r_2_1 + 1'r_3_1 + 1'p_4_1= 0
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
33 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.360868,33340,1,0,103,46194,106,47,1953,64989,102
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(F(X(F("r_3_2<=r_4_2"))))))
Formula 1 simplified : !XFXF"r_3_2<=r_4_2"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 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.529122,38652,1,0,183,70762,115,102,1958,107271,248
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G((X("p_2_0<=p_9_0"))U("r_4_1<=p_3_0"))))
Formula 2 simplified : !G(X"p_2_0<=p_9_0" U "r_4_1<=p_3_0")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.62037,42660,1,0,188,85648,121,106,1967,130339,262
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(F("p_5_1>=3"))))
Formula 3 simplified : !GF"p_5_1>=3"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.621572,42768,1,0,188,85648,130,106,1969,130355,268
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((X(X("p_7_2>=1")))U(F("p_1_1<=p_4_1"))))
Formula 4 simplified : !(XX"p_7_2>=1" U F"p_1_1<=p_4_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,0.622128,43052,1,0,188,85648,139,106,1973,130357,272
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("r_4_0<=p_0_0"))
Formula 5 simplified : !"r_4_0<=p_0_0"
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.622451,43052,1,0,188,85648,142,106,1976,130357,274
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((X("p_4_2>=3"))U(F(G("r_4_2>=1")))))
Formula 6 simplified : !(X"p_4_2>=3" U FG"r_4_2>=1")
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]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
42 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,1.04698,54340,1,0,280,133791,155,198,1977,221031,497
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((("r_5_1<=p_8_0")U("r_6_0<=p_3_2"))U("r_6_2>=3")))
Formula 7 simplified : !(("r_5_1<=p_8_0" U "r_6_0<=p_3_2") U "r_6_2>=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,1.04934,55176,1,0,280,133791,177,198,2002,221031,503
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(G(("r_1_0>=2")U("p_6_1>=3")))))
Formula 8 simplified : !XG("r_1_0>=2" U "p_6_1>=3")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.07974,56400,1,0,280,138056,193,198,2013,229775,512
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(F(X(G("p_5_0>=3"))))))
Formula 9 simplified : !XFXG"p_5_0>=3"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
26 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,1.33637,67508,1,0,311,180946,206,265,2015,315772,719
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("r_0_2<=r_7_1"))
Formula 10 simplified : !"r_0_2<=r_7_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,1.33693,67512,1,0,311,180946,209,265,2018,315772,721
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("p_7_1>=3"))
Formula 11 simplified : !"p_7_1>=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,1.33732,67616,1,0,311,180946,212,265,2020,315773,723
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(F(F(X("p_2_2>=3"))))))
Formula 12 simplified : !FX"p_2_2>=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,1.34325,67776,1,0,314,181115,221,272,2022,316577,797
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F("p_2_2<=p_5_2")))
Formula 13 simplified : !F"p_2_2<=p_5_2"
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,1.34362,67912,1,0,314,181115,230,272,2026,316578,801
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(G(X(X("r_2_2>=1"))))))
Formula 14 simplified : !XGXX"r_2_2>=1"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
26 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,1.61186,75092,1,0,368,213083,236,324,2027,373602,937
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(("r_4_1<=r_5_0")U("p_4_1>=1"))))
Formula 15 simplified : !F("r_4_1<=r_5_0" U "p_4_1>=1")
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA ResAllocation-PT-R003C010-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496306784081

--------------------
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 01, 2017 8:46:21 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 8:46:21 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 60 ms
Jun 01, 2017 8:46:21 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 60 places.
Jun 01, 2017 8:46:21 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 transitions.
Jun 01, 2017 8:46:21 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 49 ms
Jun 01, 2017 8:46:21 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
Jun 01, 2017 8:46:21 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 23 ms
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 60 variables to be positive in 131 ms
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 40 transitions.
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/40 took 1 ms. Total solver calls (SAT/UNSAT): 4(2/2)
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 102 ms. Total solver calls (SAT/UNSAT): 208(94/114)
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 40 transitions.
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 72 ms. Total solver calls (SAT/UNSAT): 208(78/130)
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 40 transitions.
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 167 ms. Total solver calls (SAT/UNSAT): 820(687/133)
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 40 transitions.
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2017 8:46:22 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 708ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 8:46:23 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>(((LTLAP21==true))U((LTLAP22==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 63, guards 40
pins2lts-seq, 0.004: LTL layer: formula: <>(((LTLAP21==true))U((LTLAP22==true)))
pins2lts-seq, 0.004: Expression is: (<> ((LTLAP21 == true ) U (LTLAP22 == true )))
pins2lts-seq, 0.004: buchi has 1 states
pins2lts-seq, 0.004: state 0: accepting
pins2lts-seq, 0.005: -> 0, | !(LTLAP22 == true )
pins2lts-seq, 0.005: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.005: There are 64 state labels and 1 edge labels
pins2lts-seq, 0.005: State length is 61, there are 41 groups
pins2lts-seq, 0.005: Running scc search strategy
pins2lts-seq, 0.005: Using a tree for state storage
pins2lts-seq, 0.005: Visible groups: 0 / 41, labels: 1 / 64
pins2lts-seq, 0.005: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.007: accepting cycle found!
pins2lts-seq, 0.007: exiting now

Jun 01, 2017 8:46:23 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 01, 2017 8:46:23 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 01, 2017 8:46:23 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null

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="ResAllocation-PT-R003C010"
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/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ResAllocation-PT-R003C010, 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 r070-csrt-149440964600077"
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 ;