About the Execution of ITS-Tools for DatabaseWithMutex-COL-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
298.370 | 6320.00 | 12065.00 | 140.00 | TTFFTFTTFTFFTFFF | 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-3253
Executing tool itstools
Input is DatabaseWithMutex-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r020-ebro-149436312000149
=====================================================================
--------------------
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 DatabaseWithMutex-COL-02-LTLCardinality-0
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-1
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-10
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-11
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-12
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-13
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-14
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-15
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-2
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-3
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-4
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-5
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-6
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-7
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-8
FORMULA_NAME DatabaseWithMutex-COL-02-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496313264069
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 : !((F(X(G(F("(all_active[0]+all_active[1])<=(((Acknowledge[0]+Acknowledge[1])+Acknowledge[2])+Acknowledge[3])"))))))
Formula 0 simplified : !FXGF"(all_active[0]+all_active[1])<=(((Acknowledge[0]+Acknowledge[1])+Acknowledge[2])+Acknowledge[3])"
21 unique states visited
0 strongly connected components in search stack
21 transitions explored
15 items max in DFS search stack
9 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.138079,25128,1,0,39,7827,24,46,1013,7350,160
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("(((Message[0]+Message[1])+Message[2])+Message[3])<=(((Active[0]+Active[1])+Active[2])+Active[3])"))
Formula 1 simplified : !"(((Message[0]+Message[1])+Message[2])+Message[3])<=(((Active[0]+Active[1])+Active[2])+Active[3])"
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.139012,25196,1,0,39,7827,27,46,1023,7350,162
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])>=1")))
Formula 2 simplified : !G"(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.140279,25488,1,0,39,7827,35,46,1030,7350,170
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(G("(((Acknowledge[0]+Acknowledge[1])+Acknowledge[2])+Acknowledge[3])>=1")))))
Formula 3 simplified : !FG"(((Acknowledge[0]+Acknowledge[1])+Acknowledge[2])+Acknowledge[3])>=1"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 38 cols
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4 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.183382,26668,1,0,123,12787,48,129,1046,16712,414
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(((MesBuffReply[0]+MesBuffReply[1])+MesBuffReply[2])+MesBuffReply[3])>=2"))
Formula 4 simplified : !"(((MesBuffReply[0]+MesBuffReply[1])+MesBuffReply[2])+MesBuffReply[3])>=2"
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.184143,26668,1,0,123,12787,51,129,1051,16712,416
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((("(all_passive[0]+all_passive[1])>=3")U("(((Message[0]+Message[1])+Message[2])+Message[3])<=(Mutex[0]+Mutex[1])"))U(X("(((updating[0]+updating[1])+updating[2])+updating[3])>=1"))))
Formula 5 simplified : !(("(all_passive[0]+all_passive[1])>=3" U "(((Message[0]+Message[1])+Message[2])+Message[3])<=(Mutex[0]+Mutex[1])") U X"(((updating[0]+updating[1])+updating[2])+updating[3])>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.219046,28672,1,0,141,13909,86,161,1125,18864,504
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F(G("(all_passive[0]+all_passive[1])>=2"))))))
Formula 6 simplified : !FXFG"(all_passive[0]+all_passive[1])>=2"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
4 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.259404,29584,1,0,202,17901,99,225,1131,27521,695
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(F("(((MesBuffReply[0]+MesBuffReply[1])+MesBuffReply[2])+MesBuffReply[3])>=1")))U(G(F("(((WaitMutex[0]+WaitMutex[1])+WaitMutex[2])+WaitMutex[3])<=(((Modify[0]+Modify[1])+Modify[2])+Modify[3])")))))
Formula 7 simplified : !(GF"(((MesBuffReply[0]+MesBuffReply[1])+MesBuffReply[2])+MesBuffReply[3])>=1" U GF"(((WaitMutex[0]+WaitMutex[1])+WaitMutex[2])+WaitMutex[3])<=(((Modify[0]+Modify[1])+Modify[2])+Modify[3])")
invariant : -1'RecBuff[0] + -1'RecBuff[1] + 1'Active[2] + 1'Active[3] + -1'Message[0] + -1'Message[1] + -1'MesBuffReply[0] + -1'MesBuffReply[1] + -1'Acknowledge[0] + -1'Acknowledge[1] + 1'all_passive[0]= 1
invariant : 1'Active[1] + 1'Active[3] + 1'Mutex[1] + 1'Modify[1] + 1'Modify[3]= 1
invariant : 1'Active[0] + 1'Active[2] + 1'Mutex[0] + 1'Modify[0] + 1'Modify[2]= 1
invariant : 1'RecBuff[0] + -1'Active[2] + 1'Message[0] + 1'MesBuffReply[0] + 1'Acknowledge[0] + 1'updating[0]= 0
invariant : -1'RecBuff[2] + -1'RecBuff[3] + 1'Active[0] + 1'Active[1] + -1'Message[2] + -1'Message[3] + -1'MesBuffReply[2] + -1'MesBuffReply[3] + -1'Acknowledge[2] + -1'Acknowledge[3] + 1'all_passive[1]= 1
invariant : 1'RecBuff[2] + -1'Active[0] + 1'Message[2] + 1'MesBuffReply[2] + 1'Acknowledge[2] + 1'updating[2]= 0
invariant : 1'RecBuff[3] + -1'Active[1] + 1'Message[3] + 1'MesBuffReply[3] + 1'Acknowledge[3] + 1'updating[3]= 0
invariant : 1'all_active[0] + 1'Active[0] + 1'Active[1] + 1'Modify[0] + 1'Modify[1] + 1'WaitMutex[0] + 1'WaitMutex[1]= 1
invariant : 1'RecBuff[1] + -1'Active[3] + 1'Message[1] + 1'MesBuffReply[1] + 1'Acknowledge[1] + 1'updating[1]= 0
invariant : 1'all_active[1] + -1'Active[0] + -1'Active[1] + -1'Mutex[0] + -1'Mutex[1] + -1'Modify[0] + -1'Modify[1] + 1'WaitMutex[2] + 1'WaitMutex[3]= -1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.272476,30492,1,0,212,18928,108,239,1169,28978,741
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((X("(((Message[0]+Message[1])+Message[2])+Message[3])>=3"))U(F("(((WaitMutex[0]+WaitMutex[1])+WaitMutex[2])+WaitMutex[3])>=3")))))
Formula 8 simplified : !G(X"(((Message[0]+Message[1])+Message[2])+Message[3])>=3" U F"(((WaitMutex[0]+WaitMutex[1])+WaitMutex[2])+WaitMutex[3])>=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,0.276698,30728,1,0,212,18959,117,240,1178,29072,777
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(X("(all_passive[0]+all_passive[1])<=(((Message[0]+Message[1])+Message[2])+Message[3])")))U(G(X("(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])>=3")))))
Formula 9 simplified : !(GX"(all_passive[0]+all_passive[1])<=(((Message[0]+Message[1])+Message[2])+Message[3])" U GX"(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])>=3")
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.286815,31780,1,0,215,19250,132,242,1238,29347,791
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X("(((WaitMutex[0]+WaitMutex[1])+WaitMutex[2])+WaitMutex[3])<=(((Modify[0]+Modify[1])+Modify[2])+Modify[3])"))U(G("(all_passive[0]+all_passive[1])>=3"))))
Formula 10 simplified : !(X"(((WaitMutex[0]+WaitMutex[1])+WaitMutex[2])+WaitMutex[3])<=(((Modify[0]+Modify[1])+Modify[2])+Modify[3])" U G"(all_passive[0]+all_passive[1])>=3")
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.291064,31932,1,0,215,19330,136,242,1238,29466,800
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(F("(all_active[0]+all_active[1])>=3"))))
Formula 11 simplified : !XF"(all_active[0]+all_active[1])>=3"
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.30083,31976,1,0,222,19948,145,266,1242,31140,887
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("(all_passive[0]+all_passive[1])>=2")U(F("(Mutex[0]+Mutex[1])<=(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])"))))
Formula 12 simplified : !("(all_passive[0]+all_passive[1])>=2" U F"(Mutex[0]+Mutex[1])<=(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])")
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.306643,32056,1,0,232,20390,154,273,1260,31651,926
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((G(F("(((updating[0]+updating[1])+updating[2])+updating[3])>=2")))U(X(G("(((updating[0]+updating[1])+updating[2])+updating[3])<=(((Modify[0]+Modify[1])+Modify[2])+Modify[3])")))))
Formula 13 simplified : !(GF"(((updating[0]+updating[1])+updating[2])+updating[3])>=2" U XG"(((updating[0]+updating[1])+updating[2])+updating[3])<=(((Modify[0]+Modify[1])+Modify[2])+Modify[3])")
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.339213,32856,1,0,271,22650,172,308,1330,37062,1054
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X((F("(((Message[0]+Message[1])+Message[2])+Message[3])>=3"))U(F("(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])>=1")))))
Formula 14 simplified : !X(F"(((Message[0]+Message[1])+Message[2])+Message[3])>=3" U F"(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])>=1")
2 unique states visited
0 strongly connected components in search stack
1 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.345377,33060,1,0,286,22943,178,320,1333,37665,1106
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(F(X("(Mutex[0]+Mutex[1])<=(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])")))))
Formula 15 simplified : !XFX"(Mutex[0]+Mutex[1])<=(((RecBuff[0]+RecBuff[1])+RecBuff[2])+RecBuff[3])"
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,0.348545,33252,1,0,288,23053,178,326,1333,38214,1120
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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]
Exit code :0
BK_STOP 1496313270389
--------------------
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 10:34:26 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 10:34:26 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 01, 2017 10:34:28 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 2226 ms
Jun 01, 2017 10:34:28 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 places.
Jun 01, 2017 10:34:28 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 01, 2017 10:34:28 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :site->all_active,all_passive,
SF->RecBuff,Active,Message,Modify,MesBuffReply,Acknowledge,updating,WaitMutex,
file->Mutex,
Jun 01, 2017 10:34:28 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 8 transitions.
Jun 01, 2017 10:34:28 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 96 ms
Jun 01, 2017 10:34:29 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 17 ms
Jun 01, 2017 10:34:29 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 41 ms
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 38 variables to be positive in 130 ms
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 32 transitions.
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/32 took 2 ms. Total solver calls (SAT/UNSAT): 4(2/2)
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 108(36/72)
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 32 transitions.
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 108(24/84)
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 32 transitions.
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 186 ms. Total solver calls (SAT/UNSAT): 528(128/400)
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 32 transitions.
Jun 01, 2017 10:34:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2017 10:34:30 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 744ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 10:34:30 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 exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Jun 01, 2017 10:34:30 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
LTS min runner thread failed on error :java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:66)
at java.lang.Thread.run(Thread.java:748)
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="DatabaseWithMutex-COL-02"
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/DatabaseWithMutex-COL-02.tgz
mv DatabaseWithMutex-COL-02 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool itstools"
echo " Input is DatabaseWithMutex-COL-02, 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 r020-ebro-149436312000149"
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 '
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 ;