About the Execution of ITS-Tools for NeoElection-COL-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15739.600 | 5507.00 | 12962.00 | 119.70 | FTFTFTTTFFTTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257300218.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NeoElection-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257300218
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 4.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 69K Apr 30 13:04 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-COL-2-00
FORMULA_NAME NeoElection-COL-2-01
FORMULA_NAME NeoElection-COL-2-02
FORMULA_NAME NeoElection-COL-2-03
FORMULA_NAME NeoElection-COL-2-04
FORMULA_NAME NeoElection-COL-2-05
FORMULA_NAME NeoElection-COL-2-06
FORMULA_NAME NeoElection-COL-2-07
FORMULA_NAME NeoElection-COL-2-08
FORMULA_NAME NeoElection-COL-2-09
FORMULA_NAME NeoElection-COL-2-10
FORMULA_NAME NeoElection-COL-2-11
FORMULA_NAME NeoElection-COL-2-12
FORMULA_NAME NeoElection-COL-2-13
FORMULA_NAME NeoElection-COL-2-14
FORMULA_NAME NeoElection-COL-2-15
=== Now, execution of the tool begins
BK_START 1589841880640
[2020-05-18 22:44:43] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 22:44:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 22:44:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 22:44:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 990 ms
[2020-05-18 22:44:44] [INFO ] sort/places :
M * STAGE->P-stage,
M * POS->P-sendAnnPs__broadcasting,P-startNeg__broadcasting,
M * M * MT * M->P-network,P-poll__networl,
M * POS * M->P-masterList,
M * BOOL * M->P-masterState,
M * M * NEGSTEP->P-negotiation,
M->P-crashed,dead,P-electedPrimary,P-electedSecondary,P-electionFailed,P-electionInit,P-poll__handlingMessage,P-poll__pollEnd,P-poll__waitingMessage,P-polling,
[2020-05-18 22:44:44] [INFO ] Detected 4 constant HL places corresponding to 27 PT places.
[2020-05-18 22:44:44] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 438 PT places and 672.0 transition bindings in 30 ms.
[2020-05-18 22:44:44] [INFO ] Computed order based on color domains.
[2020-05-18 22:44:44] [INFO ] Unfolded HLPN to a Petri net with 438 places and 343 transitions in 51 ms.
[2020-05-18 22:44:44] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 403 places in 2 ms
Reduce places removed 405 places and 323 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 107 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 186 steps, including 5 resets, run visited all 13 properties in 4 ms. (steps per millisecond=46 )
[2020-05-18 22:44:44] [INFO ] Found a total of 5 fixed domain variables (out of 33 variables) in GAL type petri
[2020-05-18 22:44:44] [INFO ] Found a total of 5 constant array cells/variables (out of 33 variables) in type petri
[2020-05-18 22:44:44] [INFO ] P_stage_6,P_negotiation_26,P_masterState_15,P_stage_3,P_negotiation_14,
[2020-05-18 22:44:44] [INFO ] Removed 5 constant variables :P_stage_6=1, P_negotiation_26=1, P_masterState_15=1, P_stage_3=1, P_negotiation_14=1
[2020-05-18 22:44:44] [INFO ] Simplified 6 expressions due to constant valuations.
[2020-05-18 22:44:44] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-18 22:44:44] [INFO ] Flatten gal took : 43 ms
FORMULA NeoElection-COL-2-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 22:44:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 22:44:44] [INFO ] Flatten gal took : 8 ms
[2020-05-18 22:44:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-2-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-18 22:44:44] [INFO ] Applying decomposition
[2020-05-18 22:44:44] [INFO ] Flatten gal took : 6 ms
Built C files in :
/home/mcc/execution
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph6656808695479537586.txt, -o, /tmp/graph6656808695479537586.bin, -w, /tmp/graph6656808695479537586.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph6656808695479537586.bin, -l, -1, -v, -w, /tmp/graph6656808695479537586.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 22:44:45] [INFO ] Input system was already deterministic with 20 transitions.
[2020-05-18 22:44:45] [INFO ] Decomposing Gal with order
[2020-05-18 22:44:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 22:44:45] [INFO ] Removed a total of 8 redundant transitions.
[2020-05-18 22:44:45] [INFO ] Flatten gal took : 55 ms
[2020-05-18 22:44:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2020-05-18 22:44:45] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-18 22:44:45] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 19 out of 20 initially.
// Phase 1: matrix 19 rows 28 cols
[2020-05-18 22:44:45] [INFO ] Computed 9 place invariants in 9 ms
inv : -P_electionInit_1 + P_negotiation_15 - P_startNeg__broadcasting_2 = 0
inv : P_electionInit_1 + P_negotiation_17 + P_network_93 + P_network_99 + P_network_126 + P_network_132 + P_startNeg__broadcasting_2 = 1
inv : -P_electionInit_2 + P_negotiation_21 - P_startNeg__broadcasting_4 = 0
inv : P_electionInit_2 + P_negotiation_23 + P_network_90 + P_network_96 + P_network_129 + P_network_135 + P_startNeg__broadcasting_4 = 1
inv : P_electionInit_2 + P_negotiation_22 + P_negotiation_23 + P_startNeg__broadcasting_4 = 1
inv : P_electionInit_1 + P_negotiation_16 + P_negotiation_17 + P_startNeg__broadcasting_2 = 1
inv : P_electionInit_2 + P_poll__handlingMessage_2 + P_poll__pollEnd_2 + P_polling_2 + P_startNeg__broadcasting_4 + P_startNeg__broadcasting_5 = 1
inv : P_masterState_6 + P_masterState_9 = 1
inv : P_electionInit_1 + P_poll__handlingMessage_1 + P_poll__pollEnd_1 + P_polling_1 + P_startNeg__broadcasting_2 + P_startNeg__broadcasting_3 = 1
Total of 9 invariants.
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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
[2020-05-18 22:44:45] [INFO ] Computed 9 place invariants in 12 ms
Read 6 LTL properties
Checking formula 0 : !((F(G(X(G(X(F("(((i1.u3.P_network_96>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i2.u5.P_network_132>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))"))))))))
Formula 0 simplified : !FGXGXF"(((i1.u3.P_network_96>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i2.u5.P_network_132>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))"
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i2.u7.T_poll__endm2, i2.u7.T_startNeg__endm2, i3.u6.T_poll__endm1, i3.u6.T_startNeg__endm1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/15/4/20
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
36 transitions explored
35 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.064905,17648,1,0,1749,225,467,3322,190,582,4615
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NeoElection-COL-2-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(X(F("((i2.u7.P_poll__pollEnd_2>=1)||(i3.u6.P_poll__pollEnd_1>=1))"))))))
Formula 1 simplified : !XFXF"((i2.u7.P_poll__pollEnd_2>=1)||(i3.u6.P_poll__pollEnd_1>=1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.066992,17648,1,0,1933,225,486,3549,190,591,5254
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X((F(!(X("(((i1.u3.P_network_96<1)||(i3.u6.P_poll__handlingMessage_1<1))&&((i2.u5.P_network_132<1)||(i2.u7.P_poll__handlingMessage_2<1)))"))))&&("(((i1.u3.P_network_96>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i2.u5.P_network_132>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))")))))
Formula 2 simplified : X("(((i1.u3.P_network_96>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i2.u5.P_network_132>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))" & F!X"(((i1.u3.P_network_96<1)||(i3.u6.P_poll__handlingMessage_1<1))&&((i2.u5.P_network_132<1)||(i2.u7.P_poll__handlingMessage_2<1)))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.06827,17972,1,0,1933,225,487,3549,190,591,5268
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X("(((i2.u2.P_network_93>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i1.u4.P_network_129>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))"))&&(F("((((i1.u1.P_negotiation_22>=1)&&(i1.u3.P_network_135>=1))&&(i2.u7.P_poll__handlingMessage_2>=1))&&(((i2.u2.P_network_93>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i1.u4.P_network_129>=1)&&(i2.u7.P_poll__handlingMessage_2>=1))))"))))
Formula 3 simplified : !(X"(((i2.u2.P_network_93>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i1.u4.P_network_129>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))" & F"((((i1.u1.P_negotiation_22>=1)&&(i1.u3.P_network_135>=1))&&(i2.u7.P_poll__handlingMessage_2>=1))&&(((i2.u2.P_network_93>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i1.u4.P_network_129>=1)&&(i2.u7.P_poll__handlingMessage_2>=1))))")
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
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.080331,18464,1,0,2999,226,520,5228,190,625,7391
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NeoElection-COL-2-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((X("(((i1.u1.P_negotiation_22>=1)&&(i1.u3.P_network_135>=1))&&(i2.u7.P_poll__handlingMessage_2>=1))"))||(G(F(!(G(F((F("(((((i3.u6.P_masterState_9>=1)&&(i1.u4.P_network_90>=1))&&(i3.u6.P_poll__handlingMessage_1>=1))||(((i3.u6.P_masterState_6>=1)&&(i1.u4.P_network_90>=1))&&(i3.u6.P_poll__handlingMessage_1>=1)))||((i2.u2.P_network_126>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))"))&&("(((((i3.u6.P_masterState_6>=1)&&(i3.u0.P_negotiation_16>=1))&&(i2.u5.P_network_99>=1))&&(i3.u6.P_poll__handlingMessage_1>=1))||((((i3.u6.P_masterState_9>=1)&&(i3.u0.P_negotiation_16>=1))&&(i2.u5.P_network_99>=1))&&(i3.u6.P_poll__handlingMessage_1>=1)))"))))))))))
Formula 4 simplified : !F(X"(((i1.u1.P_negotiation_22>=1)&&(i1.u3.P_network_135>=1))&&(i2.u7.P_poll__handlingMessage_2>=1))" | GF!GF("(((((i3.u6.P_masterState_6>=1)&&(i3.u0.P_negotiation_16>=1))&&(i2.u5.P_network_99>=1))&&(i3.u6.P_poll__handlingMessage_1>=1))||((((i3.u6.P_masterState_9>=1)&&(i3.u0.P_negotiation_16>=1))&&(i2.u5.P_network_99>=1))&&(i3.u6.P_poll__handlingMessage_1>=1)))" & F"(((((i3.u6.P_masterState_9>=1)&&(i1.u4.P_network_90>=1))&&(i3.u6.P_poll__handlingMessage_1>=1))||(((i3.u6.P_masterState_6>=1)&&(i1.u4.P_network_90>=1))&&(i3.u6.P_poll__handlingMessage_1>=1)))||((i2.u2.P_network_126>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))"))
Computing Next relation with stutter on 1 deadlock states
87 unique states visited
0 strongly connected components in search stack
165 transitions explored
30 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,0.130484,20652,1,0,5981,226,678,9916,195,663,17859
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(("(((i1.u3.P_network_96>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i2.u5.P_network_132>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))")U(X("(((i1.u3.P_network_96<1)||(i3.u6.P_poll__handlingMessage_1<1))&&((i2.u5.P_network_132<1)||(i2.u7.P_poll__handlingMessage_2<1)))")))))
Formula 5 simplified : "(((i1.u3.P_network_96>=1)&&(i3.u6.P_poll__handlingMessage_1>=1))||((i2.u5.P_network_132>=1)&&(i2.u7.P_poll__handlingMessage_2>=1)))" U X"(((i1.u3.P_network_96<1)||(i3.u6.P_poll__handlingMessage_1<1))&&((i2.u5.P_network_132<1)||(i2.u7.P_poll__handlingMessage_2<1)))"
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,0.132399,20884,1,0,5981,226,703,9916,197,663,17890
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NeoElection-COL-2-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception :(error "Failed to assert expression: java.io.IOException: Broken pipe (tr16 0)")
java.lang.RuntimeException: SMT solver raised an exception :(error "Failed to assert expression: java.io.IOException: Broken pipe (tr16 0)")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.assertCouldModifyNext(KInductionSolver.java:225)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:90)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 22:44:45] [INFO ] Built C files in 363ms conformant to PINS in folder :/home/mcc/execution
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 1589841886147
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 LTLFireability -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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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-COL-2"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-2, 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 r111-csrt-158961257300218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-2.tgz
mv NeoElection-COL-2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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 [ "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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;