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 216K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 18K 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 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 39K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is LamportFastMutEx-COL-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585200019
=====================================================================

--------------------
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 LamportFastMutEx-COL-3-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527484352564

05:12:34.885 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
05:12:34.888 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((F("((((P_ifyi_15_0+P_ifyi_15_1)+P_ifyi_15_2)+P_ifyi_15_3)<=(((P_setbi_5_0+P_setbi_5_1)+P_setbi_5_2)+P_setbi_5_3))"))U(("((((P_ifxi_10_0+P_ifxi_10_1)+P_ifxi_10_2)+P_ifxi_10_3)<=(((((((((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)+wait_8)+wait_9)+wait_10)+wait_11)+wait_12)+wait_13)+wait_14)+wait_15))")U("((((P_setbi_24_0+P_setbi_24_1)+P_setbi_24_2)+P_setbi_24_3)<=(((P_fordo_12_0+P_fordo_12_1)+P_fordo_12_2)+P_fordo_12_3))"))))
Formula 0 simplified : !(F"((((P_ifyi_15_0+P_ifyi_15_1)+P_ifyi_15_2)+P_ifyi_15_3)<=(((P_setbi_5_0+P_setbi_5_1)+P_setbi_5_2)+P_setbi_5_3))" U ("((((P_ifxi_10_0+P_ifxi_10_1)+P_ifxi_10_2)+P_ifxi_10_3)<=(((((((((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)+wait_8)+wait_9)+wait_10)+wait_11)+wait_12)+wait_13)+wait_14)+wait_15))" U "((((P_setbi_24_0+P_setbi_24_1)+P_setbi_24_2)+P_setbi_24_3)<=(((P_fordo_12_0+P_fordo_12_1)+P_fordo_12_2)+P_fordo_12_3))"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 132
// Phase 1: matrix 132 rows 100 cols
invariant :wait_11 + -1'P_await_13_2 + done_11 = 0
invariant :wait_3 + -1'P_await_13_0 + done_3 = 0
invariant :wait_7 + -1'P_await_13_1 + done_7 = 0
invariant :wait_2 + -1'P_await_13_0 + done_2 = 0
invariant :wait_8 + done_8 = 0
invariant :wait_15 + -1'P_await_13_3 + done_15 = 0
invariant :b_0 + b_1 = 0
invariant :P_start_1_0 + P_setx_3_0 + P_setbi_5_0 + P_ify0_4_0 + P_sety_9_0 + P_ifxi_10_0 + P_setbi_11_0 + P_fordo_12_0 + P_await_13_0 + P_ifyi_15_0 + P_awaity_0 + P_CS_21_0 + P_setbi_24_0 = 0
invariant :P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + P_await_13_3 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
invariant :y_0 + y_1 + y_2 + y_3 = 1
invariant :b_6 + b_7 = 1
invariant :wait_4 + done_4 = 0
invariant :wait_1 + -1'P_await_13_0 + done_1 = 0
invariant :wait_13 + -1'P_await_13_3 + done_13 = 0
invariant :wait_14 + -1'P_await_13_3 + done_14 = 0
invariant :b_4 + b_5 = 1
invariant :P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + P_await_13_2 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
invariant :wait_0 + done_0 = 0
invariant :P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + P_await_13_1 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
invariant :wait_12 + done_12 = 0
invariant :wait_10 + -1'P_await_13_2 + done_10 = 0
invariant :b_2 + b_3 = 1
invariant :wait_9 + -1'P_await_13_2 + done_9 = 0
invariant :wait_6 + -1'P_await_13_1 + done_6 = 0
invariant :x_0 + x_1 + x_2 + x_3 = 1
invariant :wait_5 + -1'P_await_13_1 + done_5 = 0
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_0, T_setx_3_1, T_setx_3_2, T_setx_3_3, T_setbi_5_1, T_awaity, T_sety_9_0, T_sety_9_1, T_sety_9_2, T_sety_9_3, T_setbi_11_1, T_ynei_15_0, T_ynei_15_1, T_ynei_15_2, T_ynei_15_3, T_yeqi_15_1, T_yeqi_15_2, T_yeqi_15_3, T_sety0_23, T_setbi_24_0, T_setbi_24_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/18/21/48
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
166 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.80303,61256,1,0,109,208377,116,42,3249,203663,97
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(X("((((x_0+x_1)+x_2)+x_3)>=3)")))U(("((((P_sety_9_0+P_sety_9_1)+P_sety_9_2)+P_sety_9_3)<=(((P_setx_3_0+P_setx_3_1)+P_setx_3_2)+P_setx_3_3))")U("((((P_CS_21_0+P_CS_21_1)+P_CS_21_2)+P_CS_21_3)>=1)"))))
Formula 1 simplified : !(XX"((((x_0+x_1)+x_2)+x_3)>=3)" U ("((((P_sety_9_0+P_sety_9_1)+P_sety_9_2)+P_sety_9_3)<=(((P_setx_3_0+P_setx_3_1)+P_setx_3_2)+P_setx_3_3))" U "((((P_CS_21_0+P_CS_21_1)+P_CS_21_2)+P_CS_21_3)>=1)"))
48 unique states visited
26 strongly connected components in search stack
48 transitions explored
29 items max in DFS search stack
259 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,4.39431,130616,1,0,276,503631,151,95,3492,547382,584
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(F(G("((((P_CS_21_0+P_CS_21_1)+P_CS_21_2)+P_CS_21_3)<=(((P_start_1_0+P_start_1_1)+P_start_1_2)+P_start_1_3))"))))))
Formula 2 simplified : !FGFG"((((P_CS_21_0+P_CS_21_1)+P_CS_21_2)+P_CS_21_3)<=(((P_start_1_0+P_start_1_1)+P_start_1_2)+P_start_1_3))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
808 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,12.4654,313952,1,0,500,1.35534e+06,164,196,3568,1.81469e+06,1048
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("((((P_ifyi_15_0+P_ifyi_15_1)+P_ifyi_15_2)+P_ifyi_15_3)>=1)")U(F(X("((((P_ifxi_10_0+P_ifxi_10_1)+P_ifxi_10_2)+P_ifxi_10_3)>=1)")))))
Formula 3 simplified : !("((((P_ifyi_15_0+P_ifyi_15_1)+P_ifyi_15_2)+P_ifyi_15_3)>=1)" U FX"((((P_ifxi_10_0+P_ifxi_10_1)+P_ifxi_10_2)+P_ifxi_10_3)>=1)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.506,315800,1,0,532,1.35976e+06,173,203,3577,1.81851e+06,1130
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((G("((((P_await_13_0+P_await_13_1)+P_await_13_2)+P_await_13_3)<=(((P_ifxi_10_0+P_ifxi_10_1)+P_ifxi_10_2)+P_ifxi_10_3))"))U("((((x_0+x_1)+x_2)+x_3)>=2)"))))
Formula 4 simplified : !G(G"((((P_await_13_0+P_await_13_1)+P_await_13_2)+P_await_13_3)<=(((P_ifxi_10_0+P_ifxi_10_1)+P_ifxi_10_2)+P_ifxi_10_3))" U "((((x_0+x_1)+x_2)+x_3)>=2)")
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
181 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,14.3262,366256,1,0,621,1.56317e+06,193,234,3679,2.05573e+06,1332
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("((((P_setx_3_0+P_setx_3_1)+P_setx_3_2)+P_setx_3_3)>=2)"))
Formula 5 simplified : !"((((P_setx_3_0+P_setx_3_1)+P_setx_3_2)+P_setx_3_3)>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
32 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,14.6388,374968,1,0,621,1.59387e+06,196,234,3684,2.09599e+06,1348
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((P_setx_3_0+P_setx_3_1)+P_setx_3_2)+P_setx_3_3)>=2)"))
Formula 6 simplified : !"((((P_setx_3_0+P_setx_3_1)+P_setx_3_2)+P_setx_3_3)>=2)"
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,14.6393,375232,1,0,621,1.59387e+06,196,234,3684,2.09599e+06,1348
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("((((P_ify0_4_0+P_ify0_4_1)+P_ify0_4_2)+P_ify0_4_3)<=(((P_awaity_0+P_awaity_1)+P_awaity_2)+P_awaity_3))")U("((((P_sety_9_0+P_sety_9_1)+P_sety_9_2)+P_sety_9_3)<=(((P_setbi_5_0+P_setbi_5_1)+P_setbi_5_2)+P_setbi_5_3))"))U(X(X("((((P_ifyi_15_0+P_ifyi_15_1)+P_ifyi_15_2)+P_ifyi_15_3)<=(((P_ify0_4_0+P_ify0_4_1)+P_ify0_4_2)+P_ify0_4_3))")))))
Formula 7 simplified : !(("((((P_ify0_4_0+P_ify0_4_1)+P_ify0_4_2)+P_ify0_4_3)<=(((P_awaity_0+P_awaity_1)+P_awaity_2)+P_awaity_3))" U "((((P_sety_9_0+P_sety_9_1)+P_sety_9_2)+P_sety_9_3)<=(((P_setbi_5_0+P_setbi_5_1)+P_setbi_5_2)+P_setbi_5_3))") U XX"((((P_ifyi_15_0+P_ifyi_15_1)+P_ifyi_15_2)+P_ifyi_15_3)<=(((P_ify0_4_0+P_ify0_4_1)+P_ify0_4_2)+P_ify0_4_3))")
3 unique states visited
0 strongly connected components in search stack
2 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,14.6602,375988,1,0,621,1.59387e+06,230,234,3754,2.096e+06,1367
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(G(F("((((P_setbi_11_0+P_setbi_11_1)+P_setbi_11_2)+P_setbi_11_3)<=(((P_fordo_12_0+P_fordo_12_1)+P_fordo_12_2)+P_fordo_12_3))"))))))
Formula 8 simplified : !FXGF"((((P_setbi_11_0+P_setbi_11_1)+P_setbi_11_2)+P_setbi_11_3)<=(((P_fordo_12_0+P_fordo_12_1)+P_fordo_12_2)+P_fordo_12_3))"
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
37 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,15.0307,386280,1,0,645,1.64001e+06,239,235,3791,2.13478e+06,1447
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F(F("((((x_0+x_1)+x_2)+x_3)>=3)")))))
Formula 9 simplified : !GF"((((x_0+x_1)+x_2)+x_3)>=3)"
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
5 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,15.0782,387336,1,0,645,1.64389e+06,245,235,3792,2.13941e+06,1469
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("((((P_sety_9_0+P_sety_9_1)+P_sety_9_2)+P_sety_9_3)>=1)")U(X(G("((((P_CS_21_0+P_CS_21_1)+P_CS_21_2)+P_CS_21_3)>=1)")))))
Formula 10 simplified : !("((((P_sety_9_0+P_sety_9_1)+P_sety_9_2)+P_sety_9_3)>=1)" U XG"((((P_CS_21_0+P_CS_21_1)+P_CS_21_2)+P_CS_21_3)>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 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,15.1392,388904,1,0,645,1.64869e+06,256,235,3804,2.14601e+06,1480
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X("((((((((((((((((done_0+done_1)+done_2)+done_3)+done_4)+done_5)+done_6)+done_7)+done_8)+done_9)+done_10)+done_11)+done_12)+done_13)+done_14)+done_15)>=3)"))))
Formula 11 simplified : !FX"((((((((((((((((done_0+done_1)+done_2)+done_3)+done_4)+done_5)+done_6)+done_7)+done_8)+done_9)+done_10)+done_11)+done_12)+done_13)+done_14)+done_15)>=3)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
172 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.8651,418208,1,0,718,1.79326e+06,265,263,3861,2.30479e+06,1646
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((("((((P_await_13_0+P_await_13_1)+P_await_13_2)+P_await_13_3)>=2)")U("((((((((((((((((done_0+done_1)+done_2)+done_3)+done_4)+done_5)+done_6)+done_7)+done_8)+done_9)+done_10)+done_11)+done_12)+done_13)+done_14)+done_15)>=3)"))U(("((((P_ifyi_15_0+P_ifyi_15_1)+P_ifyi_15_2)+P_ifyi_15_3)>=1)")U("((((P_await_13_0+P_await_13_1)+P_await_13_2)+P_await_13_3)>=1)"))))
Formula 12 simplified : !(("((((P_await_13_0+P_await_13_1)+P_await_13_2)+P_await_13_3)>=2)" U "((((((((((((((((done_0+done_1)+done_2)+done_3)+done_4)+done_5)+done_6)+done_7)+done_8)+done_9)+done_10)+done_11)+done_12)+done_13)+done_14)+done_15)>=3)") U ("((((P_ifyi_15_0+P_ifyi_15_1)+P_ifyi_15_2)+P_ifyi_15_3)>=1)" U "((((P_await_13_0+P_await_13_1)+P_await_13_2)+P_await_13_3)>=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,16.8753,418640,1,0,718,1.79326e+06,296,263,3922,2.30479e+06,1654
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X(G(X("((((P_ifxi_10_0+P_ifxi_10_1)+P_ifxi_10_2)+P_ifxi_10_3)<=(((x_0+x_1)+x_2)+x_3))"))))))
Formula 13 simplified : !FXGX"((((P_ifxi_10_0+P_ifxi_10_1)+P_ifxi_10_2)+P_ifxi_10_3)<=(((x_0+x_1)+x_2)+x_3))"
6 unique states visited
5 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
85 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,17.7225,442136,1,0,722,1.87277e+06,301,267,3953,2.41172e+06,1674
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("((((((((((((((((done_0+done_1)+done_2)+done_3)+done_4)+done_5)+done_6)+done_7)+done_8)+done_9)+done_10)+done_11)+done_12)+done_13)+done_14)+done_15)>=1)")))
Formula 14 simplified : !G"((((((((((((((((done_0+done_1)+done_2)+done_3)+done_4)+done_5)+done_6)+done_7)+done_8)+done_9)+done_10)+done_11)+done_12)+done_13)+done_14)+done_15)>=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,17.7247,442400,1,0,722,1.87277e+06,307,267,3985,2.41172e+06,1679
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("((((((((((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)+wait_8)+wait_9)+wait_10)+wait_11)+wait_12)+wait_13)+wait_14)+wait_15)>=3)"))
Formula 15 simplified : !"((((((((((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)+wait_8)+wait_9)+wait_10)+wait_11)+wait_12)+wait_13)+wait_14)+wait_15)>=3)"
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,17.7258,442400,1,0,722,1.87277e+06,310,267,4003,2.41172e+06,1681
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-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 1527484377746

--------------------
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 LTLCardinality -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 LTLCardinality -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
May 28, 2018 5:12:34 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
May 28, 2018 5:12:34 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 5:12:34 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 845 ms
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 18 places.
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 17 transitions.
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 5:12:35 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $y of transition T_yeqi_15
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $x of transition T_xeqi_10
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 9.0 instantiations of transitions. Total transitions/syncs built is 175
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 82 ms
May 28, 2018 5:12:35 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 23 ms
May 28, 2018 5:12:35 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
May 28, 2018 5:12:36 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 48 transitions. Expanding to a total of 203 deterministic transitions.
May 28, 2018 5:12:36 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 9 ms.
May 28, 2018 5:12:36 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 26 place invariants in 26 ms
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 1074 ms
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 156 transitions.
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/156 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 5:12:37 AM 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)
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 156 transitions.
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 5:12:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 156 transitions.
May 28, 2018 5:12:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/156) took 17 ms. Total solver calls (SAT/UNSAT): 41(0/41)
May 28, 2018 5:12:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(25/156) took 3656 ms. Total solver calls (SAT/UNSAT): 1329(68/1261)
May 28, 2018 5:12:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(31/156) took 6789 ms. Total solver calls (SAT/UNSAT): 1800(117/1683)
May 28, 2018 5:12:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(45/156) took 10022 ms. Total solver calls (SAT/UNSAT): 2483(170/2313)
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:381)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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)
May 28, 2018 5:12:57 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 21332ms 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="LamportFastMutEx-COL-3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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