Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258100754.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 PhaseVariation-PT-D02CS010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.5K Apr 12 00:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 00:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 10 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 10 23:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 10 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 9 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 9 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 73K 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 PhaseVariation-PT-D02CS010-00
FORMULA_NAME PhaseVariation-PT-D02CS010-01
FORMULA_NAME PhaseVariation-PT-D02CS010-02
FORMULA_NAME PhaseVariation-PT-D02CS010-03
FORMULA_NAME PhaseVariation-PT-D02CS010-04
FORMULA_NAME PhaseVariation-PT-D02CS010-05
FORMULA_NAME PhaseVariation-PT-D02CS010-06
FORMULA_NAME PhaseVariation-PT-D02CS010-07
FORMULA_NAME PhaseVariation-PT-D02CS010-08
FORMULA_NAME PhaseVariation-PT-D02CS010-09
FORMULA_NAME PhaseVariation-PT-D02CS010-10
FORMULA_NAME PhaseVariation-PT-D02CS010-11
FORMULA_NAME PhaseVariation-PT-D02CS010-12
FORMULA_NAME PhaseVariation-PT-D02CS010-13
FORMULA_NAME PhaseVariation-PT-D02CS010-14
FORMULA_NAME PhaseVariation-PT-D02CS010-15

=== Now, execution of the tool begins

BK_START 1590029973424

[2020-05-21 02:59:36] [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-21 02:59:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 02:59:37] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2020-05-21 02:59:37] [INFO ] Transformed 14 places.
[2020-05-21 02:59:37] [INFO ] Transformed 65 transitions.
[2020-05-21 02:59:37] [INFO ] Parsed PT model containing 14 places and 65 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 84 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 187 steps, including 11 resets, run visited all 37 properties in 7 ms. (steps per millisecond=26 )
[2020-05-21 02:59:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-21 02:59:37] [INFO ] Flatten gal took : 139 ms
FORMULA PhaseVariation-PT-D02CS010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 02:59:37] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 02:59:38] [INFO ] Applying decomposition
[2020-05-21 02:59:38] [INFO ] Flatten gal took : 8 ms
[2020-05-21 02:59:38] [INFO ] Input system was already deterministic with 65 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/graph14335351258492230301.txt, -o, /tmp/graph14335351258492230301.bin, -w, /tmp/graph14335351258492230301.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/graph14335351258492230301.bin, -l, -1, -v, -w, /tmp/graph14335351258492230301.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 9 out of 65 initially.
// Phase 1: matrix 9 rows 14 cols
[2020-05-21 02:59:38] [INFO ] Computed 5 place invariants in 5 ms
inv : cell___1_2__A_ + cell___1_2__B_ + pool__1_2_ = 3
inv : cell___2_1__A_ + cell___2_1__B_ + pool__2_1_ = 3
inv : cell___2_2__A_ + cell___2_2__B_ + pool__2_2_ = 3
inv : pool__1_1_ + pool__1_2_ + pool__2_1_ + pool__2_2_ + size_dot = 12
inv : cell___1_1__A_ + cell___1_1__B_ + pool__1_1_ = 3
Total of 5 invariants.
[2020-05-21 02:59:38] [INFO ] Computed 5 place invariants in 6 ms
[2020-05-21 02:59:38] [INFO ] Decomposing Gal with order
[2020-05-21 02:59:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 02:59:38] [INFO ] Removed a total of 99 redundant transitions.
[2020-05-21 02:59:38] [INFO ] Flatten gal took : 78 ms
[2020-05-21 02:59:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2020-05-21 02:59:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 14 ms
[2020-05-21 02:59:38] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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]
[2020-05-21 02:59:38] [INFO ] Proved 14 variables to be positive in 264 ms
[2020-05-21 02:59:38] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2020-05-21 02:59:38] [INFO ] Computation of disable matrix completed :0/65 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:59:38] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:59:38] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2020-05-21 02:59:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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 12 LTL properties
Checking formula 0 : !((F(G((F("(((u1.cell___1_2__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))"))||((((X(X(F(G((F("(((u1.cell___1_2__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))"))U("(((u2.cell___2_1__A_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))"))))))&&("(u2.cell___2_2__A_>=1)"))&&("(u0.pool__1_1_>=1)"))&&("(u1.run_dot>=1)"))))))
Formula 0 simplified : !FG(F"(((u1.cell___1_2__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))" | ("(u0.pool__1_1_>=1)" & "(u1.run_dot>=1)" & "(u2.cell___2_2__A_>=1)" & XXFG(F"(((u1.cell___1_2__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))" U "(((u2.cell___2_1__A_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))")))
built 3 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1716 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 items max in DFS search stack
10 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.163443,21544,1,0,4175,2326,195,9693,338,11625,6890
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(!(F(X(G(!(X(X(("(((u0.cell___1_1__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))")U(X("(((u2.cell___2_1__A_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))"))))))))))))
Formula 1 simplified : !F!FXG!XX("(((u0.cell___1_1__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))" U X"(((u2.cell___2_1__A_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))")
Computing Next relation with stutter on 1716 deadlock states
18 unique states visited
18 strongly connected components in search stack
19 transitions explored
18 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.167727,21544,1,0,4175,2326,202,9693,338,11625,6896
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((!(F((F(G(X("(((u1.cell___1_2__A_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))"))))&&("(((u1.cell___1_2__A_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))"))))U(G("(((u1.cell___1_2__A_>=1)&&(u2.pool__2_1_>=1))&&(u1.run_dot>=1))")))))
Formula 2 simplified : !X(!F("(((u1.cell___1_2__A_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))" & FGX"(((u1.cell___1_2__A_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))") U G"(((u1.cell___1_2__A_>=1)&&(u2.pool__2_1_>=1))&&(u1.run_dot>=1))")
Computing Next relation with stutter on 1716 deadlock states
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
6 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.234938,22780,1,0,5950,2758,236,12750,343,14581,10900
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G(F("(((u2.cell___2_1__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))")))))
Formula 3 simplified : GF"(((u2.cell___2_1__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))"
Computing Next relation with stutter on 1716 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.274906,23308,1,0,6821,3311,257,14445,345,17741,12476
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA PhaseVariation-PT-D02CS010-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(!(G(X(X((F("(((u2.cell___2_2__A_>=1)&&(u2.pool__2_1_>=1))&&(u1.run_dot>=1))"))&&(X("(((u2.cell___2_2__A_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))"))))))))&&(X(F("(((u2.cell___2_2__B_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))")))))
Formula 4 simplified : !(F!GXX(F"(((u2.cell___2_2__A_>=1)&&(u2.pool__2_1_>=1))&&(u1.run_dot>=1))" & X"(((u2.cell___2_2__A_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))") & XF"(((u2.cell___2_2__B_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))")
Computing Next relation with stutter on 1716 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 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.28684,23564,1,0,7498,3379,311,15095,354,18133,13807
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA PhaseVariation-PT-D02CS010-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(((G(X("(((u0.cell___1_1__A_>=1)&&(u0.pool__1_1_>=1))&&(u1.run_dot>=1))")))&&(F(G("(((u0.cell___1_1__A_>=1)&&(u0.pool__1_1_>=1))&&(u1.run_dot>=1))"))))&&("(((((u2.cell___2_2__B_<1)||(u2.pool__2_1_<1))||(u1.run_dot<1))||(u1.cell___1_2__B_<1))||(u0.pool__1_1_<1))"))))
Formula 5 simplified : !G("(((((u2.cell___2_2__B_<1)||(u2.pool__2_1_<1))||(u1.run_dot<1))||(u1.cell___1_2__B_<1))||(u0.pool__1_1_<1))" & GX"(((u0.cell___1_1__A_>=1)&&(u0.pool__1_1_>=1))&&(u1.run_dot>=1))" & FG"(((u0.cell___1_1__A_>=1)&&(u0.pool__1_1_>=1))&&(u1.run_dot>=1))")
Computing Next relation with stutter on 1716 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 items max in DFS search stack
5 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.350895,24876,1,0,9128,3785,348,19605,359,22071,17846
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F("(((u1.cell___1_2__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))")))
Formula 6 simplified : !F"(((u1.cell___1_2__B_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))"
Computing Next relation with stutter on 1716 deadlock states
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.363204,25140,1,0,9840,3864,352,20878,359,22993,18907
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F((("(((u1.cell___1_2__B_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))")U(X(X(!(X("(((u2.cell___2_2__B_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))"))))))&&(X("(((u1.cell___1_2__B_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))"))))))
Formula 7 simplified : !XF(("(((u1.cell___1_2__B_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))" U XX!X"(((u2.cell___2_2__B_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))") & X"(((u1.cell___1_2__B_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))")
Computing Next relation with stutter on 1716 deadlock states
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 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.3862,25396,1,0,10085,3909,373,21258,365,23251,20039
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X(F(X("(((u2.cell___2_2__A_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))"))))))
Formula 8 simplified : XFX"(((u2.cell___2_2__A_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))"
Computing Next relation with stutter on 1716 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.39231,25660,1,0,10310,3968,381,21589,366,23553,20421
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((!(G(F(X(!(X(G("(((u0.cell___1_1__B_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))"))))))))||((!(X("(((u0.cell___1_1__A_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))")))&&("(((u0.cell___1_1__A_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))")))))
Formula 9 simplified : !G(!GFX!XG"(((u0.cell___1_1__B_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))" | ("(((u0.cell___1_1__A_<1)||(u2.pool__2_2_<1))||(u1.run_dot<1))" & !X"(((u0.cell___1_1__A_>=1)&&(u2.pool__2_2_>=1))&&(u1.run_dot>=1))"))
Computing Next relation with stutter on 1716 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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.39537,25920,1,0,10327,3968,399,21606,366,23554,20475
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(((((X(!(G("(((u1.cell___1_2__A_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))"))))||("(u1.cell___1_2__A_<1)"))||("(u0.pool__1_1_<1)"))||("(u1.run_dot<1)"))||("(u0.cell___1_1__B_<1)"))))
Formula 10 simplified : !G("(u0.cell___1_1__B_<1)" | "(u0.pool__1_1_<1)" | "(u1.cell___1_2__A_<1)" | "(u1.run_dot<1)" | X!G"(((u1.cell___1_2__A_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))")
Computing Next relation with stutter on 1716 deadlock states
22 unique states visited
0 strongly connected components in search stack
24 transitions explored
13 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.422309,25920,1,0,10655,3988,425,22017,369,23749,21701
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA PhaseVariation-PT-D02CS010-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((!(X(G("(((u1.cell___1_2__A_>=1)&&(u0.pool__1_1_>=1))&&(u1.run_dot>=1))"))))||((!(G(F((!(X("(((u0.cell___1_1__A_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))")))&&("(((u1.cell___1_2__A_<1)||(u0.pool__1_1_<1))||(u1.run_dot<1))")))))&&("(((u2.cell___2_1__B_<1)||(u0.pool__1_1_<1))||(u1.run_dot<1))")))))
Formula 11 simplified : !F(!XG"(((u1.cell___1_2__A_>=1)&&(u0.pool__1_1_>=1))&&(u1.run_dot>=1))" | ("(((u2.cell___2_1__B_<1)||(u0.pool__1_1_<1))||(u1.run_dot<1))" & !GF("(((u1.cell___1_2__A_<1)||(u0.pool__1_1_<1))||(u1.run_dot<1))" & !X"(((u0.cell___1_1__A_>=1)&&(u1.pool__1_2_>=1))&&(u1.run_dot>=1))")))
Computing Next relation with stutter on 1716 deadlock states
13 unique states visited
0 strongly connected components in search stack
12 transitions explored
12 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.430688,25920,1,0,10906,3989,477,22330,369,23793,22990
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA PhaseVariation-PT-D02CS010-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 02:59:39] [INFO ] Built C files in 1347ms 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 1590029980252

--------------------
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="PhaseVariation-PT-D02CS010"
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 PhaseVariation-PT-D02CS010, 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 r111-csrt-158961258100754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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