About the Execution of ITS-Tools for Raft-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.590 | 6655.00 | 14620.00 | 188.00 | FFFFFFFFTFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r141-smll-158961510700225.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Raft-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510700225
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.1K Apr 12 07:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 07:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 24K Mar 24 05:38 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 Raft-PT-03-00
FORMULA_NAME Raft-PT-03-01
FORMULA_NAME Raft-PT-03-02
FORMULA_NAME Raft-PT-03-03
FORMULA_NAME Raft-PT-03-04
FORMULA_NAME Raft-PT-03-05
FORMULA_NAME Raft-PT-03-06
FORMULA_NAME Raft-PT-03-07
FORMULA_NAME Raft-PT-03-08
FORMULA_NAME Raft-PT-03-09
FORMULA_NAME Raft-PT-03-10
FORMULA_NAME Raft-PT-03-11
FORMULA_NAME Raft-PT-03-12
FORMULA_NAME Raft-PT-03-13
FORMULA_NAME Raft-PT-03-14
FORMULA_NAME Raft-PT-03-15
=== Now, execution of the tool begins
BK_START 1590053486393
[2020-05-21 09:31:29] [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, -timeout, 3600]
[2020-05-21 09:31:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 09:31:29] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2020-05-21 09:31:29] [INFO ] Transformed 53 places.
[2020-05-21 09:31:29] [INFO ] Transformed 98 transitions.
[2020-05-21 09:31:29] [INFO ] Found NUPN structural information;
[2020-05-21 09:31:29] [INFO ] Parsed PT model containing 53 places and 98 transitions in 179 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 433 ms. (steps per millisecond=230 ) properties seen :[1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1]
[2020-05-21 09:31:29] [INFO ] Flow matrix only has 73 transitions (discarded 11 similar events)
// Phase 1: matrix 73 rows 53 cols
[2020-05-21 09:31:30] [INFO ] Computed 9 place invariants in 7 ms
[2020-05-21 09:31:30] [INFO ] [Real]Absence check using 9 positive place invariants in 26 ms returned sat
[2020-05-21 09:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:30] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-05-21 09:31:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned unsat
[2020-05-21 09:31:30] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-21 09:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:30] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-05-21 09:31:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned unsat
[2020-05-21 09:31:30] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2020-05-21 09:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:30] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-05-21 09:31:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned unsat
[2020-05-21 09:31:30] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-21 09:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:31:30] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-05-21 09:31:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:31:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-05-21 09:31:31] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-21 09:31:31] [INFO ] Flatten gal took : 58 ms
FORMULA Raft-PT-03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 09:31:31] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 09:31:31] [INFO ] Applying decomposition
[2020-05-21 09:31:31] [INFO ] Flatten gal took : 16 ms
[2020-05-21 09:31:31] [INFO ] Input system was already deterministic with 84 transitions.
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/graph853336619922150917.txt, -o, /tmp/graph853336619922150917.bin, -w, /tmp/graph853336619922150917.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/graph853336619922150917.bin, -l, -1, -v, -w, /tmp/graph853336619922150917.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 09:31:31] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 73 out of 84 initially.
// Phase 1: matrix 73 rows 53 cols
[2020-05-21 09:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 09:31:31] [INFO ] Computed 9 place invariants in 4 ms
inv : p0 + p21 + p22 + p23 + p24 + p25 = 1
inv : p0 + p11 + p12 + p13 + p14 + p15 = 1
inv : p0 + p41 + p42 + p43 + p44 + p45 = 1
inv : p0 + p16 + p17 + p18 + p19 + p20 = 1
inv : p0 + p26 + p27 + p28 + p29 + p30 = 1
inv : p0 + p36 + p37 + p38 + p39 + p40 = 1
inv : p0 + p6 + p7 + p8 + p9 + p10 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p31 + p32 + p33 + p34 + p35 = 1
Total of 9 invariants.
[2020-05-21 09:31:31] [INFO ] Computed 9 place invariants in 9 ms
[2020-05-21 09:31:31] [INFO ] Removed a total of 52 redundant transitions.
[2020-05-21 09:31:31] [INFO ] Flatten gal took : 59 ms
[2020-05-21 09:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 11 ms.
[2020-05-21 09:31:31] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2020-05-21 09:31:31] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 9 LTL properties
Checking formula 0 : !((F(G("(((u9.p49==0)||(u9.p49==1))&&((i2.u7.p37==0)||(u3.p17==1)))"))))
Formula 0 simplified : !FG"(((u9.p49==0)||(u9.p49==1))&&((i2.u7.p37==0)||(u3.p17==1)))"
built 16 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.u6.t18, i0.u6.t19, i0.u6.t20, i0.u6.t22, i1.u8.t6, i1.u8.t7, i1.u8.t8, i1.u8.t10, i2.u7.t12, i2.u7.t13, i2.u7.t14, i2.u7.t16, i7.t97, i7.u11.t95, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/49/14/63
[2020-05-21 09:31:31] [INFO ] Proved 53 variables to be positive in 235 ms
[2020-05-21 09:31:31] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2020-05-21 09:31:31] [INFO ] Computation of disable matrix completed :0/84 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:31:31] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:31:31] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2020-05-21 09:31:31] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.116746,18788,1,0,5284,179,740,9786,187,916,11003
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(X(F(!(F(X("((i0.u6.p33==0)||(i7.u10.p47==1))")))))))))
Formula 1 simplified : !XGXF!FX"((i0.u6.p33==0)||(i7.u10.p47==1))"
4 unique states visited
3 strongly connected components in search stack
6 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.131686,19740,1,0,5852,179,832,11356,189,969,12838
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(G("((i0.u6.p32==0)||(i7.u10.p47==1))")))||(G(F(X("((u3.p17==0)||(i2.u2.p14==1))"))))))
Formula 2 simplified : !(FG"((i0.u6.p32==0)||(i7.u10.p47==1))" | GFX"((u3.p17==0)||(i2.u2.p14==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.177489,21136,1,0,8795,179,880,17521,190,1001,17975
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F(!(F(!(G("((i2.u2.p11==0)||(i2.u2.p12==1))"))))))))
Formula 3 simplified : F!F!G"((i2.u2.p11==0)||(i2.u2.p12==1))"
4 unique states visited
4 strongly connected components in search stack
5 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.183079,21444,1,0,9040,179,915,18087,195,1009,18572
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G("((((i1.u8.p41==0)||(i2.u2.p12==1))||(u5.p30==0))||(i0.u0.p1==1))"))))
Formula 4 simplified : !XG"((((i1.u8.p41==0)||(i2.u2.p12==1))||(u5.p30==0))||(i0.u0.p1==1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.268159,24064,1,0,14298,179,942,27358,195,1028,25345
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-03-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(X("(u9.p46==1)")))))
Formula 5 simplified : !FXX"(u9.p46==1)"
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.269289,24064,1,0,14303,179,958,27368,195,1028,25415
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((X("((u4.p24==0)||(i2.u7.p37==1))"))||(F("((u4.p24==0)||(i2.u7.p37==1))")))))
Formula 6 simplified : !G(X"((u4.p24==0)||(i2.u7.p37==1))" | F"((u4.p24==0)||(i2.u7.p37==1))")
4 unique states visited
4 strongly connected components in search stack
5 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.273147,24304,1,0,14536,179,994,27731,196,1032,25820
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-03-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(F("((u3.p19==0)||(i1.u8.p42==1))")))))
Formula 7 simplified : !XXF"((u3.p19==0)||(i1.u8.p42==1))"
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.285047,24304,1,0,15292,179,1034,28765,196,1038,27553
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F(X(F("((u3.p19!=0)&&(i7.u10.p48!=1))"))))))
Formula 8 simplified : FXF"((u3.p19!=0)&&(i7.u10.p48!=1))"
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.307597,25092,1,0,16897,179,1060,31341,197,1055,31190
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 09:31:31] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 45) 1) (>= (select s0 46) 1)) (= (store (store s0 46 (- (select s0 46) 1)) 49 (+ (select s0 49) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 45) 1) (>= (select s0 46) 1)) (= (store (store s0 46 (- (select s0 46) 1)) 49 (+ (select s0 49) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java: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-21 09:31:31] [INFO ] Built C files in 695ms 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 1590053493048
--------------------
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 -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 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 -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="Raft-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Raft-PT-03, 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 r141-smll-158961510700225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-03.tgz
mv Raft-PT-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;