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.r210-tajo-159033475900570.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 ShieldPPPt-PT-001A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475900570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.1K May 14 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 13 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 08:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 7.4K May 12 20:42 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 ShieldPPPt-PT-001A-00
FORMULA_NAME ShieldPPPt-PT-001A-01
FORMULA_NAME ShieldPPPt-PT-001A-02
FORMULA_NAME ShieldPPPt-PT-001A-03
FORMULA_NAME ShieldPPPt-PT-001A-04
FORMULA_NAME ShieldPPPt-PT-001A-05
FORMULA_NAME ShieldPPPt-PT-001A-06
FORMULA_NAME ShieldPPPt-PT-001A-07
FORMULA_NAME ShieldPPPt-PT-001A-08
FORMULA_NAME ShieldPPPt-PT-001A-09
FORMULA_NAME ShieldPPPt-PT-001A-10
FORMULA_NAME ShieldPPPt-PT-001A-11
FORMULA_NAME ShieldPPPt-PT-001A-12
FORMULA_NAME ShieldPPPt-PT-001A-13
FORMULA_NAME ShieldPPPt-PT-001A-14
FORMULA_NAME ShieldPPPt-PT-001A-15

=== Now, execution of the tool begins

BK_START 1590606127657

[2020-05-27 19:02:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 19:02:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 19:02:10] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-05-27 19:02:10] [INFO ] Transformed 28 places.
[2020-05-27 19:02:10] [INFO ] Transformed 21 transitions.
[2020-05-27 19:02:10] [INFO ] Found NUPN structural information;
[2020-05-27 19:02:10] [INFO ] Parsed PT model containing 28 places and 21 transitions in 64 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 170 ms. (steps per millisecond=588 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 20 rows 28 cols
[2020-05-27 19:02:10] [INFO ] Computed 12 place invariants in 3 ms
[2020-05-27 19:02:10] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 19:02:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 19:02:10] [INFO ] Flatten gal took : 38 ms
FORMULA ShieldPPPt-PT-001A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 19:02:10] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 19:02:10] [INFO ] Applying decomposition
[2020-05-27 19:02:10] [INFO ] Flatten gal took : 5 ms
[2020-05-27 19:02:10] [INFO ] Input system was already deterministic with 20 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 20 rows 28 cols
[2020-05-27 19:02:11] [INFO ] Computed 12 place invariants in 3 ms
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p15 + p18 + p19 = 1
inv : p0 + p10 + p13 + p14 = 1
inv : p0 + p24 + p25 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p26 + p27 = 1
inv : p0 + p10 + p11 + p12 = 1
inv : p0 + p5 + p8 + p9 = 1
Total of 12 invariants.
[2020-05-27 19:02:11] [INFO ] Computed 12 place invariants in 17 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/graph12784790639582393614.txt, -o, /tmp/graph12784790639582393614.bin, -w, /tmp/graph12784790639582393614.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/graph12784790639582393614.bin, -l, -1, -v, -w, /tmp/graph12784790639582393614.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 19:02:11] [INFO ] Decomposing Gal with order
[2020-05-27 19:02:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 19:02:11] [INFO ] Removed a total of 3 redundant transitions.
[2020-05-27 19:02:11] [INFO ] Flatten gal took : 132 ms
[2020-05-27 19:02:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2020-05-27 19:02:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-27 19:02:11] [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 13 LTL properties
Checking formula 0 : !((F(X(F(G(X(F(G((F("((u3.p13==1)&&(u8.p27==1))"))U(!(X("(i0.u0.p0==1)"))))))))))))
Formula 0 simplified : !FXFGXFG(F"((u3.p13==1)&&(u8.p27==1))" U !X"(i0.u0.p0==1)")
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-27 19:02:11] [INFO ] Proved 28 variables to be positive in 408 ms
[2020-05-27 19:02:11] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2020-05-27 19:02:11] [INFO ] Computation of disable matrix completed :0/20 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:02:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:02:11] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2020-05-27 19:02:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
0 strongly connected components in search stack
6 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.044338,18292,1,0,1705,149,312,1827,126,497,2896
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001A-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(((!(G((G("((u2.p5==1)&&(i1.u6.p22==1))"))&&(F("((u4.p17==1)&&(u4.p19==1))")))))||("(u4.p17!=1)"))||("(u4.p19!=1)")))))
Formula 1 simplified : !XG("(u4.p17!=1)" | "(u4.p19!=1)" | !G(G"((u2.p5==1)&&(i1.u6.p22==1))" & F"((u4.p17==1)&&(u4.p19==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.048633,18868,1,0,2148,151,398,2262,135,550,3717
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((X(("(i1.u6.p22==1)")U(X(G("((i1.u1.p4==1)&&(i1.u6.p23==1))")))))||(F("(i1.u6.p22!=1)")))))
Formula 2 simplified : !X(X("(i1.u6.p22==1)" U XG"((i1.u1.p4==1)&&(i1.u6.p23==1))") | F"(i1.u6.p22!=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.051544,19096,1,0,2148,151,401,2262,135,550,3724
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001A-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(X((X("((i0.u0.p2!=1)||(u3.p10!=1))"))&&(F("((u2.p8==1)&&(i0.u7.p25==1))")))))U((X(G("(u8.p26==1)")))U(X("(u8.p26==1)")))))
Formula 3 simplified : !(!X(X"((i0.u0.p2!=1)||(u3.p10!=1))" & F"((u2.p8==1)&&(i0.u7.p25==1))") U (XG"(u8.p26==1)" U X"(u8.p26==1)"))
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.083513,20356,1,0,5113,154,491,5233,135,597,8295
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G("((i0.u0.p1==1)&&(i0.u7.p24==1))"))))
Formula 4 simplified : !XG"((i0.u0.p1==1)&&(i0.u7.p24==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.085318,20884,1,0,5131,154,514,5250,135,598,8380
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((F("((i0.u0.p0==1)||(i1.u6.p22==1))"))&&(X("(i0.u0.p0==1)")))U("(((i1.u1.p3==1)&&(u8.p26==1))||((u2.p7==1)&&(u2.p9==1)))")))
Formula 5 simplified : !((F"((i0.u0.p0==1)||(i1.u6.p22==1))" & X"(i0.u0.p0==1)") U "(((i1.u1.p3==1)&&(u8.p26==1))||((u2.p7==1)&&(u2.p9==1)))")
11 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 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.114644,21144,1,0,7295,154,568,7261,135,621,12622
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((F("((u2.p8==1)&&(i0.u7.p25==1))"))U("((u4.p17!=1)||(u4.p19!=1))"))))
Formula 6 simplified : !G(F"((u2.p8==1)&&(i0.u7.p25==1))" U "((u4.p17!=1)||(u4.p19!=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.118875,21408,1,0,7897,154,575,7904,135,639,13590
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(((!(F("((u3.p12==1)&&(u3.p14==1))")))||("((u3.p12==1)&&(u3.p14==1))"))U(X(("(i0.u7.p24==1)")U("((u2.p7==1)&&(u2.p9==1))"))))))
Formula 7 simplified : ("((u3.p12==1)&&(u3.p14==1))" | !F"((u3.p12==1)&&(u3.p14==1))") U X("(i0.u7.p24==1)" U "((u2.p7==1)&&(u2.p9==1))")
6 unique states visited
5 strongly connected components in search stack
7 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.123129,21664,1,0,8454,155,632,8471,135,687,14615
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((((((!(G("(i0.u7.p24==1)")))&&(!(F(!(X("((u4.p18==1)&&(i0.u7.p25==1))"))))))&&("(u3.p11==1)"))&&("(u5.p21==1)"))&&("(u3.p12==1)"))&&("(u3.p14==1)"))))
Formula 8 simplified : !F("(u3.p11==1)" & "(u3.p12==1)" & "(u3.p14==1)" & "(u5.p21==1)" & !G"(i0.u7.p24==1)" & !F!X"((u4.p18==1)&&(i0.u7.p25==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.127819,21920,1,0,8939,157,681,8894,142,699,15596
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(G("((i1.u1.p3==1)&&(u8.p26==1))")))&&(X(G("((i1.u1.p3==1)&&(u8.p26==1))")))))
Formula 9 simplified : !(FG"((i1.u1.p3==1)&&(u8.p26==1))" & XG"((i1.u1.p3==1)&&(u8.p26==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.145587,22144,1,0,8939,157,698,8894,142,699,15604
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((G(F("(i1.u6.p22==1)")))||(X("(i1.u6.p22==1)"))))
Formula 10 simplified : !(GF"(i1.u6.p22==1)" | X"(i1.u6.p22==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.147326,22144,1,0,9155,157,717,9122,142,699,16065
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F("((u2.p7!=1)||(u2.p9!=1))"))U(X((((F("((u4.p18!=1)||(i0.u7.p25!=1))"))&&(!(G("((u2.p7==1)&&(u2.p9==1))"))))&&("(u2.p7==1)"))&&("(u2.p9==1)")))))
Formula 11 simplified : !(F"((u2.p7!=1)||(u2.p9!=1))" U X("(u2.p7==1)" & "(u2.p9==1)" & F"((u4.p18!=1)||(i0.u7.p25!=1))" & !G"((u2.p7==1)&&(u2.p9==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.155126,22672,1,0,10155,158,779,10251,145,719,17992
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X(X(F(!(X(!(G(!(G(F("(u5.p20==1)")))))))))))))
Formula 12 simplified : !XXXF!X!G!GF"(u5.p20==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.16235,22672,1,0,10819,158,801,10896,145,734,19045
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-27 19:02:14] [INFO ] Computing symmetric co enabling matrix : 20 transitions.
[2020-05-27 19:02:14] [INFO ] Computation of co-enabling matrix(9/20) took 377 ms. Total solver calls (SAT/UNSAT): 43(3/40)
[2020-05-27 19:02:14] [INFO ] Computation of Finished co-enabling matrix. took 668 ms. Total solver calls (SAT/UNSAT): 54(6/48)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 19:02:14] [INFO ] Built C files in 3875ms 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 1590606135741

--------------------
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="ShieldPPPt-PT-001A"
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 ShieldPPPt-PT-001A, 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 r210-tajo-159033475900570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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