About the Execution of ITS-Tools for Referendum-PT-0020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15756.870 | 14669.00 | 14039.00 | 5150.60 | FFFFFFFTFFTFFFFF | 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 332K
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Referendum-PT-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-qhx2-152732140300118
=====================================================================
--------------------
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 Referendum-PT-0020-LTLFireability-00
FORMULA_NAME Referendum-PT-0020-LTLFireability-01
FORMULA_NAME Referendum-PT-0020-LTLFireability-02
FORMULA_NAME Referendum-PT-0020-LTLFireability-03
FORMULA_NAME Referendum-PT-0020-LTLFireability-04
FORMULA_NAME Referendum-PT-0020-LTLFireability-05
FORMULA_NAME Referendum-PT-0020-LTLFireability-06
FORMULA_NAME Referendum-PT-0020-LTLFireability-07
FORMULA_NAME Referendum-PT-0020-LTLFireability-08
FORMULA_NAME Referendum-PT-0020-LTLFireability-09
FORMULA_NAME Referendum-PT-0020-LTLFireability-10
FORMULA_NAME Referendum-PT-0020-LTLFireability-11
FORMULA_NAME Referendum-PT-0020-LTLFireability-12
FORMULA_NAME Referendum-PT-0020-LTLFireability-13
FORMULA_NAME Referendum-PT-0020-LTLFireability-14
FORMULA_NAME Referendum-PT-0020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1528291229547
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 : !((F(F(G(F(G("(ready>=1)")))))))
Formula 0 simplified : !FGFG"(ready>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.04858e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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.178301,18260,1,0,85,9070,24,106,876,13991,327
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(F(G(X(G("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")))))))
Formula 1 simplified : !FGXG"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
23 unique states visited
22 strongly connected components in search stack
24 transitions explored
23 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.190929,18724,1,0,85,9070,31,107,957,15310,393
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(G(X(F(X("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")))))))
Formula 2 simplified : !GXFX"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
25 unique states visited
25 strongly connected components in search stack
26 transitions explored
25 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.199158,18952,1,0,85,9070,37,109,957,15368,405
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")))
Formula 3 simplified : !G"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.203406,18952,1,0,85,9070,42,109,975,15368,413
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"))
Formula 4 simplified : !"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"
Computing Next relation with stutter on 1.04858e+06 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.205359,18952,1,0,85,9070,42,109,975,15368,413
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((X(G(G("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"))))U(G(("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")U("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")))))
Formula 5 simplified : !(XG"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))" U G"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")
Computing Next relation with stutter on 1.04858e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.237151,19176,1,0,85,9107,42,132,975,15945,464
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(F(F(G(G("((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))")))))))
Formula 6 simplified : !GFG"((((((((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))||(voting_16>=1))||(voting_17>=1))||(voting_18>=1))||(voting_19>=1))||(voting_20>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.253607,19432,1,0,105,9417,49,154,975,17615,707
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F("(ready>=1)")))
Formula 7 simplified : !F"(ready>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.254585,19432,1,0,105,9417,55,154,975,17615,711
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(X(F(F(F("(ready>=1)")))))))
Formula 8 simplified : !GXF"(ready>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
24 unique states visited
24 strongly connected components in search stack
25 transitions explored
24 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.255271,19432,1,0,105,9417,55,154,975,17615,715
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(G(X(G(G("(voting_7>=1)")))))))
Formula 9 simplified : !FGXG"(voting_7>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
23 unique states visited
22 strongly connected components in search stack
24 transitions explored
23 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.255949,19432,1,0,105,9417,58,154,975,17615,717
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F("(voting_15>=1)")))
Formula 10 simplified : !F"(voting_15>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.256328,19432,1,0,105,9417,67,154,975,17615,725
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G("(voting_15>=1)")))
Formula 11 simplified : !G"(voting_15>=1)"
Computing Next relation with stutter on 1.04858e+06 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.256734,19432,1,0,105,9417,70,154,975,17615,728
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G("(voting_6>=1)")))
Formula 12 simplified : !G"(voting_6>=1)"
Computing Next relation with stutter on 1.04858e+06 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.257188,19432,1,0,105,9417,76,154,975,17615,733
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X(F(X("(voting_13>=1)"))))U(X(F(X("(voting_12>=1)"))))))
Formula 13 simplified : !(XFX"(voting_13>=1)" U XFX"(voting_12>=1)")
Computing Next relation with stutter on 1.04858e+06 deadlock states
// Phase 1: matrix 41 rows 61 cols
invariant :voted_no_10 + -1'voted_no_20 + voted_yes_10 + -1'voted_yes_20 + voting_10 + -1'voting_20 = 0
invariant :voted_no_8 + -1'voted_no_20 + voted_yes_8 + -1'voted_yes_20 + voting_8 + -1'voting_20 = 0
invariant :voted_no_9 + -1'voted_no_20 + voted_yes_9 + -1'voted_yes_20 + voting_9 + -1'voting_20 = 0
invariant :voted_no_19 + -1'voted_no_20 + voted_yes_19 + -1'voted_yes_20 + voting_19 + -1'voting_20 = 0
invariant :voted_no_17 + -1'voted_no_20 + voted_yes_17 + -1'voted_yes_20 + voting_17 + -1'voting_20 = 0
invariant :ready + voted_no_20 + voted_yes_20 + voting_20 = 1
invariant :voted_no_6 + -1'voted_no_20 + voted_yes_6 + -1'voted_yes_20 + voting_6 + -1'voting_20 = 0
invariant :voted_no_11 + -1'voted_no_20 + voted_yes_11 + -1'voted_yes_20 + voting_11 + -1'voting_20 = 0
invariant :voted_no_7 + -1'voted_no_20 + voted_yes_7 + -1'voted_yes_20 + voting_7 + -1'voting_20 = 0
invariant :voted_no_18 + -1'voted_no_20 + voted_yes_18 + -1'voted_yes_20 + voting_18 + -1'voting_20 = 0
invariant :voted_no_14 + -1'voted_no_20 + voted_yes_14 + -1'voted_yes_20 + voting_14 + -1'voting_20 = 0
invariant :voted_no_3 + -1'voted_no_20 + voted_yes_3 + -1'voted_yes_20 + voting_3 + -1'voting_20 = 0
invariant :voted_no_1 + -1'voted_no_20 + voted_yes_1 + -1'voted_yes_20 + voting_1 + -1'voting_20 = 0
invariant :voted_no_15 + -1'voted_no_20 + voted_yes_15 + -1'voted_yes_20 + voting_15 + -1'voting_20 = 0
invariant :voted_no_4 + -1'voted_no_20 + voted_yes_4 + -1'voted_yes_20 + voting_4 + -1'voting_20 = 0
invariant :voted_no_5 + -1'voted_no_20 + voted_yes_5 + -1'voted_yes_20 + voting_5 + -1'voting_20 = 0
invariant :voted_no_2 + -1'voted_no_20 + voted_yes_2 + -1'voted_yes_20 + voting_2 + -1'voting_20 = 0
invariant :voted_no_13 + -1'voted_no_20 + voted_yes_13 + -1'voted_yes_20 + voting_13 + -1'voting_20 = 0
invariant :voted_no_16 + -1'voted_no_20 + voted_yes_16 + -1'voted_yes_20 + voting_16 + -1'voting_20 = 0
invariant :voted_no_12 + -1'voted_no_20 + voted_yes_12 + -1'voted_yes_20 + voting_12 + -1'voting_20 = 0
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.307788,20092,1,0,180,14889,85,230,975,27130,931
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G((G(F("(voting_4>=1)")))U(G(X("(voting_7>=1)"))))))
Formula 14 simplified : !G(GF"(voting_4>=1)" U GX"(voting_7>=1)")
Computing Next relation with stutter on 1.04858e+06 deadlock states
25 unique states visited
25 strongly connected components in search stack
26 transitions explored
25 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.324693,21412,1,0,180,14889,102,230,977,27130,943
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G("(voting_6>=1)")))
Formula 15 simplified : !G"(voting_6>=1)"
Computing Next relation with stutter on 1.04858e+06 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.325681,21412,1,0,180,14889,102,230,977,27130,943
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-PT-0020-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1528291244216
--------------------
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 1:20:41 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 1:20:41 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 1:20:41 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 43 ms
Jun 06, 2018 1:20:41 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 61 places.
Jun 06, 2018 1:20:42 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 transitions.
Jun 06, 2018 1:20:42 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 11 ms
Jun 06, 2018 1:20:42 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 30 ms
Jun 06, 2018 1:20:42 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
Jun 06, 2018 1:20:42 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 ms
Jun 06, 2018 1:20:42 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 41 transitions.
Jun 06, 2018 1:20:42 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 37 ms
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
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 06, 2018 1:20:43 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 440ms 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="Referendum-PT-0020"
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/Referendum-PT-0020.tgz
mv Referendum-PT-0020 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 Referendum-PT-0020, 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-152732140300118"
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 ;