Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814100306.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814100306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 65K Apr 27 14:36 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 Dekker-PT-010-00
FORMULA_NAME Dekker-PT-010-01
FORMULA_NAME Dekker-PT-010-02
FORMULA_NAME Dekker-PT-010-03
FORMULA_NAME Dekker-PT-010-04
FORMULA_NAME Dekker-PT-010-05
FORMULA_NAME Dekker-PT-010-06
FORMULA_NAME Dekker-PT-010-07
FORMULA_NAME Dekker-PT-010-08
FORMULA_NAME Dekker-PT-010-09
FORMULA_NAME Dekker-PT-010-10
FORMULA_NAME Dekker-PT-010-11
FORMULA_NAME Dekker-PT-010-12
FORMULA_NAME Dekker-PT-010-13
FORMULA_NAME Dekker-PT-010-14
FORMULA_NAME Dekker-PT-010-15

=== Now, execution of the tool begins

BK_START 1590110776677

[2020-05-22 01:26:19] [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-22 01:26:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:26:19] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2020-05-22 01:26:19] [INFO ] Transformed 50 places.
[2020-05-22 01:26:19] [INFO ] Transformed 120 transitions.
[2020-05-22 01:26:19] [INFO ] Found NUPN structural information;
[2020-05-22 01:26:19] [INFO ] Parsed PT model containing 50 places and 120 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 310 ms. (steps per millisecond=322 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-22 01:26:19] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 50 cols
[2020-05-22 01:26:19] [INFO ] Computed 30 place invariants in 5 ms
[2020-05-22 01:26:19] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-05-22 01:26:19] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-05-22 01:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:26:19] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-22 01:26:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2020-05-22 01:26:19] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2020-05-22 01:26:19] [INFO ] Computed and/alt/rep : 110/300/30 causal constraints in 9 ms.
[2020-05-22 01:26:19] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
[2020-05-22 01:26:19] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-22 01:26:19] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2020-05-22 01:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:26:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-05-22 01:26:20] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2020-05-22 01:26:20] [INFO ] Computed and/alt/rep : 110/300/30 causal constraints in 5 ms.
[2020-05-22 01:26:20] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
[2020-05-22 01:26:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 01:26:20] [INFO ] Flatten gal took : 41 ms
FORMULA Dekker-PT-010-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:26:20] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 01:26:20] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 01:26:20] [INFO ] Flatten gal took : 42 ms
[2020-05-22 01:26:20] [INFO ] Input system was already deterministic with 120 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/graph10160672942514366218.txt, -o, /tmp/graph10160672942514366218.bin, -w, /tmp/graph10160672942514366218.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/graph10160672942514366218.bin, -l, -1, -v, -w, /tmp/graph10160672942514366218.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 40 out of 120 initially.
// Phase 1: matrix 40 rows 50 cols
[2020-05-22 01:26:20] [INFO ] Computed 30 place invariants in 1 ms
inv : flag_1_3 - p1_3 - p3_3 = 0
inv : flag_0_1 + p1_1 + p3_1 = 1
inv : flag_1_6 - p1_6 - p3_6 = 0
inv : p0_4 + p1_4 + p34 = 1
inv : p0_1 + p1_1 + p3_1 = 1
inv : flag_0_4 + p1_4 + p34 = 1
inv : flag_1_0 - p1_0 - p3_0 = 0
inv : flag_0_9 + p1_9 + p3_9 = 1
inv : flag_0_6 + p1_6 + p3_6 = 1
inv : flag_0_7 + p1_7 + p3_7 = 1
inv : p0_5 + p1_5 + p3_5 = 1
inv : flag_1_8 - p1_8 - p3_8 = 0
inv : flag_1_4 - p1_4 - p34 = 0
inv : flag_0_5 + p1_5 + p3_5 = 1
inv : p0_0 + p1_0 + p3_0 = 1
inv : p0_3 + p1_3 + p3_3 = 1
inv : flag_1_7 - p1_7 - p3_7 = 0
inv : p0_9 + p1_9 + p3_9 = 1
inv : flag_1_2 - p1_2 - p3_2 = 0
inv : flag_0_0 + p1_0 + p3_0 = 1
inv : flag_0_2 + p1_2 + p3_2 = 1
inv : p0_6 + p1_6 + p3_6 = 1
inv : flag_0_8 + p1_8 + p3_8 = 1
inv : flag_0_3 + p1_3 + p3_3 = 1
inv : flag_1_1 - p1_1 - p3_1 = 0
inv : p0_2 + p1_2 + p3_2 = 1
inv : p0_8 + p1_8 + p3_8 = 1
inv : flag_1_9 - p1_9 - p3_9 = 0
inv : flag_1_5 - p1_5 - p3_5 = 0
inv : p0_7 + p1_7 + p3_7 = 1
Total of 30 invariants.
[2020-05-22 01:26:20] [INFO ] Computed 30 place invariants in 2 ms
[2020-05-22 01:26:20] [INFO ] Decomposing Gal with order
[2020-05-22 01:26:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:26:20] [INFO ] Removed a total of 258 redundant transitions.
[2020-05-22 01:26:20] [INFO ] Proved 50 variables to be positive in 354 ms
[2020-05-22 01:26:20] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2020-05-22 01:26:20] [INFO ] Computation of disable matrix completed :0/120 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:26:20] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:26:20] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2020-05-22 01:26:20] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:26:20] [INFO ] Flatten gal took : 301 ms
[2020-05-22 01:26:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-22 01:26:20] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-22 01:26:20] [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 14 LTL properties
Checking formula 0 : !(((G("(((i0.u1.flag_1_0==1)&&(u8.flag_1_8==1))&&(i0.u0.p1_0==1))"))||(G(X("(((i0.u1.flag_1_0!=1)||(u8.flag_1_8!=1))||(i0.u0.p1_0!=1))")))))
Formula 0 simplified : !(G"(((i0.u1.flag_1_0==1)&&(u8.flag_1_8==1))&&(i0.u0.p1_0==1))" | GX"(((i0.u1.flag_1_0!=1)||(u8.flag_1_8!=1))||(i0.u0.p1_0!=1))")
built 46 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u3.exit_2, u4.exit_3, u5.exit_4, u6.exit_6, u7.exit_7, u8.exit_8, u10.exit_5, u11.exit_9, i0.exit_0, i1.exit_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/110/10/120
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.079709,18748,1,0,2735,99,1300,2521,244,105,5865
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(("((((((u3.flag_1_2==1)&&(u10.flag_1_5==1))&&(u3.p1_2==1))&&(i0.u1.flag_1_0==1))&&(u8.flag_1_8==1))&&(u8.p1_8==1))")U(G("(((u3.flag_1_2==1)&&(u10.flag_1_5==1))&&(u3.p1_2==1))"))))&&(!(F(X(F("(((u5.flag_1_4==1)&&(u11.flag_1_9==1))&&(u5.p1_4==1))")))))))
Formula 1 simplified : !(!("((((((u3.flag_1_2==1)&&(u10.flag_1_5==1))&&(u3.p1_2==1))&&(i0.u1.flag_1_0==1))&&(u8.flag_1_8==1))&&(u8.p1_8==1))" U G"(((u3.flag_1_2==1)&&(u10.flag_1_5==1))&&(u3.p1_2==1))") & !FXF"(((u5.flag_1_4==1)&&(u11.flag_1_9==1))&&(u5.p1_4==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.089354,19544,1,0,3214,99,1399,3268,247,105,7284
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-010-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(X(("(((i0.u1.flag_1_0==1)&&(u10.flag_1_5==1))&&(u10.p1_5==1))")U(((F("((i0.u0.flag_0_0==1)&&(i0.u1.p0_0==1))"))||(F("(((u7.flag_1_7!=1)||(u8.flag_1_8!=1))||(u8.p1_8!=1))")))||(!(F("(((u3.flag_1_2==1)&&(u5.flag_1_4==1))&&(u5.p1_4==1))")))))))))
Formula 2 simplified : !XGX("(((i0.u1.flag_1_0==1)&&(u10.flag_1_5==1))&&(u10.p1_5==1))" U (F"((i0.u0.flag_0_0==1)&&(i0.u1.p0_0==1))" | F"(((u7.flag_1_7!=1)||(u8.flag_1_8!=1))||(u8.p1_8!=1))" | !F"(((u3.flag_1_2==1)&&(u5.flag_1_4==1))&&(u5.p1_4==1))"))
6 unique states visited
5 strongly connected components in search stack
9 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.105601,20316,1,0,4049,99,1629,4391,249,105,9702
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(X(F("((((((((((i0.u0.flag_0_0==1)&&(i1.u2.flag_0_1==1))&&(u3.flag_0_2==1))&&(u4.flag_0_3==1))&&(u5.flag_0_4==1))&&(u10.flag_0_5==1))&&(u6.flag_0_6==1))&&(u7.flag_0_7==1))&&(u11.flag_0_9==1))&&(u8.p1_8==1))"))))))
Formula 3 simplified : !GFXF"((((((((((i0.u0.flag_0_0==1)&&(i1.u2.flag_0_1==1))&&(u3.flag_0_2==1))&&(u4.flag_0_3==1))&&(u5.flag_0_4==1))&&(u10.flag_0_5==1))&&(u6.flag_0_6==1))&&(u7.flag_0_7==1))&&(u11.flag_0_9==1))&&(u8.p1_8==1))"
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.107356,20316,1,0,4070,99,1667,4427,249,105,9880
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((((X("(((u6.flag_1_6==1)&&(u8.flag_1_8==1))&&(u8.p1_8==1))"))&&("(i0.u1.flag_1_0==1)"))&&("(i0.u0.p3_0==1)"))U(G(X((X(F(G(!(G("(((u10.flag_1_5==1)&&(u8.flag_1_8==1))&&(u10.p1_5==1))"))))))U("(((i1.u9.flag_1_1==1)&&(u6.flag_1_6==1))&&(u6.p1_6==1))"))))))
Formula 4 simplified : !(("(i0.u0.p3_0==1)" & "(i0.u1.flag_1_0==1)" & X"(((u6.flag_1_6==1)&&(u8.flag_1_8==1))&&(u8.p1_8==1))") U GX(XFG!G"(((u10.flag_1_5==1)&&(u8.flag_1_8==1))&&(u10.p1_5==1))" U "(((i1.u9.flag_1_1==1)&&(u6.flag_1_6==1))&&(u6.p1_6==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.124798,20964,1,0,4712,99,1821,5253,251,105,11509
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((((!(X(("(((u3.flag_1_2!=1)||(u6.flag_1_6!=1))||(u6.p1_6!=1))")U(("(((u3.flag_1_2==1)&&(u6.flag_1_6==1))&&(u6.p1_6==1))")U("(((((u8.flag_1_8==1)&&(u8.p3_8==1))&&(i0.u1.flag_1_0==1))&&(u3.flag_1_2==1))&&(i0.u0.p1_0==1))")))))&&("(u3.flag_1_2==1)"))&&("(u6.flag_1_6==1)"))&&("(u6.p1_6==1)"))))
Formula 5 simplified : !F("(u3.flag_1_2==1)" & "(u6.flag_1_6==1)" & "(u6.p1_6==1)" & !X("(((u3.flag_1_2!=1)||(u6.flag_1_6!=1))||(u6.p1_6!=1))" U ("(((u3.flag_1_2==1)&&(u6.flag_1_6==1))&&(u6.p1_6==1))" U "(((((u8.flag_1_8==1)&&(u8.p3_8==1))&&(i0.u1.flag_1_0==1))&&(u3.flag_1_2==1))&&(i0.u0.p1_0==1))")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.140743,21464,1,0,5831,99,2059,6841,259,105,14432
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-010-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F((G(!((F("(((u4.flag_1_3==1)&&(u6.flag_1_6==1))&&(u6.p1_6==1))"))U("((((((u4.flag_1_3==1)&&(u10.flag_1_5==1))&&(u10.p1_5==1))&&(u5.flag_1_4==1))&&(u11.flag_1_9==1))&&(u11.p1_9==1))"))))U(G("(((u5.flag_1_4!=1)||(u11.flag_1_9!=1))||(u11.p1_9!=1))"))))))
Formula 6 simplified : !XF(G!(F"(((u4.flag_1_3==1)&&(u6.flag_1_6==1))&&(u6.p1_6==1))" U "((((((u4.flag_1_3==1)&&(u10.flag_1_5==1))&&(u10.p1_5==1))&&(u5.flag_1_4==1))&&(u11.flag_1_9==1))&&(u11.p1_9==1))") U G"(((u5.flag_1_4!=1)||(u11.flag_1_9!=1))||(u11.p1_9!=1))")
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.146155,21728,1,0,6430,99,2082,7804,259,105,16077
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-010-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F("(((i1.u9.flag_1_1!=1)||(u3.flag_1_2!=1))||(i1.u2.p1_1!=1))"))&&(G(X("((u5.flag_1_4==1)&&(u5.p34==1))")))))
Formula 7 simplified : !(F"(((i1.u9.flag_1_1!=1)||(u3.flag_1_2!=1))||(i1.u2.p1_1!=1))" & GX"((u5.flag_1_4==1)&&(u5.p34==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.147831,22256,1,0,6430,99,2113,7804,261,105,16127
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(!((F("(((i0.u1.flag_1_0!=1)||(u5.flag_1_4!=1))||(i0.u0.p1_0!=1))"))U(F(X(!(X("(((i0.u1.flag_1_0==1)&&(u7.flag_1_7==1))&&(i0.u0.p1_0==1))")))))))))
Formula 8 simplified : !G!(F"(((i0.u1.flag_1_0!=1)||(u5.flag_1_4!=1))||(i0.u0.p1_0!=1))" U FX!X"(((i0.u1.flag_1_0==1)&&(u7.flag_1_7==1))&&(i0.u0.p1_0==1))")
5 unique states visited
5 strongly connected components in search stack
5 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.155118,22256,1,0,6665,99,2179,8171,261,105,16936
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X("(((u3.flag_1_2==1)&&(u6.flag_1_6==1))&&(u6.p1_6==1))"))))
Formula 9 simplified : !GX"(((u3.flag_1_2==1)&&(u6.flag_1_6==1))&&(u6.p1_6==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.15704,22256,1,0,6665,99,2195,8171,261,105,16961
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(F(X((G("(((u5.flag_1_4==1)&&(u10.flag_1_5==1))&&(u10.p1_5==1))"))&&((F("(((u5.flag_1_4==1)&&(u11.flag_1_9==1))&&(u5.p1_4==1))"))||("(((u5.flag_1_4==1)&&(u10.flag_1_5==1))&&(u10.p1_5==1))"))))))))
Formula 10 simplified : !FGFX(G"(((u5.flag_1_4==1)&&(u10.flag_1_5==1))&&(u10.p1_5==1))" & ("(((u5.flag_1_4==1)&&(u10.flag_1_5==1))&&(u10.p1_5==1))" | F"(((u5.flag_1_4==1)&&(u11.flag_1_9==1))&&(u5.p1_4==1))"))
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.159306,22256,1,0,6759,99,2237,8299,261,105,17227
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(!(X(X(G("((u11.flag_0_9==1)&&(u11.p0_9==1))")))))))
Formula 11 simplified : !G!XXG"((u11.flag_0_9==1)&&(u11.p0_9==1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.160359,22256,1,0,6760,99,2257,8305,264,105,17259
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((((G("(((i0.u1.flag_1_0==1)&&(u3.flag_1_2==1))&&(i0.u0.p1_0==1))"))U(X("(((i0.u1.flag_1_0==1)&&(u7.flag_1_7==1))&&(i0.u0.p1_0==1))")))||(("((u4.flag_1_3==1)&&(u4.p3_3==1))")U(G((X(G("((u4.flag_1_3==1)&&(u4.p3_3==1))")))&&(X("((u4.flag_1_3==1)&&(u4.p3_3==1))")))))))
Formula 12 simplified : !((G"(((i0.u1.flag_1_0==1)&&(u3.flag_1_2==1))&&(i0.u0.p1_0==1))" U X"(((i0.u1.flag_1_0==1)&&(u7.flag_1_7==1))&&(i0.u0.p1_0==1))") | ("((u4.flag_1_3==1)&&(u4.p3_3==1))" U G(XG"((u4.flag_1_3==1)&&(u4.p3_3==1))" & X"((u4.flag_1_3==1)&&(u4.p3_3==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.166595,22256,1,0,6760,99,2294,8305,264,105,17329
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((("(((u5.flag_1_4==1)&&(u11.flag_1_9==1))&&(u5.p1_4==1))")U(G("((((((((((i0.u0.flag_0_0==1)&&(i1.u2.flag_0_1==1))&&(u3.flag_0_2==1))&&(u4.flag_0_3==1))&&(u10.flag_0_5==1))&&(u6.flag_0_6==1))&&(u7.flag_0_7==1))&&(u8.flag_0_8==1))&&(u11.flag_0_9==1))&&(u5.p1_4==1))")))||(F("((((((((((i0.u0.flag_0_0==1)&&(i1.u2.flag_0_1==1))&&(u3.flag_0_2==1))&&(u4.flag_0_3==1))&&(u10.flag_0_5==1))&&(u6.flag_0_6==1))&&(u7.flag_0_7==1))&&(u8.flag_0_8==1))&&(u11.flag_0_9==1))&&(u5.p1_4==1))"))))
Formula 13 simplified : !(("(((u5.flag_1_4==1)&&(u11.flag_1_9==1))&&(u5.p1_4==1))" U G"((((((((((i0.u0.flag_0_0==1)&&(i1.u2.flag_0_1==1))&&(u3.flag_0_2==1))&&(u4.flag_0_3==1))&&(u10.flag_0_5==1))&&(u6.flag_0_6==1))&&(u7.flag_0_7==1))&&(u8.flag_0_8==1))&&(u11.flag_0_9==1))&&(u5.p1_4==1))") | F"((((((((((i0.u0.flag_0_0==1)&&(i1.u2.flag_0_1==1))&&(u3.flag_0_2==1))&&(u4.flag_0_3==1))&&(u10.flag_0_5==1))&&(u6.flag_0_6==1))&&(u7.flag_0_7==1))&&(u8.flag_0_8==1))&&(u11.flag_0_9==1))&&(u5.p1_4==1))")
2 unique states visited
2 strongly connected components in search stack
2 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.171876,22256,1,0,7372,99,2320,9005,264,105,19028
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 01:26:21] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 17) 1) (>= (select s0 19) 1)) (>= (select s0 45) 1)) (= (store (store (store (store s0 17 (- (select s0 17) 1)) 16 (+ (select s0 16) 1)) 44 (+ (select s0 44) 1)) 45 (- (select s0 45) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (and (>= (select s0 17) 1) (>= (select s0 19) 1)) (>= (select s0 45) 1)) (= (store (store (store (store s0 17 (- (select s0 17) 1)) 16 (+ (select s0 16) 1)) 44 (+ (select s0 44) 1)) 45 (- (select s0 45) 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-22 01:26:21] [INFO ] Built C files in 1001ms 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 1590110781718

--------------------
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="Dekker-PT-010"
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 Dekker-PT-010, 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 r066-tajo-158922814100306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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