About the Execution of ITS-Tools for S_DNAwalker-PT-11ringRR
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1128.690 | 34349.00 | 71390.00 | 134.20 | FTFFFFFFTFFFFFFF | 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 S_DNAwalker-PT-11ringRR, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-blw3-149441614100096
=====================================================================
--------------------
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-11ringRR-LTLFireability-0
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-1
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-10
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-11
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-12
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-13
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-14
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-15
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-2
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-3
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-4
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-5
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-6
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-7
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-8
FORMULA_NAME DNAwalker-PT-11ringRR-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1496406976257
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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(F(("A12>=2")&&("A8>=1")))))
Formula 0 simplified : !F("A8>=1" & "A12>=2")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 260 rows 27 cols
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1033 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,10.3608,286400,1,0,835,1.22178e+06,530,265,2652,1.47768e+06,737
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F("B21>=1")))
Formula 1 simplified : !F"B21>=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,10.3613,286632,1,0,835,1.22178e+06,539,265,2653,1.47768e+06,741
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(F(F((("A13>=2")&&("A9>=1"))U("B20>=1"))))))
Formula 2 simplified : !F(("A9>=1" & "A13>=2") U "B20>=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,10.3618,286852,1,0,835,1.22178e+06,548,265,2654,1.47768e+06,745
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(X(G((("A2>=2")&&("A8>=1"))U(("A4>=2")&&("A7>=1")))))))
Formula 3 simplified : !XXG(("A2>=2" & "A8>=1") U ("A4>=2" & "A7>=1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
639 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,16.7539,422860,1,0,886,1.82711e+06,584,275,2731,2.07878e+06,881
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G((G(G(("A1>=2")&&("A5>=1"))))U((("A1>=2")&&("A21>=1"))U(("A19>=2")&&("A4>=1"))))))
Formula 4 simplified : !G(G("A1>=2" & "A5>=1") U (("A1>=2" & "A21>=1") U ("A4>=1" & "A19>=2")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
359 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,20.3553,518784,1,0,926,2.25363e+06,623,284,2764,2.54286e+06,982
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(X(("A12>=2")&&("A15>=1"))))U(F(("A14>=2")&&("A17>=1")))))
Formula 5 simplified : !(FX("A12>=2" & "A15>=1") U F("A14>=2" & "A17>=1"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
306 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,23.406,585596,1,0,1025,2.57474e+06,637,302,2769,2.82267e+06,1202
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(F(G(G(G(("A13>=2")&&("A15>=1"))))))))
Formula 6 simplified : !FG("A13>=2" & "A15>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
262 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,26.0243,653508,1,0,1210,2.87824e+06,657,362,2776,3.27656e+06,1652
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((X(X(X(("A9>=2")&&("A6>=1")))))U((X(("A19>=2")&&("A18>=1")))U(G(("A11>=2")&&("A10>=1"))))))
Formula 7 simplified : !(XXX("A6>=1" & "A9>=2") U (X("A18>=1" & "A19>=2") U G("A10>=1" & "A11>=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]
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
505 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,31.09,746152,1,0,1253,3.23284e+06,692,368,2799,3.74227e+06,1785
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(F(("A19>=2")&&("A1>=1")))))
Formula 8 simplified : !XF("A1>=1" & "A19>=2")
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-11ringRR-LTLFireability-8 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-11ringRR-LTLFireability-9 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-11ringRR-LTLFireability-10 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
67 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,31.767,763220,1,0,1284,3.30249e+06,704,387,2803,3.81184e+06,1951
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DNAwalker-PT-11ringRR-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(X(G((("A1>=2")&&("A12>=1"))U(("A13>=2")&&("A4>=1")))))))
Formula 9 simplified : !FXG(("A1>=2" & "A12>=1") U ("A4>=1" & "A13>=2"))
Exit code :1
FORMULA DNAwalker-PT-11ringRR-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-11ringRR-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-11ringRR-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-11ringRR-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA DNAwalker-PT-11ringRR-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.
BK_STOP 1496407010606
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 12:36:17 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 12:36:17 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 81 ms
Jun 02, 2017 12:36:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 27 places.
Jun 02, 2017 12:36:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 260 transitions.
Jun 02, 2017 12:36:18 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 76 ms
Jun 02, 2017 12:36:18 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
Jun 02, 2017 12:36:18 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2017 12:36:18 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 11 ms
Jun 02, 2017 12:36:18 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 27 variables to be positive in 89 ms
Jun 02, 2017 12:36:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 260 transitions.
Jun 02, 2017 12:36:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/260 took 4 ms. Total solver calls (SAT/UNSAT): 12(0/12)
Jun 02, 2017 12:36:19 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :47/260 took 1012 ms. Total solver calls (SAT/UNSAT): 2158(1123/1035)
Jun 02, 2017 12:36:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :94/260 took 2029 ms. Total solver calls (SAT/UNSAT): 4476(2346/2130)
Jun 02, 2017 12:36:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :141/260 took 3029 ms. Total solver calls (SAT/UNSAT): 6771(3543/3228)
Jun 02, 2017 12:36:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :192/260 took 4034 ms. Total solver calls (SAT/UNSAT): 9103(4778/4325)
Jun 02, 2017 12:36:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :235/260 took 5052 ms. Total solver calls (SAT/UNSAT): 11466(6030/5436)
Jun 02, 2017 12:36:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 5381 ms. Total solver calls (SAT/UNSAT): 12216(6440/5776)
Jun 02, 2017 12:36:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 260 transitions.
Jun 02, 2017 12:36:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :58/260 took 1013 ms. Total solver calls (SAT/UNSAT): 2654(657/1997)
Jun 02, 2017 12:36:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :112/260 took 2013 ms. Total solver calls (SAT/UNSAT): 5411(1427/3984)
Jun 02, 2017 12:36:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :173/260 took 3014 ms. Total solver calls (SAT/UNSAT): 8247(2108/6139)
Jun 02, 2017 12:36:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :227/260 took 4034 ms. Total solver calls (SAT/UNSAT): 11010(2846/8164)
Jun 02, 2017 12:36:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4489 ms. Total solver calls (SAT/UNSAT): 12216(3212/9004)
Jun 02, 2017 12:36:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 260 transitions.
Jun 02, 2017 12:36:29 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(13/260) took 980 ms. Total solver calls (SAT/UNSAT): 3549(3549/0)
Jun 02, 2017 12:36:30 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(29/260) took 2053 ms. Total solver calls (SAT/UNSAT): 7365(7365/0)
Jun 02, 2017 12:36:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(46/260) took 3083 ms. Total solver calls (SAT/UNSAT): 11139(11139/0)
Jun 02, 2017 12:36:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(64/260) took 4089 ms. Total solver calls (SAT/UNSAT): 14820(14820/0)
Jun 02, 2017 12:36:33 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(84/260) took 5103 ms. Total solver calls (SAT/UNSAT): 18530(18530/0)
Jun 02, 2017 12:36:34 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(107/260) took 6142 ms. Total solver calls (SAT/UNSAT): 22302(22302/0)
Jun 02, 2017 12:36:35 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(133/260) took 7144 ms. Total solver calls (SAT/UNSAT): 25929(25929/0)
Jun 02, 2017 12:36:36 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(167/260) took 8164 ms. Total solver calls (SAT/UNSAT): 29652(29652/0)
Jun 02, 2017 12:36:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(225/260) took 9173 ms. Total solver calls (SAT/UNSAT): 33335(33335/0)
Jun 02, 2017 12:36:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 9337 ms. Total solver calls (SAT/UNSAT): 33930(33930/0)
Jun 02, 2017 12:36:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 260 transitions.
Jun 02, 2017 12:36:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 9082 ms. Total solver calls (SAT/UNSAT): 1563(0/1563)
Jun 02, 2017 12:36:47 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 28800ms conformant to PINS in folder :/home/mcc/execution
Jun 02, 2017 12:36:50 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(<>((LTLAP15==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.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.003: completed loading model GAL
pins2lts-seq, 0.003: LTL layer: formula: X(<>((LTLAP15==true)))
pins2lts-seq, 0.003: Expression is: (X (<> (LTLAP15 == 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, | !(LTLAP15 == true )
pins2lts-seq, 0.003: There are 289 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 28, there are 262 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
Jun 02, 2017 12:36:50 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([](((LTLAP16==true))U((LTLAP17==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.001: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: <>(X([](((LTLAP16==true))U((LTLAP17==true)))))
pins2lts-seq, 0.002: Expression is: (<> (X ([] ((LTLAP16 == true ) U (LTLAP17 == true )))))
pins2lts-seq, 0.002: buchi has 3 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP17 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP17 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP17 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.002: -> 0, | true
pins2lts-seq, 0.002: There are 289 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 28, there are 268 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now
Jun 02, 2017 12:36:50 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, (([]((LTLAP18==true)))U(<>((LTLAP19==true))))U([]([](X((LTLAP20==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.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: (([]((LTLAP18==true)))U(<>((LTLAP19==true))))U([]([](X((LTLAP20==true)))))
pins2lts-seq, 0.002: Expression is: ((([] (LTLAP18 == true )) U (<> (LTLAP19 == true ))) U ([] ([] (X (LTLAP20 == true )))))
pins2lts-seq, 0.002: buchi has 8 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: -> 4, | !(LTLAP19 == true )
pins2lts-seq, 0.002: state 1: non-accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: -> 4, | !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP20 == true )
pins2lts-seq, 0.002: -> 7, | true
pins2lts-seq, 0.002: -> 6, | !(LTLAP19 == true )
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: -> 4, | !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP20 == true )
pins2lts-seq, 0.002: -> 3, | true
pins2lts-seq, 0.002: -> 6, | !(LTLAP19 == true )
pins2lts-seq, 0.002: state 3: non-accepting
pins2lts-seq, 0.002: -> 3, | true
pins2lts-seq, 0.002: -> 6, | !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP20 == true )
pins2lts-seq, 0.002: -> 4, | !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.002: state 4: non-accepting
pins2lts-seq, 0.002: -> 4, | !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 5, | !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 6, | !(LTLAP19 == true )
pins2lts-seq, 0.002: state 5: accepting
pins2lts-seq, 0.002: -> 5, | !(LTLAP19 == true )
pins2lts-seq, 0.002: state 6: non-accepting
pins2lts-seq, 0.002: -> 6, | !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 5, | !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.002: state 7: accepting
pins2lts-seq, 0.002: -> 3, | true
pins2lts-seq, 0.002: -> 6, | !(LTLAP19 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP20 == true )
pins2lts-seq, 0.002: -> 4, | !(LTLAP20 == true ) && !(LTLAP19 == true )
pins2lts-seq, 0.002: There are 289 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 28, there are 286 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now
Jun 02, 2017 12:36:50 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((LTLAP21==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.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: <>(X((LTLAP21==true)))
pins2lts-seq, 0.002: Expression is: (<> (X (LTLAP21 == true )))
pins2lts-seq, 0.002: buchi has 2 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: -> 1, | !(LTLAP21 == true )
pins2lts-seq, 0.002: There are 289 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 28, there are 262 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.003: accepting cycle found!
pins2lts-seq, 0.003: exiting now
Jun 02, 2017 12:36:50 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((((LTLAP22==true))U((LTLAP5==true)))U([](<>((LTLAP11==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((((LTLAP22==true))U((LTLAP5==true)))U([](<>((LTLAP11==true)))))
pins2lts-seq, 0.002: Expression is: (X (((LTLAP22 == true ) U (LTLAP5 == true )) U ([] (<> (LTLAP11 == true )))))
pins2lts-seq, 0.002: buchi has 7 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: state 1: non-accepting
pins2lts-seq, 0.002: -> 2, | !(LTLAP11 == true )
pins2lts-seq, 0.002: -> 3, | !(LTLAP11 == true ) && !(LTLAP5 == true ) && !(LTLAP22 == true )
pins2lts-seq, 0.002: -> 4, | !(LTLAP11 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: -> 5, | !(LTLAP5 == true ) && !(LTLAP22 == true )
pins2lts-seq, 0.002: -> 6, | !(LTLAP5 == true )
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 2, | !(LTLAP11 == true )
pins2lts-seq, 0.002: -> 3, | !(LTLAP11 == true ) && !(LTLAP5 == true ) && !(LTLAP22 == true )
pins2lts-seq, 0.002: -> 4, | !(LTLAP11 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.002: state 3: accepting
pins2lts-seq, 0.002: -> 3, | !(LTLAP11 == true )
pins2lts-seq, 0.002: state 4: accepting
pins2lts-seq, 0.002: -> 4, | !(LTLAP11 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.002: -> 3, | !(LTLAP11 == true ) && !(LTLAP5 == true ) && !(LTLAP22 == true )
pins2lts-seq, 0.002: state 5: non-accepting
pins2lts-seq, 0.002: -> 5, | true
pins2lts-seq, 0.002: -> 3, | !(LTLAP11 == true )
pins2lts-seq, 0.002: state 6: non-accepting
pins2lts-seq, 0.002: -> 6, | !(LTLAP5 == true )
pins2lts-seq, 0.002: -> 5, | !(LTLAP5 == true ) && !(LTLAP22 == true )
pins2lts-seq, 0.002: -> 4, | !(LTLAP11 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.002: -> 3, | !(LTLAP11 == true ) && !(LTLAP5 == true ) && !(LTLAP22 == true )
pins2lts-seq, 0.002: There are 289 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 28, there are 279 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now
Jun 02, 2017 12:36:50 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))U((LTLAP24==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))U((LTLAP24==true)))))
pins2lts-seq, 0.002: Expression is: ([] (X ([] ((LTLAP23 == true ) U (LTLAP24 == true )))))
pins2lts-seq, 0.002: buchi has 5 states
pins2lts-seq, 0.002: state 0: non-accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: state 1: non-accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: -> 2, | !(LTLAP24 == true )
pins2lts-seq, 0.002: -> 3, | !(LTLAP24 == true ) && !(LTLAP23 == true )
pins2lts-seq, 0.002: -> 4, | true
pins2lts-seq, 0.002: state 2: accepting
pins2lts-seq, 0.002: -> 2, | !(LTLAP24 == true )
pins2lts-seq, 0.002: -> 3, | !(LTLAP24 == true ) && !(LTLAP23 == true )
pins2lts-seq, 0.002: state 3: accepting
pins2lts-seq, 0.002: -> 3, | true
pins2lts-seq, 0.002: state 4: non-accepting
pins2lts-seq, 0.002: -> 4, | true
pins2lts-seq, 0.002: -> 3, | !(LTLAP24 == true ) && !(LTLAP23 == true )
pins2lts-seq, 0.002: -> 2, | !(LTLAP24 == true )
pins2lts-seq, 0.002: There are 289 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 28, there are 271 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now
Jun 02, 2017 12:36:50 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, ((LTLAP25==true))U([]([]([]((LTLAP26==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 288, guards 260
pins2lts-seq, 0.021: LTL layer: formula: ((LTLAP25==true))U([]([]([]((LTLAP26==true)))))
pins2lts-seq, 0.021: Expression is: ((LTLAP25 == true ) U ([] ([] ([] (LTLAP26 == true )))))
pins2lts-seq, 0.021: buchi has 4 states
pins2lts-seq, 0.021: state 0: non-accepting
pins2lts-seq, 0.021: -> 1, | !(LTLAP26 == true )
pins2lts-seq, 0.021: -> 2, | !(LTLAP26 == true ) && !(LTLAP25 == true )
pins2lts-seq, 0.021: -> 0, | true
pins2lts-seq, 0.021: -> 3, | !(LTLAP25 == true )
pins2lts-seq, 0.021: state 1: accepting
pins2lts-seq, 0.021: -> 1, | !(LTLAP26 == true )
pins2lts-seq, 0.021: -> 2, | !(LTLAP26 == true ) && !(LTLAP25 == true )
pins2lts-seq, 0.021: -> 0, | true
pins2lts-seq, 0.021: -> 3, | !(LTLAP25 == true )
pins2lts-seq, 0.021: state 2: accepting
pins2lts-seq, 0.021: -> 2, | true
pins2lts-seq, 0.021: state 3: non-accepting
pins2lts-seq, 0.021: -> 3, | true
pins2lts-seq, 0.021: -> 2, | !(LTLAP26 == true )
pins2lts-seq, 0.021: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.022: There are 289 state labels and 1 edge labels
pins2lts-seq, 0.022: State length is 28, there are 271 groups
pins2lts-seq, 0.022: Running scc search strategy
pins2lts-seq, 0.022: Using a tree for state storage
pins2lts-seq, 0.022: Visible groups: 0 / 271, labels: 2 / 289
pins2lts-seq, 0.022: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.024: accepting cycle found!
pins2lts-seq, 0.024: exiting now
Jun 02, 2017 12:36:50 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, (LTLAP27==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 288, guards 260
pins2lts-seq, 0.022: LTL layer: formula: (LTLAP27==true)
pins2lts-seq, 0.022: Expression is: (LTLAP27 == true )
pins2lts-seq, 0.022: buchi has 2 states
pins2lts-seq, 0.022: state 0: accepting
pins2lts-seq, 0.022: -> 1, | !(LTLAP27 == true )
pins2lts-seq, 0.022: state 1: accepting
pins2lts-seq, 0.022: -> 1, | true
pins2lts-seq, 0.022: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.023: There are 289 state labels and 1 edge labels
pins2lts-seq, 0.023: State length is 28, there are 262 groups
pins2lts-seq, 0.023: Running scc search strategy
pins2lts-seq, 0.023: Using a tree for state storage
pins2lts-seq, 0.023: Visible groups: 0 / 262, labels: 1 / 289
pins2lts-seq, 0.023: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.024: accepting cycle found!
pins2lts-seq, 0.024: exiting now
Jun 02, 2017 12:36:50 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 12:36:50 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 12:36:50 PM 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="S_DNAwalker-PT-11ringRR"
export BK_EXAMINATION="LTLFireability"
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_DNAwalker-PT-11ringRR.tgz
mv S_DNAwalker-PT-11ringRR 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_DNAwalker-PT-11ringRR, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r110-blw3-149441614100096"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 ;