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.r156-oct2-158972913900282.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 RwMutex-PT-r0010w1000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913900282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.4K Apr 12 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 9 23:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 9 23:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 24 05:38 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 RwMutex-PT-r0010w1000-00
FORMULA_NAME RwMutex-PT-r0010w1000-01
FORMULA_NAME RwMutex-PT-r0010w1000-02
FORMULA_NAME RwMutex-PT-r0010w1000-03
FORMULA_NAME RwMutex-PT-r0010w1000-04
FORMULA_NAME RwMutex-PT-r0010w1000-05
FORMULA_NAME RwMutex-PT-r0010w1000-06
FORMULA_NAME RwMutex-PT-r0010w1000-07
FORMULA_NAME RwMutex-PT-r0010w1000-08
FORMULA_NAME RwMutex-PT-r0010w1000-09
FORMULA_NAME RwMutex-PT-r0010w1000-10
FORMULA_NAME RwMutex-PT-r0010w1000-11
FORMULA_NAME RwMutex-PT-r0010w1000-12
FORMULA_NAME RwMutex-PT-r0010w1000-13
FORMULA_NAME RwMutex-PT-r0010w1000-14
FORMULA_NAME RwMutex-PT-r0010w1000-15

=== Now, execution of the tool begins

BK_START 1589887816231

[2020-05-19 11:30:17] [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-19 11:30:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 11:30:17] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2020-05-19 11:30:18] [INFO ] Transformed 2030 places.
[2020-05-19 11:30:18] [INFO ] Transformed 2020 transitions.
[2020-05-19 11:30:18] [INFO ] Parsed PT model containing 2030 places and 2020 transitions in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 4538 ms. (steps per millisecond=22 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2020 rows 2030 cols
[2020-05-19 11:30:22] [INFO ] Computed 1020 place invariants in 313 ms
[2020-05-19 11:30:23] [INFO ] [Real]Absence check using 1020 positive place invariants in 58 ms returned unsat
[2020-05-19 11:30:23] [INFO ] [Real]Absence check using 1020 positive place invariants in 43 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-19 11:30:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-19 11:30:23] [INFO ] Flatten gal took : 322 ms
FORMULA RwMutex-PT-r0010w1000-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w1000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 11:30:24] [INFO ] Flatten gal took : 218 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 11:30:24] [INFO ] Applying decomposition
[2020-05-19 11:30:24] [INFO ] Flatten gal took : 251 ms
[2020-05-19 11:30:24] [INFO ] Input system was already deterministic with 2020 transitions.
[2020-05-19 11:30:24] [INFO ] Too many transitions (2020) to apply POR reductions. Disabling POR matrices.
[2020-05-19 11:30:25] [INFO ] Built C files in 1044ms 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]
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/graph407796911154119997.txt, -o, /tmp/graph407796911154119997.bin, -w, /tmp/graph407796911154119997.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/graph407796911154119997.bin, -l, -1, -v, -w, /tmp/graph407796911154119997.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 11:30:25] [INFO ] Decomposing Gal with order
[2020-05-19 11:30:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 11:30:26] [INFO ] Removed a total of 19980 redundant transitions.
[2020-05-19 11:30:26] [INFO ] Flatten gal took : 674 ms
[2020-05-19 11:30:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1398 labels/synchronizations in 265 ms.
[2020-05-19 11:30:27] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 56 ms
[2020-05-19 11:30:27] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 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 : !((((!(X(F("(i193.u176.p1299>=1)"))))U("(i5.u994.p1993>=1)"))&&(F("(i193.u176.p1299>=1)"))))
Formula 0 simplified : !(F"(i193.u176.p1299>=1)" & (!XF"(i193.u176.p1299>=1)" U "(i5.u994.p1993>=1)"))
built 301 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
built 142 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
194 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,2.21652,60456,1,0,22896,1947,25011,13277,76,1706,207448
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(i3.u286.p1506>=1)")U((F(G(F(X((G("(i3.u745.p1524>=1)"))&&(X("(i4.u171.p1149>=1)")))))))&&("((i3.u286.p1506>=1)||(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(u960.p912>=1)))"))))
Formula 1 simplified : !("(i3.u286.p1506>=1)" U ("((i3.u286.p1506>=1)||(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(u960.p912>=1)))" & FGFX(G"(i3.u745.p1524>=1)" & X"(i4.u171.p1149>=1)")))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
13 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,2.35772,65416,1,0,23618,1947,25262,13768,76,1706,213763
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G(F(G("(i228.u303.p1539<1)"))))))
Formula 2 simplified : GFG"(i228.u303.p1539<1)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
12 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,2.47128,70696,1,0,24081,1947,25448,14205,76,1706,217877
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F(G((X(("(((((((((((i3.u7.p1022<1)||(i193.u627.p1023<1))||(i4.u8.p1024<1))||(i228.u741.p1025<1))||(i5.u9.p1026<1))||(i260.u842.p1027<1))||(i6.u10.p1028<1))||(i7.u11.p1029<1))||(i0.u1.p1030<1))||(i20.u49.p1031<1))||(i5.u983.p950<1))")U("(i193.u775.p1580>=1)")))||("(i193.u775.p1580>=1)"))))))
Formula 3 simplified : FG("(i193.u775.p1580>=1)" | X("(((((((((((i3.u7.p1022<1)||(i193.u627.p1023<1))||(i4.u8.p1024<1))||(i228.u741.p1025<1))||(i5.u9.p1026<1))||(i260.u842.p1027<1))||(i6.u10.p1028<1))||(i7.u11.p1029<1))||(i0.u1.p1030<1))||(i20.u49.p1031<1))||(i5.u983.p950<1))" U "(i193.u775.p1580>=1)"))
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
7 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,2.55315,74368,1,0,35201,1947,25514,18910,78,1706,253005
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i20.u384.p654>=1))")U("(u711.p1468>=1)")))))
Formula 4 simplified : G("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i20.u384.p654>=1))" U "(u711.p1468>=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,2.57503,74884,1,0,36155,1947,25558,19367,78,1706,256254
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(!(G((!(F(X(G("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i0.u520.p907>=1))")))))U("(i6.u142.p1144>=1)"))))))
Formula 5 simplified : !X!G(!FXG"(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i0.u520.p907>=1))" U "(i6.u142.p1144>=1)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
9 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,2.65553,77504,1,0,39861,1947,25659,22499,78,1706,281871
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((G(G("(u793.p1612>=1)")))&&(("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i7.u859.p725>=1))")U("(i4.u76.p1138>=1)")))))
Formula 6 simplified : !X(G"(u793.p1612>=1)" & ("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i7.u859.p725>=1))" U "(i4.u76.p1138>=1)"))
4 unique states visited
4 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,2.6712,77944,1,0,40013,1947,25714,22500,78,1706,284236
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X(F("((((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(u385.p655>=1))||(u245.p1428>=1))")))))
Formula 7 simplified : XF"((((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(u385.p655>=1))||(u245.p1428>=1))"
4 unique states visited
4 strongly connected components in search stack
4 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,2.7039,79528,1,0,43701,1947,25735,22766,78,1706,301122
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(((((((((((((!(F("(u309.p1546>=1)")))||("(i3.u7.p1022<1)"))||("(i193.u627.p1023<1)"))||("(i4.u8.p1024<1)"))||("(i228.u741.p1025<1)"))||("(i5.u9.p1026<1)"))||("(i260.u842.p1027<1)"))||("(i6.u10.p1028<1)"))||("(i7.u11.p1029<1)"))||("(i0.u1.p1030<1)"))||("(i20.u49.p1031<1)"))||("(i228.u717.p461<1)"))||("(u891.p1804<1)"))))
Formula 8 simplified : !X("(i0.u1.p1030<1)" | "(i3.u7.p1022<1)" | "(i4.u8.p1024<1)" | "(i5.u9.p1026<1)" | "(i6.u10.p1028<1)" | "(i7.u11.p1029<1)" | "(i20.u49.p1031<1)" | "(i193.u627.p1023<1)" | "(i228.u717.p461<1)" | "(i228.u741.p1025<1)" | "(i260.u842.p1027<1)" | "(u891.p1804<1)" | !F"(u309.p1546>=1)")
2 unique states visited
0 strongly connected components in search stack
1 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,2.71879,79996,1,0,43701,1947,25799,22766,78,1706,301428
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w1000-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(i7.u975.p1956>=1)")U(!(G("((((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(u63.p97>=1))||(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i6.u35.p54>=1)))")))))
Formula 9 simplified : !("(i7.u975.p1956>=1)" U !G"((((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(u63.p97>=1))||(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i6.u35.p54>=1)))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,2.72532,79996,1,0,43701,1947,25835,22766,78,1706,302399
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w1000-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(G(X(G("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i7.u244.p407>=1))"))))))
Formula 10 simplified : GXG"(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i7.u244.p407>=1))"
2 unique states visited
0 strongly connected components in search stack
1 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,2.73529,79996,1,0,43702,1947,25877,22766,78,1706,302960
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w1000-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(G(F(X(("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i5.u630.p307>=1))")U(X((X("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i4.u641.p329>=1))"))U(F(("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i4.u641.p329>=1))")U(F("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i6.u928.p854>=1))"))))))))))))
Formula 11 simplified : GFX("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i5.u630.p307>=1))" U X(X"(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i4.u641.p329>=1))" U F("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i4.u641.p329>=1))" U F"(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i6.u928.p854>=1))")))
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
5 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,2.7869,80192,1,0,44005,1947,25962,22767,80,1706,306112
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F((!(G("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(u950.p890>=1))")))U(!(G("(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i3.u557.p980>=1))")))))))
Formula 12 simplified : !GF(!G"(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(u950.p890>=1))" U !G"(((((((((((i3.u7.p1022>=1)&&(i193.u627.p1023>=1))&&(i4.u8.p1024>=1))&&(i228.u741.p1025>=1))&&(i5.u9.p1026>=1))&&(i260.u842.p1027>=1))&&(i6.u10.p1028>=1))&&(i7.u11.p1029>=1))&&(i0.u1.p1030>=1))&&(i20.u49.p1031>=1))&&(i3.u557.p980>=1))")
2 unique states visited
0 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,2.80294,80192,1,0,44005,1947,26004,22767,80,1706,306699
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA RwMutex-PT-r0010w1000-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X(X("(u595.p1260>=1)")))))
Formula 13 simplified : !FXX"(u595.p1260>=1)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
11 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,2.90554,83888,1,0,44620,1947,26262,23900,80,1706,309743
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA RwMutex-PT-r0010w1000-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589887830539

--------------------
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="RwMutex-PT-r0010w1000"
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 RwMutex-PT-r0010w1000, 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 r156-oct2-158972913900282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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