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.r081-smll-158922977300002.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 FMS-PT-00002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977300002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.3K Apr 1 20:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 1 20:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 1 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 1 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 1 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 1 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 1 06:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 1 06:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-00002-00
FORMULA_NAME FMS-PT-00002-01
FORMULA_NAME FMS-PT-00002-02
FORMULA_NAME FMS-PT-00002-03
FORMULA_NAME FMS-PT-00002-04
FORMULA_NAME FMS-PT-00002-05
FORMULA_NAME FMS-PT-00002-06
FORMULA_NAME FMS-PT-00002-07
FORMULA_NAME FMS-PT-00002-08
FORMULA_NAME FMS-PT-00002-09
FORMULA_NAME FMS-PT-00002-10
FORMULA_NAME FMS-PT-00002-11
FORMULA_NAME FMS-PT-00002-12
FORMULA_NAME FMS-PT-00002-13
FORMULA_NAME FMS-PT-00002-14
FORMULA_NAME FMS-PT-00002-15

=== Now, execution of the tool begins

BK_START 1589358358440

[2020-05-13 08:26:01] [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-13 08:26:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-13 08:26:01] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-05-13 08:26:01] [INFO ] Transformed 22 places.
[2020-05-13 08:26:01] [INFO ] Transformed 20 transitions.
[2020-05-13 08:26:01] [INFO ] Parsed PT model containing 22 places and 20 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1847 steps, including 0 resets, run visited all 26 properties in 30 ms. (steps per millisecond=61 )
[2020-05-13 08:26:01] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-13 08:26:01] [INFO ] Flatten gal took : 49 ms
FORMULA FMS-PT-00002-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-13 08:26:01] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-13 08:26:02] [INFO ] Applying decomposition
[2020-05-13 08:26:02] [INFO ] Flatten gal took : 9 ms
[2020-05-13 08:26:02] [INFO ] Input system was already deterministic with 20 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/graph971700361697178604.txt, -o, /tmp/graph971700361697178604.bin, -w, /tmp/graph971700361697178604.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/graph971700361697178604.bin, -l, -1, -v, -w, /tmp/graph971700361697178604.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 20 rows 22 cols
[2020-05-13 08:26:02] [INFO ] Computed 6 place invariants in 6 ms
inv : P12 + P2wM2 + P2 + P2M2 + P12M3 + P12wM3 + P12s + P2wP1 + P2d + P2s = 2
inv : P3s + P3M2 + P3 = 2
inv : P1M1 + M1 = 3
inv : P12M3 + M3 = 2
inv : P1d + P1s + P1wP2 + P12 + P1 + P1wM1 + P1M1 + P12M3 + P12wM3 + P12s = 2
inv : M2 + P2M2 = 1
Total of 6 invariants.
[2020-05-13 08:26:02] [INFO ] Computed 6 place invariants in 9 ms
[2020-05-13 08:26:02] [INFO ] Decomposing Gal with order
[2020-05-13 08:26:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-13 08:26:02] [INFO ] Removed a total of 1 redundant transitions.
[2020-05-13 08:26:02] [INFO ] Flatten gal took : 83 ms
[2020-05-13 08:26:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-13 08:26:02] [INFO ] Proved 22 variables to be positive in 173 ms
[2020-05-13 08:26:02] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2020-05-13 08:26:02] [INFO ] Computation of disable matrix completed :0/20 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-13 08:26:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-13 08:26:02] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2020-05-13 08:26:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-13 08:26:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 14 ms
[2020-05-13 08:26:02] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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 13 LTL properties
Checking formula 0 : !((X(X(G((F("(i0.u3.P1M1>=1)"))&&((F(("(i0.u3.P1M1>=1)")U("((i0.u0.P1s>=1)||((i0.u0.P1wP2>=1)&&(i2.u7.P2wP1>=1)))")))||(X("(i0.u3.P1M1>=1)"))))))))
Formula 0 simplified : !XXG(F"(i0.u3.P1M1>=1)" & (F("(i0.u3.P1M1>=1)" U "((i0.u0.P1s>=1)||((i0.u0.P1wP2>=1)&&(i2.u7.P2wP1>=1)))") | X"(i0.u3.P1M1>=1)"))
built 2 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.051975,17312,1,0,855,182,305,1184,118,504,1637
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FMS-PT-00002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(("(i1.u6.P12M3>=1)")U(G(X(F(G((!(G("((i0.u2.P1wM1>=1)&&(i0.u3.M1>=1))")))&&("(i1.u6.P12M3>=1)"))))))))))
Formula 1 simplified : !X!("(i1.u6.P12M3>=1)" U GXFG("(i1.u6.P12M3>=1)" & !G"((i0.u2.P1wM1>=1)&&(i0.u3.M1>=1))"))
3 unique states visited
3 strongly connected components in search stack
4 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.05688,18028,1,0,935,184,348,1292,118,517,1852
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FMS-PT-00002-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(("(i2.u4.P2s>=1)")U(X("(i0.u0.P1s>=1)"))))||(X("((i0.u0.P1wP2>=1)&&(i2.u7.P2wP1>=1))"))))
Formula 2 simplified : !(G("(i2.u4.P2s>=1)" U X"(i0.u0.P1s>=1)") | X"((i0.u0.P1wP2>=1)&&(i2.u7.P2wP1>=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.061221,18628,1,0,935,184,361,1292,119,517,1885
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA FMS-PT-00002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((F(((G("((i2.u5.M2>=1)&&(u8.P3M2>=1))"))&&("(i0.u0.P1wP2>=1)"))&&("(i2.u7.P2wP1>=1)")))&&(((!(G("((i0.u0.P1wP2>=1)&&(i2.u7.P2wP1>=1))")))||("(i0.u0.P1wP2<1)"))||("(i2.u7.P2wP1<1)")))))
Formula 3 simplified : !F(F("(i0.u0.P1wP2>=1)" & "(i2.u7.P2wP1>=1)" & G"((i2.u5.M2>=1)&&(u8.P3M2>=1))") & ("(i0.u0.P1wP2<1)" | "(i2.u7.P2wP1<1)" | !G"((i0.u0.P1wP2>=1)&&(i2.u7.P2wP1>=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.111958,19944,1,0,3178,233,427,6572,124,1006,4677
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA FMS-PT-00002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("(i2.u4.P2s>=1)")U(!((X((X("((i0.u0.P1wP2>=1)&&(i2.u7.P2wP1>=1))"))||(G("(i2.u5.P2M2>=1)"))))U("(i2.u4.P2s>=1)")))))
Formula 4 simplified : !("(i2.u4.P2s>=1)" U !(X(X"((i0.u0.P1wP2>=1)&&(i2.u7.P2wP1>=1))" | G"(i2.u5.P2M2>=1)") U "(i2.u4.P2s>=1)"))
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.116736,20204,1,0,3178,233,482,6572,124,1006,4764
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA FMS-PT-00002-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(F("(i1.u6.P12s>=1)"))))
Formula 5 simplified : F"(i1.u6.P12s>=1)"
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.121398,20204,1,0,3340,235,501,6755,124,1019,5161
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA FMS-PT-00002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((("(i0.u3.P1M1>=1)")U("((i1.u6.P12s>=1)||(i1.u6.P12M3>=1))"))&&(X(F(G("(((i1.u6.P12M3>=1)&&(i0.u2.P1wM1>=1))&&(i0.u3.M1>=1))")))))))
Formula 6 simplified : !X(("(i0.u3.P1M1>=1)" U "((i1.u6.P12s>=1)||(i1.u6.P12M3>=1))") & XFG"(((i1.u6.P12M3>=1)&&(i0.u2.P1wM1>=1))&&(i0.u3.M1>=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.123898,20204,1,0,3340,235,518,6755,126,1019,5202
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA FMS-PT-00002-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X((F(X((F("(u8.P3s>=1)"))&&("(i2.u4.P2s>=1)"))))||(((G("(i2.u7.P2d>=1)"))&&("(i2.u4.P2s>=1)"))&&("(u8.P3s>=1)"))))))
Formula 7 simplified : !FX(FX("(i2.u4.P2s>=1)" & F"(u8.P3s>=1)") | ("(i2.u4.P2s>=1)" & "(u8.P3s>=1)" & G"(i2.u7.P2d>=1)"))
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.131771,20204,1,0,3639,242,568,7391,126,1107,5746
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA FMS-PT-00002-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(("(i0.u0.P1d>=1)")U(G(X("((i0.u3.P1M1>=1)||(i2.u4.P2<1))")))))||(F(G("(i0.u0.P1d>=1)")))))
Formula 8 simplified : !(X("(i0.u0.P1d>=1)" U GX"((i0.u3.P1M1>=1)||(i2.u4.P2<1))") | FG"(i0.u0.P1d>=1)")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.167269,20992,1,0,5308,264,600,12177,126,1444,8098
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA FMS-PT-00002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!((!(G((!(X("(i1.u6.P12s>=1)")))&&(X(X("(i1.u6.P12M3>=1)"))))))U(("(i1.u6.P12s>=1)")U("(i0.u3.P1M1>=1)")))))
Formula 9 simplified : !G(!X"(i1.u6.P12s>=1)" & XX"(i1.u6.P12M3>=1)") U ("(i1.u6.P12s>=1)" U "(i0.u3.P1M1>=1)")
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.176584,21248,1,0,5404,264,653,12318,131,1448,8437
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA FMS-PT-00002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(((X(G(F("((i1.u1.P12wM3>=1)&&(i1.u6.M3>=1))"))))&&(("(i2.u7.P2d>=1)")U(X("(u8.P3>=1)"))))&&(X("(i2.u7.P2d>=1)"))))))
Formula 10 simplified : !FG(XGF"((i1.u1.P12wM3>=1)&&(i1.u6.M3>=1))" & ("(i2.u7.P2d>=1)" U X"(u8.P3>=1)") & X"(i2.u7.P2d>=1)")
2 unique states visited
1 strongly connected components in search stack
3 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.182905,21248,1,0,5474,265,669,12454,131,1466,8579
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA FMS-PT-00002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("(u8.P3>=1)")U(!(X("(i0.u0.P1d>=1)")))))
Formula 11 simplified : !("(u8.P3>=1)" U !X"(i0.u0.P1d>=1)")
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.184363,21512,1,0,5474,265,676,12454,131,1466,8590
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA FMS-PT-00002-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((!(G(X(X(G("(i0.u0.P1s>=1)"))))))||(G(X("(i2.u7.P2d>=1)")))))
Formula 12 simplified : !(!GXXG"(i0.u0.P1s>=1)" | GX"(i2.u7.P2d>=1)")
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.186117,21512,1,0,5474,265,689,12454,131,1466,8624
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA FMS-PT-00002-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-13 08:26:02] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-13 08:26:02] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
[2020-05-13 08:26:02] [WARNING] Script execution failed on command (assert (and (>= (select s0 1) 1) (= (store (store s0 4 (+ (select s0 4) 1)) 1 (- (select s0 1) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 1) 1) (= (store (store s0 4 (+ (select s0 4) 1)) 1 (- (select s0 1) 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-13 08:26:02] [INFO ] Built C files in 592ms 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 1589358363907

--------------------
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="FMS-PT-00002"
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 FMS-PT-00002, 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 r081-smll-158922977300002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00002.tgz
mv FMS-PT-00002 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 ;