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-158940145000402.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-0005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145000402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.0K Apr 7 18:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 7 18:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 6 20:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 20:37 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.4K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 6 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 5 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 29K 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-0005-00
FORMULA_NAME JoinFreeModules-PT-0005-01
FORMULA_NAME JoinFreeModules-PT-0005-02
FORMULA_NAME JoinFreeModules-PT-0005-03
FORMULA_NAME JoinFreeModules-PT-0005-04
FORMULA_NAME JoinFreeModules-PT-0005-05
FORMULA_NAME JoinFreeModules-PT-0005-06
FORMULA_NAME JoinFreeModules-PT-0005-07
FORMULA_NAME JoinFreeModules-PT-0005-08
FORMULA_NAME JoinFreeModules-PT-0005-09
FORMULA_NAME JoinFreeModules-PT-0005-10
FORMULA_NAME JoinFreeModules-PT-0005-11
FORMULA_NAME JoinFreeModules-PT-0005-12
FORMULA_NAME JoinFreeModules-PT-0005-13
FORMULA_NAME JoinFreeModules-PT-0005-14
FORMULA_NAME JoinFreeModules-PT-0005-15

=== Now, execution of the tool begins

BK_START 1589574181798

[2020-05-15 20:23:03] [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:23:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:23:04] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2020-05-15 20:23:04] [INFO ] Transformed 26 places.
[2020-05-15 20:23:04] [INFO ] Transformed 41 transitions.
[2020-05-15 20:23:04] [INFO ] Parsed PT model containing 26 places and 41 transitions in 64 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 588 steps, including 0 resets, run visited all 31 properties in 10 ms. (steps per millisecond=58 )
[2020-05-15 20:23:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 20:23:04] [INFO ] Flatten gal took : 34 ms
FORMULA JoinFreeModules-PT-0005-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:23:04] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 20:23:04] [INFO ] Applying decomposition
[2020-05-15 20:23:04] [INFO ] Flatten gal took : 12 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/graph10814421385019006301.txt, -o, /tmp/graph10814421385019006301.bin, -w, /tmp/graph10814421385019006301.weights], workingDir=null]
[2020-05-15 20:23:04] [INFO ] Input system was already deterministic with 41 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/graph10814421385019006301.bin, -l, -1, -v, -w, /tmp/graph10814421385019006301.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 20:23:04] [INFO ] Decomposing Gal with order
[2020-05-15 20:23:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:23:04] [INFO ] Flatten gal took : 21 ms
[2020-05-15 20:23:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-15 20:23:04] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-15 20:23:04] [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 15 LTL properties
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Checking formula 0 : !(((G(!(F("(u0.p3>=2)"))))||((F(X("(u0.p3>=2)")))&&(F("(u0.p4>=3)")))))
Formula 0 simplified : !(G!F"(u0.p3>=2)" | (FX"(u0.p3>=2)" & F"(u0.p4>=3)"))
// Phase 1: matrix 41 rows 25 cols
[2020-05-15 20:23:04] [INFO ] Computed 5 place invariants in 3 ms
inv : p6 + p7 + p8 + p9 + p10 = 8
inv : p1 + p2 + p3 + p4 + p5 = 8
inv : p11 + p12 + p13 + p14 + p15 = 8
inv : p16 + p17 + p18 + p19 + p20 = 8
inv : p21 + p22 + p23 + p24 + p25 = 8
Total of 5 invariants.
[2020-05-15 20:23:04] [INFO ] Computed 5 place invariants in 4 ms
built 1 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u1.t9, u1.t10, u1.t11, u1.t12, u2.t17, u2.t18, u2.t19, u2.t20, u3.t25, u3.t26, u3.t27, u3.t28, u4.t33, u4.t34, u4.t35, u4.t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/20/41
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
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.039053,17304,1,0,1023,1518,288,791,404,2796,1075
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X((F(!(G("(u1.p6>=5)"))))||("(u1.p9>=3)")))&&(G("(u0.p3>=1)"))))
Formula 1 simplified : !(X("(u1.p9>=3)" | F!G"(u1.p6>=5)") & G"(u0.p3>=1)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.048285,18212,1,0,1359,2316,350,1214,412,4066,1744
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((X(X(F(G("(u3.p18>=2)")))))&&(F("(u3.p19>=3)")))))
Formula 2 simplified : !G(XXFG"(u3.p18>=2)" & F"(u3.p19>=3)")
Computing Next relation with stutter on 1 deadlock states
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.050387,18364,1,0,1394,2393,377,1271,412,4245,1818
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F("(u1.p9>=3)"))&&((F("(u1.p6>=5)"))||(F("(u3.p19>=3)"))))))
Formula 3 simplified : !G(F"(u1.p9>=3)" & (F"(u1.p6>=5)" | F"(u3.p19>=3)"))
Computing Next relation with stutter on 1 deadlock states
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.052507,18960,1,0,1425,2416,399,1317,412,4310,1908
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F((G(X(X(G(X("(u0.p5>=5)"))))))&&("(u0.p5>=5)")))&&(G(F("(u0.p4>=3)")))))
Formula 4 simplified : !(F("(u0.p5>=5)" & GXXGX"(u0.p5>=5)") & GF"(u0.p4>=3)")
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.063344,19804,1,0,2250,2595,412,2050,413,4961,2979
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(X((X("(u1.p7<2)"))&&("(u2.p13>=1)"))))))
Formula 5 simplified : !FGX("(u2.p13>=1)" & X"(u1.p7<2)")
Computing Next relation with stutter on 1 deadlock states
[2020-05-15 20:23:04] [INFO ] Proved 25 variables to be positive in 88 ms
[2020-05-15 20:23:04] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2020-05-15 20:23:04] [INFO ] Computation of disable matrix completed :0/41 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:23:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:23:04] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2020-05-15 20:23:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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.065658,19804,1,0,2269,2646,427,2094,413,5153,3035
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(((X(((G("(u2.p11>=5)"))||("(u1.p8>=2)"))&&(X("(u3.p18>=2)"))))U(G("(u2.p15>=5)")))&&("(u3.p18>=2)")))))
Formula 6 simplified : !FX("(u3.p18>=2)" & (X(("(u1.p8>=2)" | G"(u2.p11>=5)") & X"(u3.p18>=2)") U G"(u2.p15>=5)"))
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.081087,20180,1,0,2475,2713,500,2406,417,5560,3442
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X("(u0.p3>=2)"))&&(!((X("(u4.p22>=2)"))U(((F(G("(u1.p7>=2)")))&&(G("(u4.p22>=2)")))U("(u1.p7>=2)"))))))
Formula 7 simplified : !(X"(u0.p3>=2)" & !(X"(u4.p22>=2)" U ((FG"(u1.p7>=2)" & G"(u4.p22>=2)") U "(u1.p7>=2)")))
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.089759,20412,1,0,2831,3483,536,3069,418,8373,3858
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(F("(u1.p9>=4)")))&&(!(X("(u4.p23>=1)")))))
Formula 8 simplified : !(!F"(u1.p9>=4)" & !X"(u4.p23>=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.0912,20676,1,0,2831,3483,552,3070,419,8374,3889
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("((u3.p17>=2)&&(u2.p14<4))")U((!(G(X("(u1.p10<5)"))))&&(("(u0.p1>=3)")U(F("(u0.p1>=3)"))))))
Formula 9 simplified : !("((u3.p17>=2)&&(u2.p14<4))" U (!GX"(u1.p10<5)" & ("(u0.p1>=3)" U F"(u0.p1>=3)")))
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
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.096388,20676,1,0,3324,3535,575,3632,420,8812,4619
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X((!(G("(u0.p4>=4)")))||("(u1.p6>=5)")))||(X(X(X("((u4.p21>=5)||(u0.p1>=5))"))))))
Formula 10 simplified : !(X("(u1.p6>=5)" | !G"(u0.p4>=4)") | XXX"((u4.p21>=5)||(u0.p1>=5))")
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.097146,20676,1,0,3324,3535,581,3632,420,8812,4635
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G((X(((G("(u4.p23>=2)"))||(G("(u0.p1>=5)")))||("(u4.p21>=5)")))||(X(G(X("(u0.p1>=5)")))))))
Formula 11 simplified : !G(X("(u4.p21>=5)" | G"(u4.p23>=2)" | G"(u0.p1>=5)") | XGX"(u0.p1>=5)")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.101758,20676,1,0,3440,3835,636,3803,424,9582,4851
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(!(G((F(X("(u2.p11>=5)")))&&(G("(u4.p23<1)")))))))
Formula 12 simplified : !X!G(FX"(u2.p11>=5)" & G"(u4.p23<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.102705,20676,1,0,3440,3835,643,3803,424,9582,4856
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!(G((G(F(!(("(u0.p3>=2)")U("(u2.p14>=4)")))))U(F(G("(u0.p3>=2)")))))))
Formula 13 simplified : G(GF!("(u0.p3>=2)" U "(u2.p14>=4)") U FG"(u0.p3>=2)")
Computing Next relation with stutter on 1 deadlock states
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.104304,20676,1,0,3455,3838,654,3822,424,9602,4919
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((X(F(("((u0.p4>=3)||(u0.p4>=4))")U("(u3.p19>=3)"))))||(G("(u1.p6>=5)"))))
Formula 14 simplified : !(XF("((u0.p4>=3)||(u0.p4>=4))" U "(u3.p19>=3)") | G"(u1.p6>=5)")
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.105894,20676,1,0,3589,3838,655,3988,424,9676,5156
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-15 20:23:04] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-15 20:23:04] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-15 20:23:04] [WARNING] Script execution failed on command (assert (and (>= (select s0 2) 2) (= (store (store (store s0 3 (+ (select s0 3) 1)) 4 (+ (select s0 4) 1)) 2 (- (select s0 2) 2)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 2) 2) (= (store (store (store s0 3 (+ (select s0 3) 1)) 4 (+ (select s0 4) 1)) 2 (- (select s0 2) 2)) 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-15 20:23:04] [INFO ] Built C files in 245ms 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 1589574184793

--------------------
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-0005"
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-0005, 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-158940145000402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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