fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r188-qhx2-152732140200088
Last Updated
June 26, 2018

About the Execution of ITS-Tools for Railroad-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15757.480 16462.00 27599.00 7056.00 FFFFFFFFFTFFFFFF 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 204K
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.6K 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 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K 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 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K 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.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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 30K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Railroad-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-qhx2-152732140200088
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528288268545

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.201805151631/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.201805151631/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("((pl_P2_1>=1)&&(pl_P15_1>=1))"))U(G("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_2>=1))")))))
Formula 0 simplified : !G(F"((pl_P2_1>=1)&&(pl_P15_1>=1))" U G"(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_2>=1))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 56 rows 54 cols
invariant :pl_P16_1 + -1'pl_P4_1 = 0
invariant :pl_P0_5 + pl_P40_5 + -1'pl_P5_1 = 0
invariant :pl_P27_1 + -2'pl_P29_3 + pl_P31_1 + pl_P32_1 + -2'pl_P33_1 + -1'pl_P34_2 + pl_P34_4 + 2'pl_P34_5 + 3'pl_P34_6 + 2'pl_P35_1 + -2'pl_P39_1 + -1'pl_P40_1 + -1'pl_P40_2 + -1'pl_P40_3 + -1'pl_P40_4 + -1'pl_P40_5 + -1'pl_P40_6 + pl_P42_1 + pl_P5_1 + pl_P6_1 = 3
invariant :pl_P13_1 + pl_P22_1 + pl_P32_1 = 1
invariant :pl_P18_1 + pl_P27_1 + pl_P41_1 = 1
invariant :pl_P29_1 + pl_P29_3 + pl_P30_1 + pl_P33_1 + -1'pl_P35_1 + -1'pl_P7_1 = 1
invariant :pl_P19_1 + -1'pl_P22_1 = 0
invariant :pl_P10_1 + -1'pl_P30_1 + pl_P35_1 + pl_P7_1 = 0
invariant :pl_P29_2 + -1'pl_P30_1 + -1'pl_P33_1 + pl_P35_1 + pl_P7_1 = 0
invariant :-1'pl_P27_1 + 3'pl_P29_3 + -1'pl_P31_1 + -1'pl_P32_1 + 3'pl_P33_1 + 2'pl_P34_2 + pl_P34_3 + -1'pl_P34_5 + -2'pl_P34_6 + -3'pl_P35_1 + 3'pl_P39_1 + pl_P40_1 + pl_P40_2 + pl_P40_3 + pl_P40_4 + pl_P40_5 + pl_P40_6 + -1'pl_P42_1 + -1'pl_P5_1 + -1'pl_P6_1 = -2
invariant :-1'pl_P29_3 + -1'pl_P33_1 + pl_P34_1 + pl_P35_1 + -1'pl_P39_1 = 0
invariant :pl_P0_6 + pl_P40_6 = 0
invariant :pl_P23_1 + pl_P30_1 + pl_P33_1 + pl_P39_1 + pl_P7_3 = 1
invariant :pl_P28_1 + -1'pl_P41_1 = 0
invariant :pl_P0_2 + -1'pl_P32_1 + pl_P40_2 = 0
invariant :pl_P0_3 + -1'pl_P31_1 + pl_P40_3 = 0
invariant :pl_P11_1 + pl_P29_3 + pl_P30_1 + pl_P33_1 + -1'pl_P35_1 + -1'pl_P7_1 = 1
invariant :pl_P20_1 + pl_P5_1 + pl_P8_1 = 1
invariant :-1'pl_P33_1 + pl_P36_1 + -1'pl_P39_1 + -1'pl_P7_3 = 0
invariant :pl_P25_1 + -1'pl_P8_1 = 0
invariant :pl_P0_1 + pl_P40_1 + -1'pl_P6_1 = 0
invariant :pl_P0_4 + -1'pl_P27_1 + pl_P40_4 = 0
invariant :pl_P17_1 + pl_P4_1 + pl_P6_1 = 1
invariant :pl_P15_1 + pl_P21_1 + pl_P31_1 = 1
invariant :pl_P12_1 + -1'pl_P21_1 = 0
invariant :pl_P26_1 + -1'pl_P29_3 = 0
invariant :pl_P2_1 + pl_P30_1 + pl_P42_1 = 1
Reverse transition relation is NOT exact ! Due to transitions tr_T18_1, tr_T24_2, tr_T24_3, tr_T24_4, tr_T24_5, tr_T3_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :5/45/6/56
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
49 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.596512,26184,1,0,119,30514,139,55,2121,30216,145
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(F("(((pl_P23_1>=1)&&(pl_P34_2>=1))&&(pl_P40_3>=1))"))))
Formula 1 simplified : !F"(((pl_P23_1>=1)&&(pl_P34_2>=1))&&(pl_P40_3>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 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.758999,29472,1,0,166,43624,148,78,2125,51096,267
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(X(F(("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P42_1>=1))")U("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_1>=1))"))))))
Formula 2 simplified : !GXF("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P42_1>=1))" U "(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_1>=1))")
3 unique states visited
3 strongly connected components in search stack
4 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,0.783669,29992,1,0,167,44628,157,78,2128,52382,280
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F((F(F("(((pl_P26_1>=1)&&(pl_P29_3>=1))&&(pl_P35_1>=1))")))U(X("(((pl_P23_1>=1)&&(pl_P34_5>=1))&&(pl_P40_5>=1))")))))
Formula 3 simplified : !F(F"(((pl_P26_1>=1)&&(pl_P29_3>=1))&&(pl_P35_1>=1))" U X"(((pl_P23_1>=1)&&(pl_P34_5>=1))&&(pl_P40_5>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.813269,29992,1,0,187,45037,166,88,2132,53429,400
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((F(("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_3>=1))")U("((pl_P8_1>=1)&&(pl_P25_1>=1))")))U(G(F("(((pl_P23_1>=1)&&(pl_P34_3>=1))&&(pl_P40_1>=1))")))))
Formula 4 simplified : !(F("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_3>=1))" U "((pl_P8_1>=1)&&(pl_P25_1>=1))") U GF"(((pl_P23_1>=1)&&(pl_P34_3>=1))&&(pl_P40_1>=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.82072,30364,1,0,188,45180,175,88,2134,53713,409
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(X((F("((pl_P2_1>=1)&&(pl_P20_1>=1))"))U("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_2>=1))")))))
Formula 5 simplified : !FX(F"((pl_P2_1>=1)&&(pl_P20_1>=1))" U "(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_2>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.845444,30620,1,0,200,46449,181,88,2134,55729,494
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F((F("(((pl_P0_3>=1)&&(pl_P2_1>=1))&&(pl_P31_1>=1))"))U(F(G("(((pl_P11_1>=1)&&(pl_P29_1>=1))&&(pl_P39_1>=1))"))))))
Formula 6 simplified : !F(F"(((pl_P0_3>=1)&&(pl_P2_1>=1))&&(pl_P31_1>=1))" U FG"(((pl_P11_1>=1)&&(pl_P29_1>=1))&&(pl_P39_1>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.883582,31740,1,0,237,47089,194,121,2140,57361,656
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((((F("((pl_P2_1>=1)&&(pl_P17_1>=1))"))U(G("((pl_P2_1>=1)&&(pl_P17_1>=1))")))U(G(G(G("((pl_P29_2>=1)&&(pl_P33_1>=1))"))))))
Formula 7 simplified : !((F"((pl_P2_1>=1)&&(pl_P17_1>=1))" U G"((pl_P2_1>=1)&&(pl_P17_1>=1))") U G"((pl_P29_2>=1)&&(pl_P33_1>=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.901679,32212,1,0,242,47255,205,122,2145,57689,682
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G(G(("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_1>=1))")U("((pl_P7_3>=1)&&(pl_P36_1>=1))"))))))
Formula 8 simplified : !G("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_1>=1))" U "((pl_P7_3>=1)&&(pl_P36_1>=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.906915,32708,1,0,242,47255,221,122,2158,57689,691
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F("(((pl_P23_1>=1)&&(pl_P34_1>=1))&&(pl_P42_1>=1))")))
Formula 9 simplified : !F"(((pl_P23_1>=1)&&(pl_P34_1>=1))&&(pl_P42_1>=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.908785,32708,1,0,242,47255,230,123,2162,57698,699
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Railroad-PT-005-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("(((pl_P23_1>=1)&&(pl_P34_1>=1))&&(pl_P42_1>=1))"))
Formula 10 simplified : !"(((pl_P23_1>=1)&&(pl_P34_1>=1))&&(pl_P42_1>=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.909961,32708,1,0,242,47255,230,123,2162,57698,699
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(G(F(F(F("(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_4>=1))")))))))
Formula 11 simplified : !FGF"(((pl_P23_1>=1)&&(pl_P34_4>=1))&&(pl_P40_4>=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.914021,32708,1,0,243,47419,239,123,2165,57853,708
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(G(G(("(((pl_P0_2>=1)&&(pl_P2_1>=1))&&(pl_P32_1>=1))")U("(((pl_P0_2>=1)&&(pl_P2_1>=1))&&(pl_P32_1>=1))"))))))
Formula 12 simplified : !G"(((pl_P0_2>=1)&&(pl_P2_1>=1))&&(pl_P32_1>=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.91776,32708,1,0,243,47429,245,123,2170,57897,720
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("(((pl_P23_1>=1)&&(pl_P34_3>=1))&&(pl_P40_3>=1))"))
Formula 13 simplified : !"(((pl_P23_1>=1)&&(pl_P34_3>=1))&&(pl_P40_3>=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.918893,32708,1,0,243,47429,248,123,2172,57898,722
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((("(((pl_P23_1>=1)&&(pl_P34_2>=1))&&(pl_P42_1>=1))")U(F(X(G("((pl_P2_1>=1)&&(pl_P20_1>=1))"))))))
Formula 14 simplified : !("(((pl_P23_1>=1)&&(pl_P34_2>=1))&&(pl_P42_1>=1))" U FXG"((pl_P2_1>=1)&&(pl_P20_1>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
20 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,1.12867,35328,1,0,325,63320,261,154,2174,83415,896
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F("((pl_P2_1>=1)&&(pl_P18_1>=1))")))
Formula 15 simplified : !F"((pl_P2_1>=1)&&(pl_P18_1>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.22106,36764,1,0,362,68267,270,170,2176,91141,993
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
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 1528288285007

--------------------
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/ -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/ -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 06, 2018 12:31:21 PM 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/, -smt]
Jun 06, 2018 12:31:21 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 12:31:21 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 64 ms
Jun 06, 2018 12:31:21 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 places.
Jun 06, 2018 12:31:21 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Jun 06, 2018 12:31:21 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 14 fixed domain variables (out of 68 variables) in GAL type Railroad_PT_005
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 14 constant array cells/variables (out of 68 variables) in type Railroad_PT_005
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: pl_P29_4,pl_P29_6,pl_P9_1,pl_P14_1,pl_P38_1,pl_P7_2,pl_P37_1,pl_P29_5,pl_P7_6,pl_P24_1,pl_P1_1,pl_P7_4,pl_P3_1,pl_P7_5,
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 14 fixed domain variables (out of 68 variables) in GAL type Railroad_PT_005
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 14 constant array cells/variables (out of 68 variables) in type Railroad_PT_005
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: pl_P29_4,pl_P29_6,pl_P9_1,pl_P14_1,pl_P38_1,pl_P7_2,pl_P37_1,pl_P29_5,pl_P7_6,pl_P24_1,pl_P1_1,pl_P7_4,pl_P3_1,pl_P7_5,
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 14 constant variables :pl_P29_4=0, pl_P29_6=0, pl_P9_1=0, pl_P14_1=0, pl_P38_1=0, pl_P7_2=0, pl_P37_1=0, pl_P29_5=0, pl_P7_6=0, pl_P24_1=0, pl_P1_1=0, pl_P7_4=0, pl_P3_1=0, pl_P7_5=0
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 96 ms
Jun 06, 2018 12:31:22 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
Jun 06, 2018 12:31:22 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 56 transitions.
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 27 place invariants in 24 ms
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 54 variables to be positive in 283 ms
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 56 transitions.
Jun 06, 2018 12:31:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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 06, 2018 12:31:23 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1471ms 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="Railroad-PT-005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-005.tgz
mv Railroad-PT-005 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 itstools"
echo " Input is Railroad-PT-005, 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 r188-qhx2-152732140200088"
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 ;