About the Execution of ITS-Tools for DNAwalker-PT-12ringLLLarge
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3007.750 | 280777.00 | 564434.00 | 236.50 | TFFTFTTFTTTFTTTF | 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 DNAwalker-PT-12ringLLLarge, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-blw3-149440266500104
=====================================================================
--------------------
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 DNAwalker-PT-12ringLLLarge-LTLCardinality-0
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-1
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-15
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-2
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-3
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-4
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-5
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-6
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-7
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-8
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496243810202
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("A19<=A1")))
Formula 0 simplified : !F"A19<=A1"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 312 rows 33 cols
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
2843 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,28.4576,423820,1,0,876,2.31166e+06,625,293,3186,2.54596e+06,610
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((G("A21>=3"))U(G(G("A24>=2")))))
Formula 1 simplified : !(G"A21>=3" U G"A24>=2")
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
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-1 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5062 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,79.0807,1508004,1,0,907,5.77204e+06,649,293,3290,9.40634e+06,725
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(F(("A6>=2")U("A1<=A3")))))
Formula 2 simplified : !GF("A6>=2" U "A1<=A3")
39 unique states visited
0 strongly connected components in search stack
39 transitions explored
32 items max in DFS search stack
1594 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,95.019,1838496,1,0,921,5.97062e+06,658,299,3297,1.24216e+07,933
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("A23>=1"))
Formula 3 simplified : !"A23>=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,95.0194,1838500,1,0,921,5.97062e+06,661,299,3298,1.24216e+07,935
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((G(G("A23<=A18")))U("A21>=1")))
Formula 4 simplified : !(G"A23<=A18" U "A21>=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,95.0208,1838644,1,0,921,5.97062e+06,671,299,3305,1.24216e+07,939
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("A12<=A3"))
Formula 5 simplified : !"A12<=A3"
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,95.0211,1838892,1,0,921,5.97062e+06,674,299,3309,1.24216e+07,941
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F("A1<=A24")))
Formula 6 simplified : !F"A1<=A24"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,95.0394,1839252,1,0,938,5.97242e+06,683,307,3312,1.24248e+07,988
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("A25<=A20"))
Formula 7 simplified : !"A25<=A20"
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,95.0398,1839252,1,0,938,5.97242e+06,686,307,3315,1.24248e+07,990
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("A10>=1"))
Formula 8 simplified : !"A10>=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,95.0406,1839304,1,0,938,5.97242e+06,689,307,3316,1.24248e+07,992
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(F(X(G("A17<=B3"))))))
Formula 9 simplified : !XFXG"A17<=B3"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
15915 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,254.185,2480176,1,0,969,8.22804e+06,20,317,1106,1.72124e+07,187
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(X(F("B18<=B2")))))
Formula 10 simplified : !FXF"B18<=B2"
Exit code :1
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.
BK_STOP 1496244090979
--------------------
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
May 31, 2017 3:16:51 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 3:16:51 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 103 ms
May 31, 2017 3:16:51 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
May 31, 2017 3:16:52 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 312 transitions.
May 31, 2017 3:16:52 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 91 ms
May 31, 2017 3:16:52 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 16 ms
May 31, 2017 3:16:52 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
May 31, 2017 3:16:52 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 12 ms
May 31, 2017 3:16:52 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 33 variables to be positive in 119 ms
May 31, 2017 3:16:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 312 transitions.
May 31, 2017 3:16:52 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/312 took 7 ms. Total solver calls (SAT/UNSAT): 14(0/14)
May 31, 2017 3:16:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :43/312 took 1023 ms. Total solver calls (SAT/UNSAT): 1787(929/858)
May 31, 2017 3:16:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :84/312 took 2039 ms. Total solver calls (SAT/UNSAT): 3546(1850/1696)
May 31, 2017 3:16:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :119/312 took 3052 ms. Total solver calls (SAT/UNSAT): 5263(2751/2512)
May 31, 2017 3:16:56 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :156/312 took 4060 ms. Total solver calls (SAT/UNSAT): 7076(3717/3359)
May 31, 2017 3:16:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :200/312 took 5072 ms. Total solver calls (SAT/UNSAT): 8897(4677/4220)
May 31, 2017 3:16:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :242/312 took 6090 ms. Total solver calls (SAT/UNSAT): 10753(5644/5109)
May 31, 2017 3:16:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :276/312 took 7101 ms. Total solver calls (SAT/UNSAT): 12620(6614/6006)
May 31, 2017 3:17:00 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 7936 ms. Total solver calls (SAT/UNSAT): 14161(7436/6725)
May 31, 2017 3:17:00 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 312 transitions.
May 31, 2017 3:17:01 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :53/312 took 1010 ms. Total solver calls (SAT/UNSAT): 2217(532/1685)
May 31, 2017 3:17:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :104/312 took 2010 ms. Total solver calls (SAT/UNSAT): 4439(1057/3382)
May 31, 2017 3:17:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :146/312 took 3022 ms. Total solver calls (SAT/UNSAT): 6622(1672/4950)
May 31, 2017 3:17:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :199/312 took 4041 ms. Total solver calls (SAT/UNSAT): 8839(2179/6660)
May 31, 2017 3:17:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :249/312 took 5056 ms. Total solver calls (SAT/UNSAT): 11083(2720/8363)
May 31, 2017 3:17:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :285/312 took 6058 ms. Total solver calls (SAT/UNSAT): 13193(3389/9804)
May 31, 2017 3:17:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 6514 ms. Total solver calls (SAT/UNSAT): 14161(3701/10460)
May 31, 2017 3:17:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 312 transitions.
May 31, 2017 3:17:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(8/312) took 982 ms. Total solver calls (SAT/UNSAT): 2772(2772/0)
May 31, 2017 3:17:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(18/312) took 2032 ms. Total solver calls (SAT/UNSAT): 5757(5757/0)
May 31, 2017 3:17:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(28/312) took 3036 ms. Total solver calls (SAT/UNSAT): 8642(8642/0)
May 31, 2017 3:17:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(39/312) took 4101 ms. Total solver calls (SAT/UNSAT): 11700(11700/0)
May 31, 2017 3:17:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(50/312) took 5181 ms. Total solver calls (SAT/UNSAT): 14637(14637/0)
May 31, 2017 3:17:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(62/312) took 6267 ms. Total solver calls (SAT/UNSAT): 17703(17703/0)
May 31, 2017 3:17:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(74/312) took 7284 ms. Total solver calls (SAT/UNSAT): 20625(20625/0)
May 31, 2017 3:17:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(87/312) took 8332 ms. Total solver calls (SAT/UNSAT): 23628(23628/0)
May 31, 2017 3:17:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(101/312) took 9393 ms. Total solver calls (SAT/UNSAT): 26673(26673/0)
May 31, 2017 3:17:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(116/312) took 10456 ms. Total solver calls (SAT/UNSAT): 29718(29718/0)
May 31, 2017 3:17:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(132/312) took 11502 ms. Total solver calls (SAT/UNSAT): 32718(32718/0)
May 31, 2017 3:17:19 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(149/312) took 12537 ms. Total solver calls (SAT/UNSAT): 35625(35625/0)
May 31, 2017 3:17:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(168/312) took 13586 ms. Total solver calls (SAT/UNSAT): 38532(38532/0)
May 31, 2017 3:17:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(189/312) took 14592 ms. Total solver calls (SAT/UNSAT): 41325(41325/0)
May 31, 2017 3:17:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(215/312) took 15600 ms. Total solver calls (SAT/UNSAT): 44172(44172/0)
May 31, 2017 3:17:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(252/312) took 16615 ms. Total solver calls (SAT/UNSAT): 47058(47058/0)
May 31, 2017 3:17:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 17238 ms. Total solver calls (SAT/UNSAT): 48828(48828/0)
May 31, 2017 3:17:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 312 transitions.
May 31, 2017 3:17:41 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 16823 ms. Total solver calls (SAT/UNSAT): 1822(0/1822)
May 31, 2017 3:17:41 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 49047ms conformant to PINS in folder :/home/mcc/execution
May 31, 2017 3:17:45 PM 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, ([]((LTLAP1==true)))U([]([]((LTLAP2==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.003: completed loading model GAL
pins2lts-seq, 0.003: Initializing POR dependencies: labels 336, guards 312
pins2lts-seq, 0.033: LTL layer: formula: ([]((LTLAP1==true)))U([]([]((LTLAP2==true))))
pins2lts-seq, 0.033: Expression is: (([] (LTLAP1 == true )) U ([] ([] (LTLAP2 == true ))))
pins2lts-seq, 0.033: buchi has 6 states
pins2lts-seq, 0.033: state 0: non-accepting
pins2lts-seq, 0.033: -> 1, | !(LTLAP2 == true )
pins2lts-seq, 0.033: -> 2, | !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.033: -> 3, | !(LTLAP2 == true )
pins2lts-seq, 0.033: -> 0, | true
pins2lts-seq, 0.033: -> 4, | !(LTLAP1 == true )
pins2lts-seq, 0.033: -> 5, | true
pins2lts-seq, 0.033: state 1: accepting
pins2lts-seq, 0.033: -> 1, | !(LTLAP2 == true )
pins2lts-seq, 0.033: -> 2, | !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.033: -> 3, | !(LTLAP2 == true )
pins2lts-seq, 0.033: -> 0, | true
pins2lts-seq, 0.033: -> 4, | !(LTLAP1 == true )
pins2lts-seq, 0.033: -> 5, | true
pins2lts-seq, 0.033: state 2: accepting
pins2lts-seq, 0.033: -> 2, | true
pins2lts-seq, 0.033: state 3: non-accepting
pins2lts-seq, 0.033: -> 3, | true
pins2lts-seq, 0.033: -> 2, | !(LTLAP1 == true )
pins2lts-seq, 0.033: state 4: non-accepting
pins2lts-seq, 0.033: -> 4, | true
pins2lts-seq, 0.033: -> 2, | !(LTLAP2 == true )
pins2lts-seq, 0.033: state 5: non-accepting
pins2lts-seq, 0.033: -> 5, | true
pins2lts-seq, 0.033: -> 4, | !(LTLAP1 == true )
pins2lts-seq, 0.033: -> 3, | !(LTLAP2 == true )
pins2lts-seq, 0.033: -> 2, | !(LTLAP2 == true ) && !(LTLAP1 == true )
pins2lts-seq, 0.034: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.034: There are 337 state labels and 1 edge labels
pins2lts-seq, 0.034: State length is 34, there are 333 groups
pins2lts-seq, 0.034: Running scc search strategy
pins2lts-seq, 0.034: Using a tree for state storage
pins2lts-seq, 0.034: Visible groups: 13183713 / 333, labels: 2 / 337
pins2lts-seq, 0.034: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.036: accepting cycle found!
pins2lts-seq, 0.036: exiting now
May 31, 2017 3:21:30 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
May 31, 2017 3:21:30 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
May 31, 2017 3:21:30 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTSmin timed out on command CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, [](<>(((LTLAP3==true))U((LTLAP4==true))))], workingDir=/home/mcc/execution]
May 31, 2017 3:21:30 PM 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, --when, --ltl, <>(X(<>((LTLAP13==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: <>(X(<>((LTLAP13==true))))
pins2lts-seq, 0.003: Expression is: (<> (X (<> (LTLAP13 == true ))))
pins2lts-seq, 0.003: buchi has 2 states
pins2lts-seq, 0.003: state 0: accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP13 == true )
pins2lts-seq, 0.003: There are 337 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 34, there are 314 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.005: accepting cycle found!
pins2lts-seq, 0.005: exiting now
May 31, 2017 3:21:30 PM 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, (LTLAP14==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 336, guards 312
pins2lts-seq, 0.032: LTL layer: formula: (LTLAP14==true)
pins2lts-seq, 0.032: Expression is: (LTLAP14 == true )
pins2lts-seq, 0.032: buchi has 2 states
pins2lts-seq, 0.032: state 0: accepting
pins2lts-seq, 0.032: -> 1, | !(LTLAP14 == true )
pins2lts-seq, 0.032: state 1: accepting
pins2lts-seq, 0.032: -> 1, | true
pins2lts-seq, 0.032: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.033: There are 337 state labels and 1 edge labels
pins2lts-seq, 0.033: State length is 34, there are 314 groups
pins2lts-seq, 0.033: Running scc search strategy
pins2lts-seq, 0.033: Using a tree for state storage
pins2lts-seq, 0.033: Visible groups: 0 / 314, labels: 1 / 337
pins2lts-seq, 0.033: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.034: state space 1 levels, 1 states 0 transitions
May 31, 2017 3:21:30 PM 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, ((LTLAP15==true))U([](<>((LTLAP16==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 336, guards 312
pins2lts-seq, 0.032: LTL layer: formula: ((LTLAP15==true))U([](<>((LTLAP16==true))))
pins2lts-seq, 0.032: Expression is: ((LTLAP15 == true ) U ([] (<> (LTLAP16 == true ))))
pins2lts-seq, 0.032: buchi has 4 states
pins2lts-seq, 0.032: state 0: non-accepting
pins2lts-seq, 0.032: -> 1, | !(LTLAP16 == true )
pins2lts-seq, 0.032: -> 2, | !(LTLAP16 == true ) && !(LTLAP15 == true )
pins2lts-seq, 0.032: -> 0, | true
pins2lts-seq, 0.032: -> 3, | !(LTLAP15 == true )
pins2lts-seq, 0.032: state 1: accepting
pins2lts-seq, 0.032: -> 1, | !(LTLAP16 == true )
pins2lts-seq, 0.032: -> 2, | !(LTLAP16 == true ) && !(LTLAP15 == true )
pins2lts-seq, 0.032: state 2: accepting
pins2lts-seq, 0.032: -> 2, | !(LTLAP16 == true )
pins2lts-seq, 0.032: state 3: non-accepting
pins2lts-seq, 0.032: -> 3, | true
pins2lts-seq, 0.032: -> 2, | !(LTLAP16 == true )
pins2lts-seq, 0.033: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.033: There are 337 state labels and 1 edge labels
pins2lts-seq, 0.033: State length is 34, there are 321 groups
pins2lts-seq, 0.033: Running scc search strategy
pins2lts-seq, 0.033: Using a tree for state storage
pins2lts-seq, 0.033: Visible groups: 0 / 321, labels: 2 / 337
pins2lts-seq, 0.033: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.035: accepting cycle found!
pins2lts-seq, 0.035: exiting now
May 31, 2017 3:21:30 PM 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, --when, --ltl, (X([]((LTLAP17==true))))U((LTLAP18==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: (X([]((LTLAP17==true))))U((LTLAP18==true))
pins2lts-seq, 0.002: Expression is: ((X ([] (LTLAP17 == true ))) U (LTLAP18 == true ))
pins2lts-seq, 0.002: buchi has 3 states
pins2lts-seq, 0.002: state 0: accepting
pins2lts-seq, 0.002: -> 0, | !(LTLAP18 == true )
pins2lts-seq, 0.002: -> 1, | !(LTLAP18 == true )
pins2lts-seq, 0.002: state 1: non-accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: -> 2, | !(LTLAP17 == true )
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 2, | true
pins2lts-seq, 0.003: There are 337 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 34, there are 317 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.004: state space 1 levels, 1 states 0 transitions
May 31, 2017 3:21:30 PM 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, (((LTLAP19==true))U((LTLAP20==true)))U(((LTLAP21==true))U((LTLAP22==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 336, guards 312
pins2lts-seq, 0.032: LTL layer: formula: (((LTLAP19==true))U((LTLAP20==true)))U(((LTLAP21==true))U((LTLAP22==true)))
pins2lts-seq, 0.032: Expression is: (((LTLAP19 == true ) U (LTLAP20 == true )) U ((LTLAP21 == true ) U (LTLAP22 == true )))
pins2lts-seq, 0.032: buchi has 5 states
pins2lts-seq, 0.032: state 0: accepting
pins2lts-seq, 0.032: -> 1, | !(LTLAP22 == true ) && !(LTLAP21 == true ) && !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.032: -> 2, | !(LTLAP22 == true ) && !(LTLAP21 == true ) && !(LTLAP20 == true )
pins2lts-seq, 0.032: -> 0, | !(LTLAP22 == true )
pins2lts-seq, 0.032: -> 3, | !(LTLAP22 == true ) && !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.032: -> 4, | !(LTLAP22 == true ) && !(LTLAP20 == true )
pins2lts-seq, 0.032: state 1: accepting
pins2lts-seq, 0.032: -> 1, | true
pins2lts-seq, 0.032: state 2: accepting
pins2lts-seq, 0.032: -> 2, | !(LTLAP20 == true )
pins2lts-seq, 0.032: -> 1, | !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.032: state 3: accepting
pins2lts-seq, 0.032: -> 3, | !(LTLAP22 == true )
pins2lts-seq, 0.032: -> 1, | !(LTLAP22 == true ) && !(LTLAP21 == true )
pins2lts-seq, 0.032: state 4: accepting
pins2lts-seq, 0.032: -> 4, | !(LTLAP22 == true ) && !(LTLAP20 == true )
pins2lts-seq, 0.032: -> 3, | !(LTLAP22 == true ) && !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.032: -> 2, | !(LTLAP22 == true ) && !(LTLAP21 == true ) && !(LTLAP20 == true )
pins2lts-seq, 0.032: -> 1, | !(LTLAP22 == true ) && !(LTLAP21 == true ) && !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.033: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.033: There are 337 state labels and 1 edge labels
pins2lts-seq, 0.033: State length is 34, there are 326 groups
pins2lts-seq, 0.033: Running scc search strategy
pins2lts-seq, 0.033: Using a tree for state storage
pins2lts-seq, 0.033: Visible groups: 81 / 326, labels: 4 / 337
pins2lts-seq, 0.033: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.035: state space 1 levels, 1 states 0 transitions
May 31, 2017 3:21:30 PM 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, --when, --ltl, X((LTLAP23==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: X((LTLAP23==true))
pins2lts-seq, 0.002: Expression is: (X (LTLAP23 == true ))
pins2lts-seq, 0.002: buchi has 3 states
pins2lts-seq, 0.002: state 0: accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 2, | !(LTLAP23 == true )
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 2, | true
pins2lts-seq, 0.003: There are 337 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 34, there are 315 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now
May 31, 2017 3:21:30 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
May 31, 2017 3:21:30 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
May 31, 2017 3:21:30 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
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="DNAwalker-PT-12ringLLLarge"
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/DNAwalker-PT-12ringLLLarge.tgz
mv DNAwalker-PT-12ringLLLarge 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 DNAwalker-PT-12ringLLLarge, 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 r030-blw3-149440266500104"
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 ;