Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940145000386.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 JoinFreeModules-PT-0003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145000386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.2K Apr 7 18:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 6 20:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 6 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 6 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 5 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 5 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 18K Mar 24 05:37 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 JoinFreeModules-PT-0003-00
FORMULA_NAME JoinFreeModules-PT-0003-01
FORMULA_NAME JoinFreeModules-PT-0003-02
FORMULA_NAME JoinFreeModules-PT-0003-03
FORMULA_NAME JoinFreeModules-PT-0003-04
FORMULA_NAME JoinFreeModules-PT-0003-05
FORMULA_NAME JoinFreeModules-PT-0003-06
FORMULA_NAME JoinFreeModules-PT-0003-07
FORMULA_NAME JoinFreeModules-PT-0003-08
FORMULA_NAME JoinFreeModules-PT-0003-09
FORMULA_NAME JoinFreeModules-PT-0003-10
FORMULA_NAME JoinFreeModules-PT-0003-11
FORMULA_NAME JoinFreeModules-PT-0003-12
FORMULA_NAME JoinFreeModules-PT-0003-13
FORMULA_NAME JoinFreeModules-PT-0003-14
FORMULA_NAME JoinFreeModules-PT-0003-15

=== Now, execution of the tool begins

BK_START 1589574031366

[2020-05-15 20:20:33] [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-15 20:20:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:20:33] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-05-15 20:20:33] [INFO ] Transformed 16 places.
[2020-05-15 20:20:33] [INFO ] Transformed 25 transitions.
[2020-05-15 20:20:33] [INFO ] Parsed PT model containing 16 places and 25 transitions in 61 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 128 steps, including 0 resets, run visited all 26 properties in 3 ms. (steps per millisecond=42 )
[2020-05-15 20:20:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-15 20:20:33] [INFO ] Flatten gal took : 20 ms
FORMULA JoinFreeModules-PT-0003-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:20:33] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 20:20:33] [INFO ] Applying decomposition
[2020-05-15 20:20:33] [INFO ] Flatten gal took : 3 ms
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/graph7402301168014706926.txt, -o, /tmp/graph7402301168014706926.bin, -w, /tmp/graph7402301168014706926.weights], workingDir=null]
[2020-05-15 20:20:33] [INFO ] Input system was already deterministic with 25 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7402301168014706926.bin, -l, -1, -v, -w, /tmp/graph7402301168014706926.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 20:20:33] [INFO ] Decomposing Gal with order
[2020-05-15 20:20:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:20:33] [INFO ] Flatten gal took : 19 ms
[2020-05-15 20:20:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-15 20:20:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-15 20:20:33] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
// Phase 1: matrix 25 rows 15 cols
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]
[2020-05-15 20:20:33] [INFO ] Computed 3 place invariants in 6 ms
inv : p6 + p7 + p8 + p9 + p10 = 6
inv : p1 + p2 + p3 + p4 + p5 = 6
inv : p11 + p12 + p13 + p14 + p15 = 6
Total of 3 invariants.
[2020-05-15 20:20:33] [INFO ] Computed 3 place invariants in 9 ms

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 14 LTL properties
Checking formula 0 : !((("(i2.u4.p13>=1)")U(G(!(("(i2.u4.p13>=1)")U("(i2.u5.p14>=4)"))))))
Formula 0 simplified : !("(i2.u4.p13>=1)" U G!("(i2.u4.p13>=1)" U "(i2.u5.p14>=4)"))
built 1 ordering constraints for composite.
built 2 ordering constraints for composite.
built 2 ordering constraints for composite.
built 2 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.t3, i0.u1.t2, i1.t11, i1.u2.t10, i2.t19, i2.u4.t18, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/19/6/25
2 unique states visited
2 strongly connected components in search stack
4 transitions explored
2 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.028951,17416,1,0,912,464,365,1451,186,1333,1584
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(!(G(!(G(X(F("(i0.u0.p1>=5)")))))))))
Formula 1 simplified : !G!G!GXF"(i0.u0.p1>=5)"
3 unique states visited
3 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.030222,17416,1,0,938,470,403,1503,187,1376,1707
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(((X(G(F((G("(i2.u5.p14>=4)"))&&("(i2.u5.p14>=4)")))))&&(G(X(X("(i1.u2.p8>=2)")))))&&("(i0.u1.p3>=2)"))))
Formula 2 simplified : !F("(i0.u1.p3>=2)" & XGF("(i2.u5.p14>=4)" & G"(i2.u5.p14>=4)") & GXX"(i1.u2.p8>=2)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.049564,19484,1,0,2839,683,427,4871,188,2469,3256
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((("(i2.u4.p13>=1)")U(!(X("(i1.u2.p7>=2)"))))U((G("(i2.u5.p11>=3)"))||("(i2.u5.p11>=5)")))))
Formula 3 simplified : !G(("(i2.u4.p13>=1)" U !X"(i1.u2.p7>=2)") U ("(i2.u5.p11>=5)" | G"(i2.u5.p11>=3)"))
4 unique states visited
4 strongly connected components in search stack
5 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.054423,19932,1,0,3002,727,469,5194,192,2747,3546
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(G(F("(i0.u1.p2>=2)"))))&&(("(i2.u4.p13>=1)")U("(i2.u5.p11>=5)"))))
Formula 4 simplified : !(!GF"(i0.u1.p2>=2)" & ("(i2.u4.p13>=1)" U "(i2.u5.p11>=5)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.060741,20156,1,0,3630,858,506,6118,192,3204,4356
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(X("(i1.u3.p9>=3)")))))
Formula 5 simplified : !GXX"(i1.u3.p9>=3)"
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.061756,20420,1,0,3653,858,522,6136,193,3204,4454
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(G(X("(i0.u0.p4>=3)"))))U((!(G("(i0.u0.p4>=3)")))&&("(i0.u0.p4>=4)"))))
Formula 6 simplified : !(!GX"(i0.u0.p4>=3)" U ("(i0.u0.p4>=4)" & !G"(i0.u0.p4>=3)"))
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.065253,20684,1,0,3896,895,556,6434,195,3322,4876
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((G("(i2.u4.p13>=2)"))&&("(i0.u0.p1>=5)"))U(("(i1.u3.p6>=5)")U(("(i1.u2.p8<2)")U(X((G("(i1.u3.p6>=5)"))U("(i1.u2.p8>=2)")))))))
Formula 7 simplified : !(("(i0.u0.p1>=5)" & G"(i2.u4.p13>=2)") U ("(i1.u3.p6>=5)" U ("(i1.u2.p8<2)" U X(G"(i1.u3.p6>=5)" U "(i1.u2.p8>=2)"))))
[2020-05-15 20:20:33] [INFO ] Proved 15 variables to be positive in 96 ms
[2020-05-15 20:20:33] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2020-05-15 20:20:33] [INFO ] Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:20:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:20:33] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2020-05-15 20:20:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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.071336,20684,1,0,3924,899,635,6464,195,3336,5035
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((((("(i2.u5.p14>=3)")U(X("(i0.u0.p4>=3)")))&&("(i0.u1.p3>=1)"))&&("(i0.u0.p4>=3)"))&&("(i2.u5.p14>=3)"))))
Formula 8 simplified : !X("(i0.u0.p4>=3)" & "(i0.u1.p3>=1)" & "(i2.u5.p14>=3)" & ("(i2.u5.p14>=3)" U X"(i0.u0.p4>=3)"))
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.072189,20684,1,0,3924,899,661,6465,195,3336,5050
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!((F("(i0.u1.p2>=2)"))U("(i0.u1.p2>=2)"))))
Formula 9 simplified : F"(i0.u1.p2>=2)" U "(i0.u1.p2>=2)"
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.072912,20684,1,0,3938,899,661,6490,195,3341,5107
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F("(i0.u0.p4>=4)"))&&(X("(i0.u0.p4>=4)"))))
Formula 10 simplified : !(F"(i0.u0.p4>=4)" & X"(i0.u0.p4>=4)")
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.073319,20684,1,0,3938,899,661,6490,195,3341,5108
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((F("(i1.u3.p6<5)"))||(G(X("(i2.u5.p14>=4)"))))))
Formula 11 simplified : !X(F"(i1.u3.p6<5)" | GX"(i2.u5.p14>=4)")
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.073888,20684,1,0,3938,899,662,6490,195,3341,5111
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0003-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((F(G(("(i0.u0.p4>=4)")U("(i2.u4.p13>=1)"))))&&(((G("(i1.u3.p10<5)"))U(G(F("(i2.u4.p13>=1)"))))U("(i2.u4.p13>=1)"))))
Formula 12 simplified : !(FG("(i0.u0.p4>=4)" U "(i2.u4.p13>=1)") & ((G"(i1.u3.p10<5)" U GF"(i2.u4.p13>=1)") U "(i2.u4.p13>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.091656,20940,1,0,5085,980,681,8815,195,3680,6452
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(X(((!(G("(i2.u4.p12>=2)")))&&(!(X("(i1.u2.p8>=1)"))))&&("(i2.u4.p12<2)")))))
Formula 13 simplified : !GX("(i2.u4.p12<2)" & !G"(i2.u4.p12>=2)" & !X"(i1.u2.p8>=1)")
4 unique states visited
4 strongly connected components in search stack
5 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.092936,21204,1,0,5105,981,692,8834,197,3681,6521
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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-15 20:20:33] [INFO ] Built C files in 242ms 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 1589574033908

--------------------
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="JoinFreeModules-PT-0003"
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 JoinFreeModules-PT-0003, 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 r096-oct2-158940145000386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;