About the Execution of ITS-Tools.M for NeoElection-PT-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
487.880 | 16998.00 | 29052.00 | 115.20 | FTFFFFFFTTTTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r197-oct2-155272230300186.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is NeoElection-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272230300186
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 19K Feb 12 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 12 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 8 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 8 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 13K Feb 5 00:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 5 00:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 4 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 4 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 1 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 1 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 320K Mar 10 17:31 model.pnml
--------------------
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 NeoElection-PT-2-LTLCardinality-00
FORMULA_NAME NeoElection-PT-2-LTLCardinality-01
FORMULA_NAME NeoElection-PT-2-LTLCardinality-02
FORMULA_NAME NeoElection-PT-2-LTLCardinality-03
FORMULA_NAME NeoElection-PT-2-LTLCardinality-04
FORMULA_NAME NeoElection-PT-2-LTLCardinality-05
FORMULA_NAME NeoElection-PT-2-LTLCardinality-06
FORMULA_NAME NeoElection-PT-2-LTLCardinality-07
FORMULA_NAME NeoElection-PT-2-LTLCardinality-08
FORMULA_NAME NeoElection-PT-2-LTLCardinality-09
FORMULA_NAME NeoElection-PT-2-LTLCardinality-10
FORMULA_NAME NeoElection-PT-2-LTLCardinality-11
FORMULA_NAME NeoElection-PT-2-LTLCardinality-12
FORMULA_NAME NeoElection-PT-2-LTLCardinality-13
FORMULA_NAME NeoElection-PT-2-LTLCardinality-14
FORMULA_NAME NeoElection-PT-2-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553641234973
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 290
// Phase 1: matrix 290 rows 177 cols
Successfully loaded order from file /home/mcc/execution/model.ord
invariant :P_negotiation_0_2_NONE = 0
invariant :P_negotiation_2_1_NONE + P_negotiation_2_1_CO + P_negotiation_2_1_DONE = 1
invariant :P_electedPrimary_2 + P_electedSecondary_2 + P_negotiation_2_1_NONE + P_poll__handlingMessage_2 + P_poll__pollEnd_2 + P_polling_2 + P_sendAnnPs__broadcasting_2_1 + P_sendAnnPs__broadcasting_2_2 + -1'P_stage_2_PRIM + -1'P_stage_2_SEC + P_startNeg__broadcasting_2_2 = 1
invariant :P_masterState_0_F_0 + P_masterState_0_F_1 + P_masterState_0_F_2 + P_masterState_0_T_0 + P_masterState_0_T_1 + P_masterState_0_T_2 = 0
invariant :P_electedPrimary_0 + P_sendAnnPs__broadcasting_0_1 + -1'P_stage_0_PRIM = 0
invariant :P_electionInit_0 + P_startNeg__broadcasting_0_1 = 0
invariant :P_negotiation_1_1_CO + P_negotiation_1_1_DONE = 1
invariant :P_electedSecondary_0 + P_poll__handlingMessage_0 + P_poll__pollEnd_0 + P_polling_0 + P_sendAnnPs__broadcasting_0_2 + -1'P_stage_0_SEC + P_startNeg__broadcasting_0_2 = 0
invariant :P_negotiation_0_1_NONE = 0
invariant :P_stage_1_NEG + P_stage_1_PRIM + P_stage_1_SEC = 1
invariant :P_poll__waitingMessage_0 + P_stage_0_PRIM + P_stage_0_SEC = 0
invariant :P_negotiation_0_0_NONE = 0
invariant :P_masterState_2_F_0 + P_masterState_2_F_1 + P_masterState_2_F_2 + P_masterState_2_T_0 + P_masterState_2_T_1 + P_masterState_2_T_2 = 1
invariant :P_poll__waitingMessage_2 + P_stage_2_PRIM + P_stage_2_SEC = 0
invariant :P_negotiation_1_0_NONE = 0
invariant :P_negotiation_1_0_CO + P_negotiation_1_0_DONE = 0
invariant :P_negotiation_2_2_NONE = 0
invariant :P_stage_0_NEG + P_stage_0_PRIM + P_stage_0_SEC = 0
invariant :P_electionInit_2 + -1'P_negotiation_2_1_NONE + P_startNeg__broadcasting_2_1 = 0
invariant :P_negotiation_2_2_CO + P_negotiation_2_2_DONE = 1
invariant :P_poll__waitingMessage_1 + P_stage_1_PRIM + P_stage_1_SEC = 0
invariant :P_electionInit_1 + -1'P_negotiation_1_2_NONE + P_startNeg__broadcasting_1_1 = 0
invariant :P_masterState_1_F_0 + P_masterState_1_F_1 + P_masterState_1_F_2 + P_masterState_1_T_0 + P_masterState_1_T_1 + P_masterState_1_T_2 = 1
invariant :P_stage_2_NEG + P_stage_2_PRIM + P_stage_2_SEC = 1
Checking formula 0 : !((G(X(G("(((((((((P_stage_0_NEG+P_stage_0_PRIM)+P_stage_0_SEC)+P_stage_1_NEG)+P_stage_1_PRIM)+P_stage_1_SEC)+P_stage_2_NEG)+P_stage_2_PRIM)+P_stage_2_SEC)<=(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2))")))))
invariant :P_negotiation_2_0_CO + P_negotiation_2_0_DONE = 0
invariant :P_negotiation_0_0_CO + P_negotiation_0_0_DONE = 0
invariant :P_negotiation_1_2_NONE + P_negotiation_1_2_CO + P_negotiation_1_2_DONE = 1
Formula 0 simplified : !GXG"(((((((((P_stage_0_NEG+P_stage_0_PRIM)+P_stage_0_SEC)+P_stage_1_NEG)+P_stage_1_PRIM)+P_stage_1_SEC)+P_stage_2_NEG)+P_stage_2_PRIM)+P_stage_2_SEC)<=(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2))"
invariant :P_negotiation_2_0_NONE = 0
invariant :P_electedPrimary_1 + P_electedSecondary_1 + P_negotiation_1_2_NONE + P_poll__handlingMessage_1 + P_poll__pollEnd_1 + P_polling_1 + P_sendAnnPs__broadcasting_1_1 + P_sendAnnPs__broadcasting_1_2 + -1'P_stage_1_PRIM + -1'P_stage_1_SEC + P_startNeg__broadcasting_1_2 = 1
invariant :P_negotiation_0_2_CO + P_negotiation_0_2_DONE = 0
invariant :P_negotiation_0_1_CO + P_negotiation_0_1_DONE = 0
invariant :P_negotiation_1_1_NONE = 0
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t333, t334, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :324/15/4/343
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
104 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.15033,57892,1,0,84,28357,391,85,5555,22681,482
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((G("(((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=3)"))U(G(G("((((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)<=((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2))")))))
Formula 1 simplified : !(G"(((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=3)" U G"((((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)<=((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2))")
Computing Next relation with stutter on 1 deadlock states
33 unique states visited
0 strongly connected components in search stack
33 transitions explored
33 items max in DFS search stack
51 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.66102,74480,1,0,144,38516,413,177,5594,48999,806
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G((false)U("((((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)>=3)")))))
Formula 2 simplified : !FG"((((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)>=3)"
Computing Next relation with stutter on 1 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,1.7449,75524,1,0,174,39663,426,243,5631,54423,1202
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(G(("(((((((((P_stage_0_NEG+P_stage_0_PRIM)+P_stage_0_SEC)+P_stage_1_NEG)+P_stage_1_PRIM)+P_stage_1_SEC)+P_stage_2_NEG)+P_stage_2_PRIM)+P_stage_2_SEC)>=3)")U(false)))))
Formula 3 simplified : 1
Computing Next relation with stutter on 1 deadlock states
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,1.76963,76844,1,0,174,39854,426,244,5631,55219,1207
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((false))
Formula 4 simplified : 1
Computing Next relation with stutter on 1 deadlock states
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,1.76981,76844,1,0,174,39854,426,244,5631,55219,1207
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(false)))
Formula 5 simplified : 1
Computing Next relation with stutter on 1 deadlock states
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,1.76989,76844,1,0,174,39854,426,244,5631,55219,1207
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X((X("(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=0)"))U(X("(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=1)")))))
Formula 6 simplified : !X(X"(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=0)" U X"(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=1)")
Computing Next relation with stutter on 1 deadlock states
33 unique states visited
33 strongly connected components in search stack
33 transitions explored
33 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,1.79773,77596,1,0,231,40680,438,303,5646,63244,1509
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X("(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=2)")))
Formula 7 simplified : !X"(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=2)"
Computing Next relation with stutter on 1 deadlock states
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,1.7983,77860,1,0,231,40680,441,303,5650,63246,1511
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G(F(G("(P_network_0_0_RP_0>=0)"))))))
Formula 8 simplified : !GFG"(P_network_0_0_RP_0>=0)"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,1.80881,78112,1,0,231,40681,454,303,5653,63258,1744
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((true))
Formula 9 simplified : 0
Computing Next relation with stutter on 1 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,1.80895,78112,1,0,231,40681,454,303,5653,63258,1744
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((true))
Formula 10 simplified : 0
Computing Next relation with stutter on 1 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,1.80902,78112,1,0,231,40681,454,303,5653,63258,1744
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((true))
Formula 11 simplified : 0
Computing Next relation with stutter on 1 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,1.80909,78112,1,0,231,40681,454,303,5653,63258,1744
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X((X("(P_negotiation_2_2_DONE<=0)"))U(F(true)))))
Formula 12 simplified : 0
Computing Next relation with stutter on 1 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,1.80916,78112,1,0,231,40681,454,303,5653,63258,1744
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(F(F(F(true))))))
Formula 13 simplified : 0
Computing Next relation with stutter on 1 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,1.80923,78112,1,0,231,40681,454,303,5653,63258,1744
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(G(X(X("(P_polling_0>=0)"))))))
Formula 14 simplified : !FGXX"(P_polling_0>=0)"
Computing Next relation with stutter on 1 deadlock states
127 unique states visited
0 strongly connected components in search stack
130 transitions explored
35 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,1.82608,78332,1,0,231,40681,459,303,5654,67305,1928
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X(X(true)))))
Formula 15 simplified : 0
Computing Next relation with stutter on 1 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,1.82624,78332,1,0,231,40681,459,303,5654,67305,1928
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1553641251971
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 26, 2019 11:00:37 PM 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 26, 2019 11:00:37 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 11:00:37 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 100 ms
Mar 26, 2019 11:00:37 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 438 places.
Mar 26, 2019 11:00:37 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 357 transitions.
Mar 26, 2019 11:00:37 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 30 ms
Mar 26, 2019 11:00:37 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 252 fixed domain variables (out of 438 variables) in GAL type NeoElection_PT_2
Mar 26, 2019 11:00:37 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 252 constant array cells/variables (out of 438 variables) in type NeoElection_PT_2
Mar 26, 2019 11:00:37 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_poll__networl_2_0_AskP_1,P_network_2_0_AI_2,P_poll__networl_1_2_AskP_2,P_poll__networl_2_0_RP_1,P_network_0_2_RI_2,P_poll__networl_1_2_RP_2,P_network_1_0_RP_1,P_poll__networl_0_0_RP_1,P_poll__networl_2_1_AnnP_0,P_poll__networl_0_1_AnnP_0,P_poll__networl_2_1_AskP_0,P_poll__networl_1_2_RI_2,P_poll__networl_0_1_AnnP_2,P_network_2_2_AnnP_1,P_poll__networl_1_2_AskP_1,P_poll__networl_1_1_AnsP_0,P_masterList_2_2_2,P_poll__networl_2_0_RI_2,P_network_0_1_AnnP_1,P_poll__networl_0_1_RP_0,P_poll__networl_2_2_RI_2,P_poll__networl_0_0_AskP_2,P_poll__networl_0_1_AskP_2,P_poll__networl_2_1_AI_0,P_network_1_0_AI_2,P_masterList_1_2_2,P_poll__networl_1_0_AI_2,P_network_2_1_AskP_2,P_network_0_0_RI_1,P_network_0_2_AI_1,P_network_0_2_RP_1,P_network_1_1_RI_1,P_network_0_1_AI_1,P_poll__networl_0_2_AnsP_0,P_network_0_2_AnnP_2,P_poll__networl_2_1_AI_2,P_dead_2,P_poll__networl_1_0_AskP_2,P_network_1_0_AI_1,P_poll__networl_2_1_AI_1,P_poll__networl_2_2_RI_0,P_dead_1,P_poll__networl_0_2_AnnP_2,P_poll__networl_2_0_AnnP_2,P_poll__networl_2_0_AI_1,P_poll__networl_0_0_AnsP_0,P_poll__networl_0_2_AskP_0,P_network_2_0_RI_1,P_poll__networl_0_0_RP_2,P_network_0_1_RP_1,P_poll__networl_0_1_AI_2,P_poll__networl_0_1_RI_0,P_poll__networl_2_0_AskP_2,P_network_1_1_AnnP_1,P_network_1_2_RP_2,P_poll__networl_2_1_AnnP_2,P_poll__networl_2_0_RI_1,P_network_1_1_AskP_2,P_poll__networl_0_2_AnnP_1,P_poll__networl_0_1_AI_0,P_network_1_2_AskP_1,P_masterList_1_2_0,P_poll__networl_0_0_AnnP_1,P_poll__networl_2_1_RP_1,P_network_2_1_AI_2,P_poll__networl_1_2_AskP_0,P_poll__networl_1_2_AI_2,P_network_1_1_AskP_1,P_poll__networl_2_0_RP_0,P_poll__networl_1_0_AnnP_0,P_poll__networl_1_1_RP_0,P_poll__networl_1_1_AnnP_0,P_poll__networl_2_2_AnsP_0,P_network_1_0_RI_1,P_poll__networl_1_2_AI_1,P_poll__networl_2_1_RI_0,P_poll__networl_1_1_AnnP_1,P_network_0_1_RP_2,P_poll__networl_1_0_AI_0,P_network_0_0_RP_1,P_network_2_2_RP_1,P_network_2_1_RP_2,P_poll__networl_0_2_AI_0,P_electionFailed_2,P_poll__networl_0_0_AskP_0,P_poll__networl_2_0_AI_0,P_poll__networl_0_0_RP_0,P_network_2_1_RP_1,P_network_1_0_RP_2,P_network_2_2_AskP_2,P_poll__networl_0_2_AskP_2,P_poll__networl_1_0_RP_1,P_poll__networl_0_2_RI_0,P_poll__networl_1_1_AI_0,P_poll__networl_2_2_AskP_0,P_network_2_2_RI_1,P_network_2_0_AnnP_2,P_network_0_0_AnnP_1,P_network_1_0_AskP_1,P_poll__networl_1_2_RI_1,P_electionFailed_1,P_poll__networl_1_2_AnnP_0,P_network_0_1_RI_2,P_poll__networl_1_0_AnnP_2,P_network_0_2_AskP_1,P_poll__networl_2_2_AskP_1,P_network_1_2_RI_2,P_poll__networl_1_0_RP_0,P_poll__networl_2_0_AnnP_0,P_network_1_2_AskP_2,P_poll__networl_0_0_RI_0,P_poll__networl_0_2_AnnP_0,P_network_2_0_AskP_2,P_poll__networl_0_2_AskP_1,P_poll__networl_1_1_RI_2,P_poll__networl_1_0_RI_2,P_network_2_0_AnnP_1,P_network_0_0_RP_2,P_network_1_0_AskP_2,P_network_1_0_AnnP_1,P_poll__networl_1_1_RI_0,P_poll__networl_2_1_RI_2,P_network_0_2_AnnP_1,P_poll__networl_1_0_AI_1,P_poll__networl_2_2_AskP_2,P_network_2_1_AI_1,P_poll__networl_0_0_AI_1,P_poll__networl_2_0_RP_2,P_poll__networl_1_2_AnnP_2,P_network_1_0_RI_2,P_poll__networl_1_0_RP_2,P_crashed_0,P_network_2_2_RI_2,P_poll__networl_1_1_AskP_2,P_network_2_0_RI_2,P_network_1_1_AI_1,P_network_0_1_RI_1,P_poll__networl_2_2_AI_1,P_poll__networl_2_2_RP_0,P_network_0_0_AskP_1,P_poll__networl_1_0_RI_1,P_network_0_0_RI_2,P_network_0_1_AI_2,P_network_0_2_AskP_2,P_poll__networl_0_0_RI_2,P_poll__networl_0_1_RI_2,P_poll__networl_2_2_RP_1,P_network_2_1_RI_1,P_network_2_1_AskP_1,P_network_2_2_AskP_1,P_electionFailed_0,P_poll__networl_0_1_RP_1,P_poll__networl_1_2_AnsP_0,P_poll__networl_1_1_AI_1,P_network_1_2_AnnP_2,P_poll__networl_0_2_RP_2,P_network_1_1_AnnP_2,P_network_0_2_AI_2,P_poll__networl_0_1_AI_1,P_network_0_0_AnnP_2,P_network_2_2_AnnP_2,P_network_2_0_RP_2,P_poll__networl_1_1_RP_1,P_poll__networl_1_2_RI_0,P_poll__networl_2_0_AnsP_0,P_poll__networl_0_0_AI_2,P_poll__networl_2_1_RP_0,P_poll__networl_0_2_RI_2,P_poll__networl_0_2_RP_0,P_network_1_0_AnnP_2,P_poll__networl_2_2_AI_0,P_poll__networl_0_0_AI_0,P_poll__networl_0_1_AnsP_0,P_poll__networl_0_0_AskP_1,P_poll__networl_0_0_RI_1,P_network_1_1_AI_2,P_network_0_0_AI_2,P_network_1_1_RI_2,P_masterList_0_2_2,P_poll__networl_2_1_AnsP_0,P_poll__networl_0_1_RI_1,P_network_2_0_RP_1,P_network_1_1_RP_2,P_network_2_1_AnnP_1,P_masterList_0_2_1,P_network_1_2_AI_1,P_masterList_2_2_0,P_network_0_2_RI_1,P_network_0_1_AskP_1,P_poll__networl_2_2_AnnP_2,P_poll__networl_0_2_AI_1,P_poll__networl_1_2_RP_0,P_poll__networl_1_0_AskP_0,P_network_0_1_AskP_2,P_network_2_1_RI_2,P_poll__networl_1_2_RP_1,P_dead_0,P_network_1_2_RP_1,P_poll__networl_2_0_AnnP_1,P_masterList_1_2_1,P_poll__networl_0_0_AnnP_2,P_poll__networl_1_1_RI_1,P_poll__networl_2_2_RI_1,P_poll__networl_1_1_AskP_1,P_crashed_1,P_poll__networl_0_2_RI_1,P_poll__networl_1_1_AnnP_2,P_poll__networl_2_2_AI_2,P_poll__networl_1_0_AnsP_0,P_poll__networl_0_1_AskP_0,P_poll__networl_2_0_RI_0,P_poll__networl_0_1_AnnP_1,P_masterList_2_2_1,P_network_0_0_AI_1,P_network_0_1_AnnP_2,P_network_0_2_RP_2,P_poll__networl_1_0_RI_0,P_poll__networl_0_1_AskP_1,P_network_2_2_AI_1,P_poll__networl_1_2_AI_0,P_poll__networl_0_2_RP_1,P_poll__networl_1_0_AskP_1,P_network_0_0_AskP_2,P_network_2_0_AI_1,P_poll__networl_2_1_RI_1,P_network_1_2_AI_2,P_poll__networl_2_0_AskP_0,P_poll__networl_1_1_AI_2,P_network_1_2_AnnP_1,P_masterList_0_2_0,P_poll__networl_1_2_AnnP_1,P_network_1_2_RI_1,P_poll__networl_2_2_AnnP_0,P_network_2_1_AnnP_2,P_poll__networl_0_2_AI_2,P_poll__networl_2_1_AskP_1,P_crashed_2,P_poll__networl_2_2_AnnP_1,P_poll__networl_2_2_RP_2,P_network_2_0_AskP_1,P_poll__networl_0_1_RP_2,P_network_2_2_RP_2,P_network_2_2_AI_2,P_poll__networl_2_1_AnnP_1,P_poll__networl_2_1_RP_2,P_poll__networl_2_1_AskP_2,P_network_1_1_RP_1,P_poll__networl_2_0_AI_2,P_poll__networl_1_1_AskP_0,P_poll__networl_1_1_RP_2,P_poll__networl_0_0_AnnP_0,P_poll__networl_1_0_AnnP_1,
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 261 fixed domain variables (out of 438 variables) in GAL type NeoElection_PT_2
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 261 constant array cells/variables (out of 438 variables) in type NeoElection_PT_2
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_poll__networl_2_0_AskP_1,P_masterList_2_1_2,P_network_2_0_AI_2,P_poll__networl_1_2_AskP_2,P_poll__networl_2_0_RP_1,P_network_0_2_RI_2,P_poll__networl_1_2_RP_2,P_network_1_0_RP_1,P_poll__networl_0_0_RP_1,P_poll__networl_2_1_AnnP_0,P_poll__networl_0_1_AnnP_0,P_poll__networl_2_1_AskP_0,P_poll__networl_1_2_RI_2,P_masterList_0_1_1,P_poll__networl_0_1_AnnP_2,P_network_2_2_AnnP_1,P_masterList_1_1_2,P_poll__networl_1_2_AskP_1,P_poll__networl_1_1_AnsP_0,P_masterList_2_2_2,P_poll__networl_2_0_RI_2,P_network_0_1_AnnP_1,P_poll__networl_0_1_RP_0,P_poll__networl_2_2_RI_2,P_poll__networl_0_0_AskP_2,P_poll__networl_0_1_AskP_2,P_poll__networl_2_1_AI_0,P_network_1_0_AI_2,P_masterList_1_2_2,P_poll__networl_1_0_AI_2,P_network_2_1_AskP_2,P_network_0_0_RI_1,P_network_0_2_AI_1,P_network_0_2_RP_1,P_network_1_1_RI_1,P_network_0_1_AI_1,P_poll__networl_0_2_AnsP_0,P_network_0_2_AnnP_2,P_poll__networl_2_1_AI_2,P_dead_2,P_poll__networl_1_0_AskP_2,P_network_1_0_AI_1,P_masterList_0_1_2,P_poll__networl_2_1_AI_1,P_poll__networl_2_2_RI_0,P_dead_1,P_poll__networl_0_2_AnnP_2,P_poll__networl_2_0_AnnP_2,P_poll__networl_2_0_AI_1,P_poll__networl_0_0_AnsP_0,P_poll__networl_0_2_AskP_0,P_network_2_0_RI_1,P_poll__networl_0_0_RP_2,P_network_0_1_RP_1,P_poll__networl_0_1_AI_2,P_poll__networl_0_1_RI_0,P_poll__networl_2_0_AskP_2,P_network_1_1_AnnP_1,P_network_1_2_RP_2,P_poll__networl_2_1_AnnP_2,P_poll__networl_2_0_RI_1,P_network_1_1_AskP_2,P_poll__networl_0_2_AnnP_1,P_poll__networl_0_1_AI_0,P_network_1_2_AskP_1,P_masterList_1_2_0,P_masterList_1_1_0,P_poll__networl_0_0_AnnP_1,P_poll__networl_2_1_RP_1,P_network_2_1_AI_2,P_poll__networl_1_2_AskP_0,P_poll__networl_1_2_AI_2,P_network_1_1_AskP_1,P_poll__networl_2_0_RP_0,P_poll__networl_1_0_AnnP_0,P_poll__networl_1_1_RP_0,P_poll__networl_1_1_AnnP_0,P_poll__networl_2_2_AnsP_0,P_network_1_0_RI_1,P_poll__networl_1_2_AI_1,P_poll__networl_2_1_RI_0,P_poll__networl_1_1_AnnP_1,P_network_0_1_RP_2,P_poll__networl_1_0_AI_0,P_network_0_0_RP_1,P_network_2_2_RP_1,P_network_2_1_RP_2,P_poll__networl_0_2_AI_0,P_electionFailed_2,P_poll__networl_0_0_AskP_0,P_poll__networl_2_0_AI_0,P_poll__networl_0_0_RP_0,P_network_2_1_RP_1,P_network_1_0_RP_2,P_network_2_2_AskP_2,P_poll__networl_0_2_AskP_2,P_poll__networl_1_0_RP_1,P_poll__networl_0_2_RI_0,P_poll__networl_1_1_AI_0,P_poll__networl_2_2_AskP_0,P_network_2_2_RI_1,P_network_2_0_AnnP_2,P_network_0_0_AnnP_1,P_network_1_0_AskP_1,P_poll__networl_1_2_RI_1,P_electionFailed_1,P_poll__networl_1_2_AnnP_0,P_network_0_1_RI_2,P_poll__networl_1_0_AnnP_2,P_network_0_2_AskP_1,P_poll__networl_2_2_AskP_1,P_network_1_2_RI_2,P_poll__networl_1_0_RP_0,P_poll__networl_2_0_AnnP_0,P_network_1_2_AskP_2,P_poll__networl_0_0_RI_0,P_poll__networl_0_2_AnnP_0,P_network_2_0_AskP_2,P_poll__networl_0_2_AskP_1,P_poll__networl_1_1_RI_2,P_poll__networl_1_0_RI_2,P_network_2_0_AnnP_1,P_network_0_0_RP_2,P_network_1_0_AskP_2,P_network_1_0_AnnP_1,P_poll__networl_1_1_RI_0,P_poll__networl_2_1_RI_2,P_network_0_2_AnnP_1,P_poll__networl_1_0_AI_1,P_poll__networl_2_2_AskP_2,P_network_2_1_AI_1,P_poll__networl_0_0_AI_1,P_poll__networl_2_0_RP_2,P_poll__networl_1_2_AnnP_2,P_network_1_0_RI_2,P_poll__networl_1_0_RP_2,P_crashed_0,P_network_2_2_RI_2,P_poll__networl_1_1_AskP_2,P_network_2_0_RI_2,P_network_1_1_AI_1,P_network_0_1_RI_1,P_poll__networl_2_2_AI_1,P_poll__networl_2_2_RP_0,P_masterList_0_1_0,P_network_0_0_AskP_1,P_poll__networl_1_0_RI_1,P_network_0_0_RI_2,P_masterList_1_1_1,P_network_0_1_AI_2,P_network_0_2_AskP_2,P_poll__networl_0_0_RI_2,P_poll__networl_0_1_RI_2,P_poll__networl_2_2_RP_1,P_network_2_1_RI_1,P_network_2_1_AskP_1,P_network_2_2_AskP_1,P_electionFailed_0,P_poll__networl_0_1_RP_1,P_poll__networl_1_2_AnsP_0,P_poll__networl_1_1_AI_1,P_network_1_2_AnnP_2,P_poll__networl_0_2_RP_2,P_network_1_1_AnnP_2,P_network_0_2_AI_2,P_poll__networl_0_1_AI_1,P_network_0_0_AnnP_2,P_network_2_2_AnnP_2,P_network_2_0_RP_2,P_poll__networl_1_1_RP_1,P_poll__networl_1_2_RI_0,P_poll__networl_2_0_AnsP_0,P_poll__networl_0_0_AI_2,P_poll__networl_2_1_RP_0,P_poll__networl_0_2_RI_2,P_poll__networl_0_2_RP_0,P_network_1_0_AnnP_2,P_poll__networl_2_2_AI_0,P_masterList_2_1_0,P_poll__networl_0_0_AI_0,P_poll__networl_0_1_AnsP_0,P_poll__networl_0_0_AskP_1,P_poll__networl_0_0_RI_1,P_network_1_1_AI_2,P_network_0_0_AI_2,P_network_1_1_RI_2,P_masterList_0_2_2,P_poll__networl_2_1_AnsP_0,P_poll__networl_0_1_RI_1,P_network_2_0_RP_1,P_network_1_1_RP_2,P_network_2_1_AnnP_1,P_masterList_0_2_1,P_network_1_2_AI_1,P_masterList_2_2_0,P_network_0_2_RI_1,P_network_0_1_AskP_1,P_poll__networl_2_2_AnnP_2,P_masterList_2_1_1,P_poll__networl_0_2_AI_1,P_poll__networl_1_2_RP_0,P_poll__networl_1_0_AskP_0,P_network_0_1_AskP_2,P_network_2_1_RI_2,P_poll__networl_1_2_RP_1,P_dead_0,P_network_1_2_RP_1,P_poll__networl_2_0_AnnP_1,P_masterList_1_2_1,P_poll__networl_0_0_AnnP_2,P_poll__networl_1_1_RI_1,P_poll__networl_2_2_RI_1,P_poll__networl_1_1_AskP_1,P_crashed_1,P_poll__networl_0_2_RI_1,P_poll__networl_1_1_AnnP_2,P_poll__networl_2_2_AI_2,P_poll__networl_1_0_AnsP_0,P_poll__networl_0_1_AskP_0,P_poll__networl_2_0_RI_0,P_poll__networl_0_1_AnnP_1,P_masterList_2_2_1,P_network_0_0_AI_1,P_network_0_1_AnnP_2,P_network_0_2_RP_2,P_poll__networl_1_0_RI_0,P_poll__networl_0_1_AskP_1,P_network_2_2_AI_1,P_poll__networl_1_2_AI_0,P_poll__networl_0_2_RP_1,P_poll__networl_1_0_AskP_1,P_network_0_0_AskP_2,P_network_2_0_AI_1,P_poll__networl_2_1_RI_1,P_network_1_2_AI_2,P_poll__networl_2_0_AskP_0,P_poll__networl_1_1_AI_2,P_network_1_2_AnnP_1,P_masterList_0_2_0,P_poll__networl_1_2_AnnP_1,P_network_1_2_RI_1,P_poll__networl_2_2_AnnP_0,P_network_2_1_AnnP_2,P_poll__networl_0_2_AI_2,P_poll__networl_2_1_AskP_1,P_crashed_2,P_poll__networl_2_2_AnnP_1,P_poll__networl_2_2_RP_2,P_network_2_0_AskP_1,P_poll__networl_0_1_RP_2,P_network_2_2_RP_2,P_network_2_2_AI_2,P_poll__networl_2_1_AnnP_1,P_poll__networl_2_1_RP_2,P_poll__networl_2_1_AskP_2,P_network_1_1_RP_1,P_poll__networl_2_0_AI_2,P_poll__networl_1_1_AskP_0,P_poll__networl_1_1_RP_2,P_poll__networl_0_0_AnnP_0,P_poll__networl_1_0_AnnP_1,
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 261 constant variables :P_poll__networl_2_0_AskP_1=0, P_masterList_2_1_2=0, P_network_2_0_AI_2=0, P_poll__networl_1_2_AskP_2=0, P_poll__networl_2_0_RP_1=0, P_network_0_2_RI_2=0, P_poll__networl_1_2_RP_2=0, P_network_1_0_RP_1=0, P_poll__networl_0_0_RP_1=0, P_poll__networl_2_1_AnnP_0=0, P_poll__networl_0_1_AnnP_0=0, P_poll__networl_2_1_AskP_0=0, P_poll__networl_1_2_RI_2=0, P_masterList_0_1_1=0, P_poll__networl_0_1_AnnP_2=0, P_network_2_2_AnnP_1=0, P_masterList_1_1_2=1, P_poll__networl_1_2_AskP_1=0, P_poll__networl_1_1_AnsP_0=0, P_masterList_2_2_2=0, P_poll__networl_2_0_RI_2=0, P_network_0_1_AnnP_1=0, P_poll__networl_0_1_RP_0=0, P_poll__networl_2_2_RI_2=0, P_poll__networl_0_0_AskP_2=0, P_poll__networl_0_1_AskP_2=0, P_poll__networl_2_1_AI_0=0, P_network_1_0_AI_2=0, P_masterList_1_2_2=0, P_poll__networl_1_0_AI_2=0, P_network_2_1_AskP_2=0, P_network_0_0_RI_1=0, P_network_0_2_AI_1=0, P_network_0_2_RP_1=0, P_network_1_1_RI_1=0, P_network_0_1_AI_1=0, P_poll__networl_0_2_AnsP_0=0, P_network_0_2_AnnP_2=0, P_poll__networl_2_1_AI_2=0, P_dead_2=0, P_poll__networl_1_0_AskP_2=0, P_network_1_0_AI_1=0, P_masterList_0_1_2=0, P_poll__networl_2_1_AI_1=0, P_poll__networl_2_2_RI_0=0, P_dead_1=0, P_poll__networl_0_2_AnnP_2=0, P_poll__networl_2_0_AnnP_2=0, P_poll__networl_2_0_AI_1=0, P_poll__networl_0_0_AnsP_0=0, P_poll__networl_0_2_AskP_0=0, P_network_2_0_RI_1=0, P_poll__networl_0_0_RP_2=0, P_network_0_1_RP_1=0, P_poll__networl_0_1_AI_2=0, P_poll__networl_0_1_RI_0=0, P_poll__networl_2_0_AskP_2=0, P_network_1_1_AnnP_1=0, P_network_1_2_RP_2=0, P_poll__networl_2_1_AnnP_2=0, P_poll__networl_2_0_RI_1=0, P_network_1_1_AskP_2=0, P_poll__networl_0_2_AnnP_1=0, P_poll__networl_0_1_AI_0=0, P_network_1_2_AskP_1=0, P_masterList_1_2_0=0, P_masterList_1_1_0=0, P_poll__networl_0_0_AnnP_1=0, P_poll__networl_2_1_RP_1=0, P_network_2_1_AI_2=0, P_poll__networl_1_2_AskP_0=0, P_poll__networl_1_2_AI_2=0, P_network_1_1_AskP_1=0, P_poll__networl_2_0_RP_0=0, P_poll__networl_1_0_AnnP_0=0, P_poll__networl_1_1_RP_0=0, P_poll__networl_1_1_AnnP_0=0, P_poll__networl_2_2_AnsP_0=0, P_network_1_0_RI_1=0, P_poll__networl_1_2_AI_1=0, P_poll__networl_2_1_RI_0=0, P_poll__networl_1_1_AnnP_1=0, P_network_0_1_RP_2=0, P_poll__networl_1_0_AI_0=0, P_network_0_0_RP_1=0, P_network_2_2_RP_1=0, P_network_2_1_RP_2=0, P_poll__networl_0_2_AI_0=0, P_electionFailed_2=0, P_poll__networl_0_0_AskP_0=0, P_poll__networl_2_0_AI_0=0, P_poll__networl_0_0_RP_0=0, P_network_2_1_RP_1=0, P_network_1_0_RP_2=0, P_network_2_2_AskP_2=0, P_poll__networl_0_2_AskP_2=0, P_poll__networl_1_0_RP_1=0, P_poll__networl_0_2_RI_0=0, P_poll__networl_1_1_AI_0=0, P_poll__networl_2_2_AskP_0=0, P_network_2_2_RI_1=0, P_network_2_0_AnnP_2=0, P_network_0_0_AnnP_1=0, P_network_1_0_AskP_1=0, P_poll__networl_1_2_RI_1=0, P_electionFailed_1=0, P_poll__networl_1_2_AnnP_0=0, P_network_0_1_RI_2=0, P_poll__networl_1_0_AnnP_2=0, P_network_0_2_AskP_1=0, P_poll__networl_2_2_AskP_1=0, P_network_1_2_RI_2=0, P_poll__networl_1_0_RP_0=0, P_poll__networl_2_0_AnnP_0=0, P_network_1_2_AskP_2=0, P_poll__networl_0_0_RI_0=0, P_poll__networl_0_2_AnnP_0=0, P_network_2_0_AskP_2=0, P_poll__networl_0_2_AskP_1=0, P_poll__networl_1_1_RI_2=0, P_poll__networl_1_0_RI_2=0, P_network_2_0_AnnP_1=0, P_network_0_0_RP_2=0, P_network_1_0_AskP_2=0, P_network_1_0_AnnP_1=0, P_poll__networl_1_1_RI_0=0, P_poll__networl_2_1_RI_2=0, P_network_0_2_AnnP_1=0, P_poll__networl_1_0_AI_1=0, P_poll__networl_2_2_AskP_2=0, P_network_2_1_AI_1=0, P_poll__networl_0_0_AI_1=0, P_poll__networl_2_0_RP_2=0, P_poll__networl_1_2_AnnP_2=0, P_network_1_0_RI_2=0, P_poll__networl_1_0_RP_2=0, P_crashed_0=0, P_network_2_2_RI_2=0, P_poll__networl_1_1_AskP_2=0, P_network_2_0_RI_2=0, P_network_1_1_AI_1=0, P_network_0_1_RI_1=0, P_poll__networl_2_2_AI_1=0, P_poll__networl_2_2_RP_0=0, P_masterList_0_1_0=0, P_network_0_0_AskP_1=0, P_poll__networl_1_0_RI_1=0, P_network_0_0_RI_2=0, P_masterList_1_1_1=0, P_network_0_1_AI_2=0, P_network_0_2_AskP_2=0, P_poll__networl_0_0_RI_2=0, P_poll__networl_0_1_RI_2=0, P_poll__networl_2_2_RP_1=0, P_network_2_1_RI_1=0, P_network_2_1_AskP_1=0, P_network_2_2_AskP_1=0, P_electionFailed_0=0, P_poll__networl_0_1_RP_1=0, P_poll__networl_1_2_AnsP_0=0, P_poll__networl_1_1_AI_1=0, P_network_1_2_AnnP_2=0, P_poll__networl_0_2_RP_2=0, P_network_1_1_AnnP_2=0, P_network_0_2_AI_2=0, P_poll__networl_0_1_AI_1=0, P_network_0_0_AnnP_2=0, P_network_2_2_AnnP_2=0, P_network_2_0_RP_2=0, P_poll__networl_1_1_RP_1=0, P_poll__networl_1_2_RI_0=0, P_poll__networl_2_0_AnsP_0=0, P_poll__networl_0_0_AI_2=0, P_poll__networl_2_1_RP_0=0, P_poll__networl_0_2_RI_2=0, P_poll__networl_0_2_RP_0=0, P_network_1_0_AnnP_2=0, P_poll__networl_2_2_AI_0=0, P_masterList_2_1_0=0, P_poll__networl_0_0_AI_0=0, P_poll__networl_0_1_AnsP_0=0, P_poll__networl_0_0_AskP_1=0, P_poll__networl_0_0_RI_1=0, P_network_1_1_AI_2=0, P_network_0_0_AI_2=0, P_network_1_1_RI_2=0, P_masterList_0_2_2=0, P_poll__networl_2_1_AnsP_0=0, P_poll__networl_0_1_RI_1=0, P_network_2_0_RP_1=0, P_network_1_1_RP_2=0, P_network_2_1_AnnP_1=0, P_masterList_0_2_1=0, P_network_1_2_AI_1=0, P_masterList_2_2_0=0, P_network_0_2_RI_1=0, P_network_0_1_AskP_1=0, P_poll__networl_2_2_AnnP_2=0, P_masterList_2_1_1=1, P_poll__networl_0_2_AI_1=0, P_poll__networl_1_2_RP_0=0, P_poll__networl_1_0_AskP_0=0, P_network_0_1_AskP_2=0, P_network_2_1_RI_2=0, P_poll__networl_1_2_RP_1=0, P_dead_0=0, P_network_1_2_RP_1=0, P_poll__networl_2_0_AnnP_1=0, P_masterList_1_2_1=0, P_poll__networl_0_0_AnnP_2=0, P_poll__networl_1_1_RI_1=0, P_poll__networl_2_2_RI_1=0, P_poll__networl_1_1_AskP_1=0, P_crashed_1=0, P_poll__networl_0_2_RI_1=0, P_poll__networl_1_1_AnnP_2=0, P_poll__networl_2_2_AI_2=0, P_poll__networl_1_0_AnsP_0=0, P_poll__networl_0_1_AskP_0=0, P_poll__networl_2_0_RI_0=0, P_poll__networl_0_1_AnnP_1=0, P_masterList_2_2_1=0, P_network_0_0_AI_1=0, P_network_0_1_AnnP_2=0, P_network_0_2_RP_2=0, P_poll__networl_1_0_RI_0=0, P_poll__networl_0_1_AskP_1=0, P_network_2_2_AI_1=0, P_poll__networl_1_2_AI_0=0, P_poll__networl_0_2_RP_1=0, P_poll__networl_1_0_AskP_1=0, P_network_0_0_AskP_2=0, P_network_2_0_AI_1=0, P_poll__networl_2_1_RI_1=0, P_network_1_2_AI_2=0, P_poll__networl_2_0_AskP_0=0, P_poll__networl_1_1_AI_2=0, P_network_1_2_AnnP_1=0, P_masterList_0_2_0=0, P_poll__networl_1_2_AnnP_1=0, P_network_1_2_RI_1=0, P_poll__networl_2_2_AnnP_0=0, P_network_2_1_AnnP_2=0, P_poll__networl_0_2_AI_2=0, P_poll__networl_2_1_AskP_1=0, P_crashed_2=0, P_poll__networl_2_2_AnnP_1=0, P_poll__networl_2_2_RP_2=0, P_network_2_0_AskP_1=0, P_poll__networl_0_1_RP_2=0, P_network_2_2_RP_2=0, P_network_2_2_AI_2=0, P_poll__networl_2_1_AnnP_1=0, P_poll__networl_2_1_RP_2=0, P_poll__networl_2_1_AskP_2=0, P_network_1_1_RP_1=0, P_poll__networl_2_0_AI_2=0, P_poll__networl_1_1_AskP_0=0, P_poll__networl_1_1_RP_2=0, P_poll__networl_0_0_AnnP_0=0, P_poll__networl_1_0_AnnP_1=0
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 348 expressions due to constant valuations.
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier simplifyFalseTransitions
INFO: Removed 14 false transitions.
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 7 fixed domain variables (out of 177 variables) in GAL type NeoElection_PT_2_flat
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 188 ms
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 7 fixed domain variables (out of 177 variables) in GAL type NeoElection_PT_2_flat
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 7 constant array cells/variables (out of 177 variables) in type NeoElection_PT_2_flat
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_negotiation_1_0_NONE,P_negotiation_2_0_NONE,P_negotiation_0_2_NONE,P_negotiation_0_1_NONE,P_negotiation_1_1_NONE,P_negotiation_2_2_NONE,P_negotiation_0_0_NONE,
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 7 fixed domain variables (out of 177 variables) in GAL type NeoElection_PT_2_flat
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 7 constant array cells/variables (out of 177 variables) in type NeoElection_PT_2_flat
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_negotiation_1_0_NONE,P_negotiation_2_0_NONE,P_negotiation_0_2_NONE,P_negotiation_0_1_NONE,P_negotiation_1_1_NONE,P_negotiation_2_2_NONE,P_negotiation_0_0_NONE,
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 7 constant variables :P_negotiation_1_0_NONE=0, P_negotiation_2_0_NONE=0, P_negotiation_0_2_NONE=0, P_negotiation_0_1_NONE=0, P_negotiation_1_1_NONE=0, P_negotiation_2_2_NONE=0, P_negotiation_0_0_NONE=0
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 117 ms
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 343 transitions.
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 343 transitions.
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 170 places.
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 343 transitions.
Mar 26, 2019 11:00:38 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
Mar 26, 2019 11:00:38 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Mar 26, 2019 11:00:38 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 32 place invariants in 50 ms
Mar 26, 2019 11:00:40 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 177 variables to be positive in 1814 ms
Mar 26, 2019 11:00:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 343 transitions.
Mar 26, 2019 11:00:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/343 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 11:00:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 82 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 11:00:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 343 transitions.
Mar 26, 2019 11:00:40 PM 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)
Mar 26, 2019 11:00:41 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 343 transitions.
Mar 26, 2019 11:00:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(45/343) took 1972 ms. Total solver calls (SAT/UNSAT): 4888(1270/3618)
Mar 26, 2019 11:00:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(125/343) took 4992 ms. Total solver calls (SAT/UNSAT): 11643(2797/8846)
Mar 26, 2019 11:00:49 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(230/343) took 7998 ms. Total solver calls (SAT/UNSAT): 17184(4273/12911)
Mar 26, 2019 11:00:51 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 10034 ms. Total solver calls (SAT/UNSAT): 18961(5110/13851)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 26, 2019 11:00:51 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 13518ms 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="NeoElection-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsm"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstoolsm"
echo " Input is NeoElection-PT-2, 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 r197-oct2-155272230300186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-2.tgz
mv NeoElection-PT-2 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 '
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 ;