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 RobotManipulation-PT-00010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-149581174400221
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496299004971


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((G("off<=initialized"))U(X("off>=1")))))
Formula 0 simplified : !F(G"off<=initialized" U X"off>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 11 rows 15 cols
invariant : 1'r_stopped + 1'r_active + 1'r_moving= 20
invariant : -1'initialize + 1'move + 1'moved + 1'off + -1'r_active + 1'p_rdy + 1'p_sc + 1'p_rel + 1'p_i2= 0
invariant : 1'initialize + -1'off + -1'r_stopped + 1'p_i1= 1
invariant : 1'move + 1'moved + -1'r_stopped + -1'r_active + 1'p_sc + 1'p_rel + 1'access= 0
invariant : -1'move + -1'moved + 1'r_stopped + 1'r_active + 1'p_m= 20
invariant : 1'move + 1'moved + 1'off + -1'r_active + 1'p_rdy + 1'p_sc + 1'p_rel + 1'initialized= 0
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 RobotManipulation-PT-00010-LTLCardinality-0 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :255
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1096 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.9891,216588,1,0,565,1.13062e+06,20,161,615,1.25199e+06,1021
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(("r_moving>=2")U("initialize<=moved")))))
Formula 1 simplified : !FG("r_moving>=2" U "initialize<=moved")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
570 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.6891,305512,1,0,572,1.55987e+06,37,164,683,1.78757e+06,1054
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F("p_m>=1")))
Formula 2 simplified : !F"p_m>=1"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
46 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,17.1578,315748,1,0,769,1.61415e+06,46,264,684,1.86578e+06,1566
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F((F("access>=3"))U(X("r_moving<=p_i1")))))
Formula 3 simplified : !F(F"access>=3" U X"r_moving<=p_i1")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,17.1585,315848,1,0,769,1.61415e+06,55,264,687,1.86578e+06,1570
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("initialized>=3"))
Formula 4 simplified : !"initialized>=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,17.1684,316048,1,0,769,1.61451e+06,60,264,689,1.86653e+06,1579
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F((X("p_m>=2"))U(F("access<=move")))))
Formula 5 simplified : !F(X"p_m>=2" U F"access<=move")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1262 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,29.7863,514928,1,0,1025,2.66524e+06,69,414,713,3.17735e+06,2349
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X("p_i1>=3")))
Formula 6 simplified : !X"p_i1>=3"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.7868,515048,1,0,1025,2.66524e+06,72,414,715,3.17735e+06,2351
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("off<=initialized"))
Formula 7 simplified : !"off<=initialized"
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,29.7872,515096,1,0,1025,2.66524e+06,75,414,718,3.17735e+06,2353
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(F(("p_rel<=p_rdy")U("p_rel<=access")))))
Formula 8 simplified : !GF("p_rel<=p_rdy" U "p_rel<=access")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
33 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,30.1275,520532,1,0,1145,2.69815e+06,84,415,760,3.20286e+06,2663
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X((G("r_moving>=1"))U(G("access>=2")))))
Formula 9 simplified : !X(G"r_moving>=1" U G"access>=2")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
696 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,37.0842,598776,1,0,1334,3.09304e+06,106,521,770,3.60502e+06,3319
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(G(F(X("move<=r_stopped"))))))
Formula 10 simplified : !GFX"move<=r_stopped"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,37.1297,599696,1,0,1340,3.09835e+06,115,522,813,3.61107e+06,3342
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G("access<=initialized")))
Formula 11 simplified : !G"access<=initialized"
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,37.1309,599764,1,0,1340,3.09835e+06,121,522,817,3.61107e+06,3347
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(G(G(X("initialized>=1"))))))
Formula 12 simplified : !GX"initialized>=1"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,37.1316,600052,1,0,1340,3.09835e+06,127,522,818,3.61107e+06,3352
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(F("moved<=r_moving"))))
Formula 13 simplified : !F"moved<=r_moving"
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,37.1322,600052,1,0,1340,3.09835e+06,136,522,822,3.61107e+06,3356
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(F(X("access<=p_sc")))))
Formula 14 simplified : !FX"access<=p_sc"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
747 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,44.6044,699084,1,0,1568,3.64844e+06,145,635,835,4.19007e+06,4022
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(F(F(G("initialized<=r_moving"))))))
Formula 15 simplified : !GFG"initialized<=r_moving"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
13899 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,183.589,2214204,1,0,2081,1.04851e+07,17,807,541,1.52705e+07,398
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00010-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496299193409

--------------------
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 6:36:46 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 6:36:46 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 31 ms
Jun 01, 2017 6:36:46 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 15 places.
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 11 transitions.
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 34 ms
Jun 01, 2017 6:36:47 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 8 ms
Jun 01, 2017 6:36:47 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 13 ms
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 15 variables to be positive in 43 ms
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 11 transitions.
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/11 took 3 ms. Total solver calls (SAT/UNSAT): 3(1/2)
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 35(13/22)
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 11 transitions.
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 35(14/21)
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 11 transitions.
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 47 ms. Total solver calls (SAT/UNSAT): 66(66/0)
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 11 transitions.
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 105 ms. Total solver calls (SAT/UNSAT): 21(0/21)
Jun 01, 2017 6:36:47 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 449ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 6:36:48 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, <>(([]((LTLAP0==true)))U(X((LTLAP1==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.002: completed loading model GAL
pins2lts-seq, 0.002: LTL layer: formula: <>(([]((LTLAP0==true)))U(X((LTLAP1==true))))
pins2lts-seq, 0.002: Expression is: (<> (([] (LTLAP0 == true )) U (X (LTLAP1 == 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, | !(LTLAP1 == true )
pins2lts-seq, 0.002: There are 33 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 16, there are 13 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 01, 2017 6:36:48 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>([](((LTLAP2==true))U((LTLAP3==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.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 32, guards 11
pins2lts-seq, 0.000: LTL layer: formula: <>([](((LTLAP2==true))U((LTLAP3==true))))
pins2lts-seq, 0.000: Expression is: (<> ([] ((LTLAP2 == true ) U (LTLAP3 == true ))))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.000: There are 33 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 16, there are 19 groups
pins2lts-seq, 0.000: Running scc search strategy
pins2lts-seq, 0.000: Using a tree for state storage
pins2lts-seq, 0.000: Visible groups: 145 / 19, labels: 2 / 33
pins2lts-seq, 0.000: POR cycle proviso: stack (ltl)
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 2.1
Stack trace:
0: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(HREprintStack+0x18) [0x4311a8]
1: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x431226]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0xf890) [0x7f493a2aa890]
3: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x44bed8]
4: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(qsortr+0x20b) [0x45916b]
5: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4505fb]
6: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4468b2]
7: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41cb25]
8: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c33a]
9: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c2e4]
10: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(main+0x81a) [0x41b47a]
11: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xf5) [0x7f4939c10b45]
12: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c13d]

LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>([](((LTLAP2==true))U((LTLAP3==true))))], workingDir=/home/mcc/execution]
Status WARNING: fr.lip6.move.gal code=255 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.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 32, guards 11
pins2lts-seq, 0.000: LTL layer: formula: <>([](((LTLAP2==true))U((LTLAP3==true))))
pins2lts-seq, 0.000: Expression is: (<> ([] ((LTLAP2 == true ) U (LTLAP3 == true ))))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.000: There are 33 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 16, there are 19 groups
pins2lts-seq, 0.000: Running scc search strategy
pins2lts-seq, 0.000: Using a tree for state storage
pins2lts-seq, 0.000: Visible groups: 145 / 19, labels: 2 / 33
pins2lts-seq, 0.000: POR cycle proviso: stack (ltl)
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 2.1
Stack trace:
0: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(HREprintStack+0x18) [0x4311a8]
1: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x431226]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0xf890) [0x7f493a2aa890]
3: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x44bed8]
4: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(qsortr+0x20b) [0x45916b]
5: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4505fb]
6: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4468b2]
7: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41cb25]
8: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c33a]
9: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c2e4]
10: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(main+0x81a) [0x41b47a]
11: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xf5) [0x7f4939c10b45]
12: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c13d]
null
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>([](((LTLAP2==true))U((LTLAP3==true))))], workingDir=/home/mcc/execution]
Status WARNING: fr.lip6.move.gal code=255 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.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 32, guards 11
pins2lts-seq, 0.000: LTL layer: formula: <>([](((LTLAP2==true))U((LTLAP3==true))))
pins2lts-seq, 0.000: Expression is: (<> ([] ((LTLAP2 == true ) U (LTLAP3 == true ))))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP3 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP3 == true ) && !(LTLAP2 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.000: There are 33 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 16, there are 19 groups
pins2lts-seq, 0.000: Running scc search strategy
pins2lts-seq, 0.000: Using a tree for state storage
pins2lts-seq, 0.000: Visible groups: 145 / 19, labels: 2 / 33
pins2lts-seq, 0.000: POR cycle proviso: stack (ltl)
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 2.1
Stack trace:
0: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(HREprintStack+0x18) [0x4311a8]
1: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x431226]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0xf890) [0x7f493a2aa890]
3: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x44bed8]
4: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(qsortr+0x20b) [0x45916b]
5: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4505fb]
6: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4468b2]
7: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41cb25]
8: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c33a]
9: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c2e4]
10: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(main+0x81a) [0x41b47a]
11: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xf5) [0x7f4939c10b45]
12: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c13d]
null
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:130)
at java.lang.Thread.run(Thread.java:748)
Jun 01, 2017 6:39:53 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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="RobotManipulation-PT-00010"
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/RobotManipulation-PT-00010.tgz
mv RobotManipulation-PT-00010 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 RobotManipulation-PT-00010, 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 r210-smll-149581174400221"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;