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)
......................
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is RobotManipulation-PT-00001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264500466
=====================================================================

--------------------
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-00001-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-00001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527812072501

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph8118399867302364791.txt, -o, /tmp/graph8118399867302364791.bin, -w, /tmp/graph8118399867302364791.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph8118399867302364791.bin, -l, -1, -v, -w, /tmp/graph8118399867302364791.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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 : !((G((F(G("((u0.p_i2>=1)&&(u0.initialized>=1))")))U(("((u0.p_rdy>=1)&&(i1.u1.access>=1))")U("(u0.p_rdy>=1)")))))
Formula 0 simplified : !G(FG"((u0.p_i2>=1)&&(u0.initialized>=1))" U ("((u0.p_rdy>=1)&&(i1.u1.access>=1))" U "(u0.p_rdy>=1)"))
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.039415,18236,1,0,837,557,231,1184,165,1325,1685
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((u0.p_rdy>=1)&&(i1.u1.access>=1))"))
Formula 1 simplified : !"((u0.p_rdy>=1)&&(i1.u1.access>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.04023,18236,1,0,851,558,234,1188,165,1327,1769
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((("((u3.r_active>=1)&&(u3.off>=1))")U("(u0.p_rdy>=1)"))U(G(F("((i1.u1.move>=1)&&(u3.r_active>=1))"))))))
Formula 2 simplified : !F(("((u3.r_active>=1)&&(u3.off>=1))" U "(u0.p_rdy>=1)") U GF"((i1.u1.move>=1)&&(u3.r_active>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.043719,18236,1,0,1082,566,255,1538,165,1366,2255
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F("(i1.u2.p_rel>=1)"))))
Formula 3 simplified : !GF"(i1.u2.p_rel>=1)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.046073,18236,1,0,1159,575,275,1670,166,1404,2377
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(G("(u3.r_moving>=1)")))U("((u3.r_active>=1)&&(u3.off>=1))")))
Formula 4 simplified : !(FG"(u3.r_moving>=1)" U "((u3.r_active>=1)&&(u3.off>=1))")
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.051281,18708,1,0,1360,587,302,1932,170,1488,2983
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(G("((u3.r_stopped>=1)&&(u0.initialize>=1))")))U((F("((u0.p_i2>=1)&&(u0.initialized>=1))"))U(G("((i1.u1.move>=1)&&(u3.r_active>=1))")))))
Formula 5 simplified : !(FG"((u3.r_stopped>=1)&&(u0.initialize>=1))" U (F"((u0.p_i2>=1)&&(u0.initialized>=1))" U G"((i1.u1.move>=1)&&(u3.r_active>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 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,0.056563,19716,1,0,1420,587,337,2002,172,1527,3225
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((("(u0.p_i1>=1)")U(G("((u0.p_i2>=1)&&(u0.initialized>=1))")))U((G("(u0.p_rdy>=1)"))U(F("((u3.r_stopped>=1)&&(u0.initialize>=1))")))))
Formula 6 simplified : !(("(u0.p_i1>=1)" U G"((u0.p_i2>=1)&&(u0.initialized>=1))") U (G"(u0.p_rdy>=1)" U F"((u3.r_stopped>=1)&&(u0.initialize>=1))"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.059667,19872,1,0,1423,587,349,2020,172,1544,3261
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(("((i1.u2.p_m>=1)&&(i1.u2.moved>=1))")U(G(X("((i1.u2.p_m>=1)&&(i1.u2.moved>=1))"))))))
Formula 7 simplified : !X("((i1.u2.p_m>=1)&&(i1.u2.moved>=1))" U GX"((i1.u2.p_m>=1)&&(i1.u2.moved>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.061827,19872,1,0,1445,589,371,2040,175,1551,3365
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(F((F("(u0.p_rdy>=1)"))U(G("(u3.r_moving>=1)"))))))
Formula 8 simplified : !F(F"(u0.p_rdy>=1)" U G"(u3.r_moving>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.068436,19872,1,0,2021,618,379,2743,175,1751,4344
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((X("(i1.u2.p_rel>=1)"))U(X("(u0.p_i1>=1)")))U((X("(u3.r_moving>=1)"))U(F("((u3.r_active>=1)&&(u3.off>=1))")))))
Formula 9 simplified : !((X"(i1.u2.p_rel>=1)" U X"(u0.p_i1>=1)") U (X"(u3.r_moving>=1)" U F"((u3.r_active>=1)&&(u3.off>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 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,0.070499,20064,1,0,2077,618,383,2830,175,1761,4529
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((G(("((u3.r_stopped>=1)&&(u0.initialize>=1))")U("((u0.p_rdy>=1)&&(i1.u1.access>=1))")))U("((i1.u1.move>=1)&&(u3.r_active>=1))")))
Formula 10 simplified : !(G("((u3.r_stopped>=1)&&(u0.initialize>=1))" U "((u0.p_rdy>=1)&&(i1.u1.access>=1))") U "((i1.u1.move>=1)&&(u3.r_active>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.073305,20316,1,0,2077,618,406,2830,175,1761,4540
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X("((u0.p_i2>=1)&&(u0.initialized>=1))"))U(G(F(X("(i1.u1.p_sc>=1)"))))))
Formula 11 simplified : !(X"((u0.p_i2>=1)&&(u0.initialized>=1))" U GFX"(i1.u1.p_sc>=1)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.077098,20316,1,0,2332,623,421,3149,175,1772,5049
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((F("((u0.p_rdy>=1)&&(i1.u1.access>=1))"))U(F(X("(u3.r_moving>=1)")))))
Formula 12 simplified : !(F"((u0.p_rdy>=1)&&(i1.u1.access>=1))" U FX"(u3.r_moving>=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.078173,20316,1,0,2371,623,432,3203,175,1775,5173
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((G(("(u3.r_moving>=1)")U("(i1.u2.p_rel>=1)")))U("((u3.r_stopped>=1)&&(u0.initialize>=1))")))
Formula 13 simplified : !(G("(u3.r_moving>=1)" U "(i1.u2.p_rel>=1)") U "((u3.r_stopped>=1)&&(u0.initialize>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.07964,20316,1,0,2371,623,453,3203,175,1775,5187
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(F(G(F(F("((i1.u2.p_m>=1)&&(i1.u2.moved>=1))")))))))
Formula 14 simplified : !FGF"((i1.u2.p_m>=1)&&(i1.u2.moved>=1))"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.082258,20316,1,0,2469,625,464,3326,175,1790,5388
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X((G(G("(u0.p_i1>=1)")))U(("(u0.p_rdy>=1)")U("((u0.p_rdy>=1)&&(i1.u1.access>=1))")))))
Formula 15 simplified : !X(G"(u0.p_i1>=1)" U ("(u0.p_rdy>=1)" U "((u0.p_rdy>=1)&&(i1.u1.access>=1))"))
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.088744,20552,1,0,2803,639,511,3664,181,1923,6302
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00001-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527812077101

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 45 ms
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 15 places.
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 11 transitions.
Jun 01, 2018 12:14:35 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
Begin: Fri Jun 1 00:14:35 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Fri Jun 1 00:14:35 2018
network size: 15 nodes, 44 links, 22 weight
quality increased from -0.0774793 to 0.366736
end computation: Fri Jun 1 00:14:35 2018
level 1:
start computation: Fri Jun 1 00:14:35 2018
network size: 4 nodes, 16 links, 22 weight
quality increased from 0.366736 to 0.391529
end computation: Fri Jun 1 00:14:35 2018
level 2:
start computation: Fri Jun 1 00:14:35 2018
network size: 3 nodes, 9 links, 22 weight
quality increased from 0.391529 to 0.391529
end computation: Fri Jun 1 00:14:35 2018
End: Fri Jun 1 00:14:35 2018
Total duration: 0 sec
0.391529
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 16 ms
Jun 01, 2018 12:14:35 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 01, 2018 12:14:35 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Jun 01, 2018 12:14:35 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 01, 2018 12:14:36 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 11 transitions.
Jun 01, 2018 12:14:36 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun tr10 ((step Int)) Bool (trsrc10 (select s step) (select s (+ step 1)))) with error
Jun 01, 2018 12:14:36 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun _next__ ((step Int)) Bool (or (tr0 step) (tr1 step) (tr2 step) (tr3 step) (tr4 step) (tr5 step) (tr6 step) (tr7 step) (tr8 step) (tr9 step) (tr10 step))) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Skipping mayMatrices nes/nds Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:59)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 01, 2018 12:14:36 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 116ms conformant to PINS in folder :/home/mcc/execution

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-00001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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-00001.tgz
mv RobotManipulation-PT-00001 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is RobotManipulation-PT-00001, 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 r213-smll-152732264500466"
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 '' LTLFireability.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 ;