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 168K
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K 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 19K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 13K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is HouseConstruction-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264200278
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527922766371

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/graph1277721083197101708.txt, -o, /tmp/graph1277721083197101708.bin, -w, /tmp/graph1277721083197101708.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/graph1277721083197101708.bin, -l, -1, -v, -w, /tmp/graph1277721083197101708.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 : !((((X("(i1.u2.p11>=1)"))U(F("(i2.u4.p5>=1)")))U(G(("((i2.u4.p9>=1)&&(i2.u3.p8>=1))")U("(i4.u7.p22>=1)")))))
Formula 0 simplified : !((X"(i1.u2.p11>=1)" U F"(i2.u4.p5>=1)") U G("((i2.u4.p9>=1)&&(i2.u3.p8>=1))" U "(i4.u7.p22>=1)"))
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t18, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 26 cols
33 unique states visited
33 strongly connected components in search stack
33 transitions explored
33 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.123516,21452,1,0,9576,336,392,9727,128,1320,15517
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((("(u0.p2>=1)")U("(u0.p2>=1)"))U(X("(i4.u5.p17>=1)")))))
Formula 1 simplified : !X("(u0.p2>=1)" U X"(i4.u5.p17>=1)")
Computing Next relation with stutter on 1 deadlock states
17 unique states visited
17 strongly connected components in search stack
17 transitions explored
17 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.137657,22228,1,0,11323,336,428,10825,129,1325,18655
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X(X(F(F("(i1.u2.p11>=1)")))))))
Formula 2 simplified : !GXXF"(i1.u2.p11>=1)"
Computing Next relation with stutter on 1 deadlock states
40 unique states visited
40 strongly connected components in search stack
41 transitions explored
40 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.171094,23264,1,0,13452,340,453,12723,129,1407,21605
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("((i3.u6.p21>=1)&&(i3.u8.p23>=1))"))
Formula 3 simplified : !"((i3.u6.p21>=1)&&(i3.u8.p23>=1))"
Computing Next relation with stutter on 1 deadlock states
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.171841,23264,1,0,13452,340,462,12723,129,1407,21611
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(X(G("(((i2.u3.p10>=1)&&(i2.u4.p13>=1))&&(i1.u1.p12>=1))"))))))
Formula 4 simplified : !GXXG"(((i2.u3.p10>=1)&&(i2.u4.p13>=1))&&(i1.u1.p12>=1))"
Computing Next relation with stutter on 1 deadlock states
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.173997,23264,1,0,13510,340,489,12804,129,1414,21836
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(("((i2.u4.p9>=1)&&(i2.u3.p8>=1))")U("(i4.u5.p14>=1)")))U(F(G(X("(u0.p3>=1)"))))))
Formula 5 simplified : !(X("((i2.u4.p9>=1)&&(i2.u3.p8>=1))" U "(i4.u5.p14>=1)") U FGX"(u0.p3>=1)")
Computing Next relation with stutter on 1 deadlock states
38 unique states visited
37 strongly connected components in search stack
39 transitions explored
38 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.192545,23868,1,0,14411,351,504,13780,129,1489,24141
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X((F("(u0.p3>=1)"))U(F("(i1.u1.p6>=1)"))))))
Formula 6 simplified : !XX(F"(u0.p3>=1)" U F"(i1.u1.p6>=1)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.193892,23868,1,0,14454,351,519,13825,129,1490,24352
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(F(F(G("((i3.u6.p21>=1)&&(i3.u8.p23>=1))")))))))
Formula 7 simplified : !GXFG"((i3.u6.p21>=1)&&(i3.u8.p23>=1))"
Computing Next relation with stutter on 1 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 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.19928,24372,1,0,14650,351,535,14145,129,1490,24951
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G(F(F(X("((i3.u6.p21>=1)&&(i3.u8.p23>=1))")))))))
Formula 8 simplified : !GFX"((i3.u6.p21>=1)&&(i3.u8.p23>=1))"
Computing Next relation with stutter on 1 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 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.20003,24372,1,0,14650,351,546,14145,129,1490,24959
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(X(F("((i4.u7.p20>=1)&&(i4.u7.p19>=1))"))))U(G("((i3.u6.p21>=1)&&(i3.u8.p23>=1))"))))
Formula 9 simplified : !(GXF"((i4.u7.p20>=1)&&(i4.u7.p19>=1))" U G"((i3.u6.p21>=1)&&(i3.u8.p23>=1))")
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
35 transitions explored
35 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.22217,24532,1,0,15426,351,546,15337,129,1490,26439
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((((F("(i1.u2.p7>=1)"))U(G("(i4.u5.p17>=1)")))U((X("(i3.u6.p18>=1)"))U("(i2.u4.p5>=1)"))))
Formula 10 simplified : !((F"(i1.u2.p7>=1)" U G"(i4.u5.p17>=1)") U (X"(i3.u6.p18>=1)" U "(i2.u4.p5>=1)"))
Computing Next relation with stutter on 1 deadlock states
15 unique states visited
10 strongly connected components in search stack
15 transitions explored
10 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.244016,25640,1,0,17365,353,624,16679,129,1494,29565
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F("(u0.p1>=1)"))U(X(F(F("((i4.u7.p20>=1)&&(i4.u7.p19>=1))"))))))
Formula 11 simplified : !(F"(u0.p1>=1)" U XF"((i4.u7.p20>=1)&&(i4.u7.p19>=1))")
Computing Next relation with stutter on 1 deadlock states
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,0.249415,25904,1,0,18029,353,647,17068,132,1494,30832
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(X(F("((i2.u4.p9>=1)&&(i2.u3.p8>=1))"))))U("(i2.u4.p5>=1)")))
Formula 12 simplified : !(XXF"((i2.u4.p9>=1)&&(i2.u3.p8>=1))" U "(i2.u4.p5>=1)")
Computing Next relation with stutter on 1 deadlock states
9 unique states visited
0 strongly connected components in search stack
9 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.255817,26432,1,0,18776,353,660,17542,132,1496,32599
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((i2.u4.p9>=1)&&(i2.u3.p8>=1))"))
Formula 13 simplified : !"((i2.u4.p9>=1)&&(i2.u3.p8>=1))"
Computing Next relation with stutter on 1 deadlock states
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.256217,26432,1,0,18776,353,660,17542,132,1496,32601
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(i4.u5.p17>=1)"))
Formula 14 simplified : !"(i4.u5.p17>=1)"
Computing Next relation with stutter on 1 deadlock states
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.256473,26432,1,0,18776,353,660,17542,132,1496,32603
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G("(i4.u5.p17>=1)")))
Formula 15 simplified : !G"(i4.u5.p17>=1)"
Computing Next relation with stutter on 1 deadlock states
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.256858,26432,1,0,18776,353,660,17542,132,1496,32610
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA HouseConstruction-PT-002-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 1527922771967

--------------------
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 02, 2018 6:59:29 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 02, 2018 6:59:29 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 40 ms
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 26 places.
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 18 transitions.
Jun 02, 2018 6:59:29 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 28 ms
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 11 ms
Begin: Sat Jun 2 06:59:29 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 06:59:29 2018
network size: 26 nodes, 62 links, 34 weight
quality increased from -0.0437332 to 0.556661
end computation: Sat Jun 2 06:59:29 2018
level 1:
start computation: Sat Jun 2 06:59:29 2018
network size: 10 nodes, 38 links, 34 weight
quality increased from 0.556661 to 0.607074
end computation: Sat Jun 2 06:59:29 2018
level 2:
start computation: Sat Jun 2 06:59:29 2018
network size: 6 nodes, 22 links, 34 weight
quality increased from 0.607074 to 0.607074
end computation: Sat Jun 2 06:59:29 2018
End: Sat Jun 2 06:59:29 2018
Total duration: 0 sec
0.607074
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 11 ms
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 6:59:29 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 02, 2018 6:59:29 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 18 transitions.
Jun 02, 2018 6:59:29 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 8 ms
Jun 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 26 variables to be positive in 176 ms
Jun 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 18 transitions.
Jun 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/18 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 18 transitions.
Jun 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 18 transitions.
Jun 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 208 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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 02, 2018 6:59:30 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1019ms 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="HouseConstruction-PT-002"
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/HouseConstruction-PT-002.tgz
mv HouseConstruction-PT-002 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 HouseConstruction-PT-002, 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-152732264200278"
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 ;