About the Execution of ITS-Tools.L for RwMutex-PT-r0010w0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15747.390 | 4553.00 | 9300.00 | 282.30 | FTFFTTFFFTFFFFFF | 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)
....................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is RwMutex-PT-r0010w0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264500492
=====================================================================
--------------------
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 RwMutex-PT-r0010w0010-LTLFireability-00
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-01
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-02
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-03
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-04
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-05
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-06
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-07
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-08
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-09
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-10
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-11
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-12
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-13
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-14
FORMULA_NAME RwMutex-PT-r0010w0010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1527826522435
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/graph3936231980601557496.txt, -o, /tmp/graph3936231980601557496.bin, -w, /tmp/graph3936231980601557496.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/graph3936231980601557496.bin, -l, -1, -v, -w, /tmp/graph3936231980601557496.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(F(G(F(F("(((((((((((i6.u17.p19>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))")))))))
Formula 0 simplified : !XFGF"(((((((((((i6.u17.p19>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))"
built 1 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.063885,17424,1,0,377,39,939,239,75,45,1635
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(("(i0.u2.p43>=1)")U("(((((((((((i2.u3.p15>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))"))))
Formula 1 simplified : !F("(i0.u2.p43>=1)" U "(((((((((((i2.u3.p15>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=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.066243,17424,1,0,377,39,978,239,75,45,1675
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(G(("((i8.u11.p11>=1)&&(i8.u11.p41>=1))")U("(i6.u9.p26>=1)"))))))
Formula 2 simplified : !GFG("((i8.u11.p11>=1)&&(i8.u11.p41>=1))" U "(i6.u9.p26>=1)")
1 unique states visited
1 strongly connected components in search stack
1 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.070129,18048,1,0,427,39,1017,273,81,45,2004
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(F(F(F(X("((i1.u7.p3>=1)&&(i1.u7.p33>=1))")))))))
Formula 3 simplified : !FX"((i1.u7.p3>=1)&&(i1.u7.p33>=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.072871,18048,1,0,501,39,1053,364,81,45,2368
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((i0.u0.p10>=1)&&(i0.u0.p40>=1))"))
Formula 4 simplified : !"((i0.u0.p10>=1)&&(i0.u0.p40>=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.07338,18048,1,0,501,39,1058,364,81,45,2379
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("((i5.u8.p35>=1)&&(i5.u8.p5>=1))"))
Formula 5 simplified : !"((i5.u8.p35>=1)&&(i5.u8.p5>=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.073886,18048,1,0,501,39,1067,364,83,45,2385
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(G("((i4.u12.p34>=1)&&(i4.u12.p4>=1))")))))
Formula 6 simplified : !GXG"((i4.u12.p34>=1)&&(i4.u12.p4>=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,0.076841,18048,1,0,560,39,1095,411,83,45,2712
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(G(G("(i1.u7.p23>=1)")))))
Formula 7 simplified : !G"(i1.u7.p23>=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.077746,18048,1,0,560,39,1108,411,83,45,2739
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G(X("(((((((((((i8.u13.p14>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))")))))
Formula 8 simplified : !FGX"(((((((((((i8.u13.p14>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))"
2 unique states visited
1 strongly connected components in search stack
3 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.080792,18048,1,0,560,39,1137,412,83,45,2758
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(((((((((((i0.u2.p13>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))"))
Formula 9 simplified : !"(((((((((((i0.u2.p13>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=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.082298,18048,1,0,560,39,1169,412,83,45,2782
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((((X("(((((((((((i3.u4.p20>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))"))U(X("(((((((((((i3.u4.p20>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))")))U(G(F(G("(((((((((((i3.u4.p20>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))"))))))
Formula 10 simplified : !(X"(((((((((((i3.u4.p20>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))" U GFG"(((((((((((i3.u4.p20>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=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.092735,18208,1,0,1128,39,1228,912,83,45,4206
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("(i5.u8.p25>=1)")U(F("(i8.u11.p31>=1)"))))
Formula 11 simplified : !("(i5.u8.p25>=1)" U F"(i8.u11.p31>=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.094165,18208,1,0,1141,39,1245,935,83,45,4275
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G((G("(i7.u14.p46>=1)"))U(("(i0.u2.p43>=1)")U("(i5.u15.p47>=1)")))))
Formula 12 simplified : !G(G"(i7.u14.p46>=1)" U ("(i0.u2.p43>=1)" U "(i5.u15.p47>=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.099393,19172,1,0,1141,39,1297,935,83,45,4334
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((G("(((((((((((i3.u4.p20>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))"))U(F("(i8.u13.p44>=1)"))))
Formula 13 simplified : !(G"(((((((((((i3.u4.p20>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))" U F"(i8.u13.p44>=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.100594,19172,1,0,1147,39,1311,944,83,45,4393
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X((("(i9.u16.p48>=1)")U("(((((((((((i8.u13.p14>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))"))U(X(F("(i4.u12.p24>=1)"))))))
Formula 14 simplified : !X(("(i9.u16.p48>=1)" U "(((((((((((i8.u13.p14>=1)&&(i2.u6.p32>=1))&&(i1.u7.p33>=1))&&(i4.u12.p34>=1))&&(i5.u8.p35>=1))&&(i6.u9.p36>=1))&&(i7.u18.p37>=1))&&(i9.u10.p38>=1))&&(i3.u19.p39>=1))&&(i0.u0.p40>=1))&&(i8.u11.p41>=1))") U XF"(i4.u12.p24>=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,0.102991,19172,1,0,1257,39,1325,1071,83,45,4722
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(X("((i7.u18.p37>=1)&&(i7.u18.p7>=1))"))))
Formula 15 simplified : !FX"((i7.u18.p37>=1)&&(i7.u18.p7>=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.104881,19172,1,0,1285,39,1346,1106,83,45,4896
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w0010-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 1527826526988
--------------------
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 4:15:25 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 4:15:25 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 49 ms
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 transitions.
Jun 01, 2018 4:15:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 11 ms
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 27 ms
Begin: Fri Jun 1 04:15:25 2018
Computation of communities with the Newman-Girvan Modularity quality function
level 0:
start computation: Fri Jun 1 04:15:25 2018
network size: 50 nodes, 260 links, 80 weight
quality increased from -0.0265238 to 0.485124
end computation: Fri Jun 1 04:15:25 2018
level 1:
start computation: Fri Jun 1 04:15:25 2018
network size: 20 nodes, 220 links, 80 weight
quality increased from 0.485124 to 0.490909
end computation: Fri Jun 1 04:15:25 2018
level 2:
start computation: Fri Jun 1 04:15:25 2018
network size: 10 nodes, 100 links, 80 weight
quality increased from 0.490909 to 0.490909
end computation: Fri Jun 1 04:15:25 2018
End: Fri Jun 1 04:15:25 2018
Total duration: 0 sec
0.490909
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 22 ms
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 01, 2018 4:15:25 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 180 redundant transitions.
Jun 01, 2018 4:15:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
Jun 01, 2018 4:15:25 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 01, 2018 4:15:26 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 40 transitions.
Jun 01, 2018 4:15:26 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s () (Array Int (Array Int Int))) 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 4:15:26 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 151ms 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="RwMutex-PT-r0010w0010"
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/RwMutex-PT-r0010w0010.tgz
mv RwMutex-PT-r0010w0010 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 RwMutex-PT-r0010w0010, 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-152732264500492"
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 ;