About the Execution of ITS-Tools for ResAllocation-PT-R002C002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.180 | 3535.00 | 7259.00 | 65.30 | FFFFTTTFFFFFFTFF | 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.r193-csrt-159033389100626.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 ResAllocation-PT-R002C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389100626
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.1K May 14 00:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 14 00:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 17:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 13 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 9.5K May 12 20:53 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 ResAllocation-PT-R002C002-00
FORMULA_NAME ResAllocation-PT-R002C002-01
FORMULA_NAME ResAllocation-PT-R002C002-02
FORMULA_NAME ResAllocation-PT-R002C002-03
FORMULA_NAME ResAllocation-PT-R002C002-04
FORMULA_NAME ResAllocation-PT-R002C002-05
FORMULA_NAME ResAllocation-PT-R002C002-06
FORMULA_NAME ResAllocation-PT-R002C002-07
FORMULA_NAME ResAllocation-PT-R002C002-08
FORMULA_NAME ResAllocation-PT-R002C002-09
FORMULA_NAME ResAllocation-PT-R002C002-10
FORMULA_NAME ResAllocation-PT-R002C002-11
FORMULA_NAME ResAllocation-PT-R002C002-12
FORMULA_NAME ResAllocation-PT-R002C002-13
FORMULA_NAME ResAllocation-PT-R002C002-14
FORMULA_NAME ResAllocation-PT-R002C002-15
=== Now, execution of the tool begins
BK_START 1590538700596
[2020-05-27 00:18:22] [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-27 00:18:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:18:22] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2020-05-27 00:18:22] [INFO ] Transformed 8 places.
[2020-05-27 00:18:22] [INFO ] Transformed 6 transitions.
[2020-05-27 00:18:22] [INFO ] Found NUPN structural information;
[2020-05-27 00:18:22] [INFO ] Parsed PT model containing 8 places and 6 transitions in 75 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 16809 resets, run finished after 134 ms. (steps per millisecond=746 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 6 rows 8 cols
[2020-05-27 00:18:23] [INFO ] Computed 4 place invariants in 2 ms
[2020-05-27 00:18:23] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 00:18:23] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-27 00:18:23] [INFO ] Flatten gal took : 36 ms
FORMULA ResAllocation-PT-R002C002-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R002C002-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R002C002-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R002C002-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R002C002-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:18:23] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:18:23] [INFO ] Applying decomposition
[2020-05-27 00:18:23] [INFO ] Flatten gal took : 17 ms
[2020-05-27 00:18:23] [INFO ] Input system was already deterministic with 6 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/graph7147381981997443635.txt, -o, /tmp/graph7147381981997443635.bin, -w, /tmp/graph7147381981997443635.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/graph7147381981997443635.bin, -l, -1, -v, -w, /tmp/graph7147381981997443635.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 6 rows 8 cols
[2020-05-27 00:18:23] [INFO ] Computed 4 place invariants in 0 ms
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_1_0 + r_1_0 = 1
inv : p_1_1 + r_1_1 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
Total of 4 invariants.
[2020-05-27 00:18:23] [INFO ] Computed 4 place invariants in 1 ms
[2020-05-27 00:18:23] [INFO ] Decomposing Gal with order
[2020-05-27 00:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 00:18:23] [INFO ] Proved 8 variables to be positive in 139 ms
[2020-05-27 00:18:23] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2020-05-27 00:18:23] [INFO ] Computation of disable matrix completed :0/6 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:18:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:18:23] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2020-05-27 00:18:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:18:23] [INFO ] Flatten gal took : 89 ms
[2020-05-27 00:18:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-27 00:18:23] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-27 00:18:23] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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]
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
Read 11 LTL properties
Checking formula 0 : !((F(X("(u2.p_1_0==1)"))))
Formula 0 simplified : !FX"(u2.p_1_0==1)"
built 4 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t_1_0, u1.t_0_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/4/2/6
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.03002,16184,1,0,93,25,125,107,51,27,293
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("((u1.r_0_1==1)&&(u3.r_1_1==1))"))&&(X((X(X(("((u1.r_0_1==1)&&(u3.r_1_1==1))")U(F(G("(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))"))))))U("(u2.p_1_0==1)")))))
Formula 1 simplified : !(F"((u1.r_0_1==1)&&(u3.r_1_1==1))" & X(XX("((u1.r_0_1==1)&&(u3.r_1_1==1))" U FG"(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))") U "(u2.p_1_0==1)"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.033929,17700,1,0,100,25,160,116,52,27,395
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X("(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))"))))
Formula 2 simplified : !FX"(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.034614,17700,1,0,112,25,172,147,52,27,484
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(G((F("((u0.p_0_0==1)&&(u1.r_0_1==1))"))U(F(((G("((u0.p_0_0==1)&&(u1.r_0_1==1))"))&&("(u1.r_0_1==1)"))&&("(u3.r_1_1==1)"))))))&&(!(X("(u1.p_0_1==1)")))))
Formula 3 simplified : !(!G(F"((u0.p_0_0==1)&&(u1.r_0_1==1))" U F("(u1.r_0_1==1)" & "(u3.r_1_1==1)" & G"((u0.p_0_0==1)&&(u1.r_0_1==1))")) & !X"(u1.p_0_1==1)")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
4 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.038665,18260,1,0,114,25,220,166,53,27,585
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R002C002-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F(G(F(("(u2.p_1_0==1)")U(G("(u2.p_1_0==1)")))))))||(!(X("(u2.p_1_0==1)")))))
Formula 4 simplified : !(!FGF("(u2.p_1_0==1)" U G"(u2.p_1_0==1)") | !X"(u2.p_1_0==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.039498,18392,1,0,114,25,221,166,53,27,594
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R002C002-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(X((F((((!(F("((u1.r_0_1==1)&&(u3.r_1_1==1))")))||("(u0.p_0_0!=1)"))||("(u1.r_0_1!=1)"))&&(F("(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))"))))||(G("((u0.p_0_0==1)&&(u1.r_0_1==1))")))))))
Formula 5 simplified : GX(F(("(u0.p_0_0!=1)" | "(u1.r_0_1!=1)" | !F"((u1.r_0_1==1)&&(u3.r_1_1==1))") & F"(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))") | G"((u0.p_0_0==1)&&(u1.r_0_1==1))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
3 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.050975,18760,1,0,136,25,311,207,61,27,960
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G((((X((!(F("(u1.p_0_1==1)")))||("((u1.r_0_1==1)&&(u3.r_1_1==1))")))&&(F("(u1.p_0_1==1)")))&&("(u1.r_0_1==1)"))&&("(u3.r_1_1==1)")))))
Formula 6 simplified : !FG("(u1.r_0_1==1)" & "(u3.r_1_1==1)" & F"(u1.p_0_1==1)" & X("((u1.r_0_1==1)&&(u3.r_1_1==1))" | !F"(u1.p_0_1==1)"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.053611,18760,1,0,151,25,326,233,61,27,1086
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(G(F((F(("(((u1.r_0_1==1)&&(u3.r_1_1==1))||(u0.r_0_0==1))")U("(u0.r_0_0==1)")))U("(u0.r_0_0==1)"))))))
Formula 7 simplified : GF(F("(((u1.r_0_1==1)&&(u3.r_1_1==1))||(u0.r_0_0==1))" U "(u0.r_0_0==1)") U "(u0.r_0_0==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,0.054772,18760,1,0,161,25,345,259,61,27,1180
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(!(X(X("((u0.p_0_0==1)&&(u1.r_0_1==1))"))))))
Formula 8 simplified : !G!XX"((u0.p_0_0==1)&&(u1.r_0_1==1))"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.056193,18760,1,0,178,25,352,286,61,27,1271
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G((G("(u1.p_0_1!=1)"))||("(u0.r_0_0==1)")))&&(X("(u1.p_0_1==1)"))))
Formula 9 simplified : !(G("(u0.r_0_0==1)" | G"(u1.p_0_1!=1)") & X"(u1.p_0_1==1)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.05827,18760,1,0,186,25,381,312,61,27,1403
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((!(F("((u1.r_0_1==1)&&(u3.r_1_1==1))")))&&(("(u0.r_0_0==1)")U("(u0.r_0_0==1)")))))
Formula 10 simplified : !X("(u0.r_0_0==1)" & !F"((u1.r_0_1==1)&&(u3.r_1_1==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.059347,18760,1,0,186,25,395,315,61,27,1424
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R002C002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Broken pipe
at java.base/java.io.FileOutputStream.writeBytes(Native Method)
at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354)
at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81)
at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142)
at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318)
at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153)
at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:254)
at org.smtlib.SolverProcess.send(SolverProcess.java:167)
at org.smtlib.SolverProcess.sendAndListen(SolverProcess.java:174)
at org.smtlib.solvers.Solver_z3_4_3.start(Solver_z3_4_3.java:150)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:98)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
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)
Skipping mayMatrices nes/nds Could not start solver Z3 from path /home/mcc/BenchKit//z3/bin/z3 raised error :(error "Failed to start process /home/mcc/BenchKit//z3/bin/z3 : with command line [/home/mcc/BenchKit//z3/bin/z3, -smt2, -in, -t:327] Failed with error : Broken pipe")
java.lang.RuntimeException: Could not start solver Z3 from path /home/mcc/BenchKit//z3/bin/z3 raised error :(error "Failed to start process /home/mcc/BenchKit//z3/bin/z3 : with command line [/home/mcc/BenchKit//z3/bin/z3, -smt2, -in, -t:327] Failed with error : Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:100)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
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-27 00:18:23] [INFO ] Built C files in 391ms 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 1590538704131
--------------------
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="ResAllocation-PT-R002C002"
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 ResAllocation-PT-R002C002, 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 r193-csrt-159033389100626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R002C002.tgz
mv ResAllocation-PT-R002C002 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 ;