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-158922814100266.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 DatabaseWithMutex-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814100266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.5K Mar 31 05:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 31 05:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 29 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 29 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 28 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 27 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 29K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-PT-02-00
FORMULA_NAME DatabaseWithMutex-PT-02-01
FORMULA_NAME DatabaseWithMutex-PT-02-02
FORMULA_NAME DatabaseWithMutex-PT-02-03
FORMULA_NAME DatabaseWithMutex-PT-02-04
FORMULA_NAME DatabaseWithMutex-PT-02-05
FORMULA_NAME DatabaseWithMutex-PT-02-06
FORMULA_NAME DatabaseWithMutex-PT-02-07
FORMULA_NAME DatabaseWithMutex-PT-02-08
FORMULA_NAME DatabaseWithMutex-PT-02-09
FORMULA_NAME DatabaseWithMutex-PT-02-10
FORMULA_NAME DatabaseWithMutex-PT-02-11
FORMULA_NAME DatabaseWithMutex-PT-02-12
FORMULA_NAME DatabaseWithMutex-PT-02-13
FORMULA_NAME DatabaseWithMutex-PT-02-14
FORMULA_NAME DatabaseWithMutex-PT-02-15

=== Now, execution of the tool begins

BK_START 1590107202901

[2020-05-22 00:26:44] [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 00:26:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 00:26:44] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-05-22 00:26:44] [INFO ] Transformed 38 places.
[2020-05-22 00:26:44] [INFO ] Transformed 32 transitions.
[2020-05-22 00:26:44] [INFO ] Parsed PT model containing 38 places and 32 transitions in 58 ms.
[2020-05-22 00:26:44] [INFO ] Reduced 2 identical enabling conditions.
[2020-05-22 00:26:44] [INFO ] Reduced 2 identical enabling conditions.
[2020-05-22 00:26:44] [INFO ] Reduced 2 identical enabling conditions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 78 steps, including 0 resets, run visited all 41 properties in 3 ms. (steps per millisecond=26 )
[2020-05-22 00:26:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 00:26:44] [INFO ] Flatten gal took : 29 ms
FORMULA DatabaseWithMutex-PT-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 00:26:44] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 00:26:44] [INFO ] Applying decomposition
[2020-05-22 00:26:44] [INFO ] Flatten gal took : 11 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/graph9929475375543566973.txt, -o, /tmp/graph9929475375543566973.bin, -w, /tmp/graph9929475375543566973.weights], workingDir=null]
[2020-05-22 00:26:44] [INFO ] Input system was already deterministic with 32 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph9929475375543566973.bin, -l, -1, -v, -w, /tmp/graph9929475375543566973.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 00:26:44] [INFO ] Decomposing Gal with order
[2020-05-22 00:26:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 00:26:44] [INFO ] Removed a total of 2 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 38 cols
[2020-05-22 00:26:45] [INFO ] Computed 10 place invariants in 10 ms
inv : MesBuffReply_2_1 + Modify_2_1 + Modify_1_1 + RecBuff_2_1 + updating_2_1 + Acknowledge_2_1 + Mutex_1 + Active_2_1 + Message_2_1 = 1
inv : updating_1_1 + updating_1_2 + all_passive_1 = 1
inv : -Modify_2_1 - WaitMutex_2_2 - all_active_2 + Active_1_2 + Mutex_2 - Active_2_1 + Modify_1_2 - WaitMutex_2_1 = 0
inv : Modify_2_2 + Modify_2_1 + MesBuffReply_1_2 + WaitMutex_2_2 + Message_1_2 + all_active_2 + Acknowledge_1_2 + updating_1_2 + RecBuff_1_2 + Active_2_1 + WaitMutex_2_1 = 1
inv : all_passive_2 + updating_2_1 + updating_2_2 = 1
inv : Modify_2_1 + Modify_1_1 + Active_1_1 + Mutex_1 + Active_2_1 = 1
inv : -Modify_2_1 + Message_2_2 - WaitMutex_2_2 - all_active_2 + Acknowledge_2_2 + Mutex_2 + RecBuff_2_2 + updating_2_2 - Active_2_1 + Modify_1_2 + MesBuffReply_2_2 - WaitMutex_2_1 = 0
inv : RecBuff_1_1 + updating_1_1 + Acknowledge_1_1 - Active_2_1 + MesBuffReply_1_1 + Message_1_1 = 0
inv : Modify_2_2 + Modify_2_1 + WaitMutex_2_2 + all_active_2 + Active_2_2 + Active_2_1 + WaitMutex_2_1 = 1
inv : WaitMutex_1_1 + all_active_1 + WaitMutex_2_2 + WaitMutex_1_2 + all_active_2 - Mutex_2 - Mutex_1 + WaitMutex_2_1 = 0
Total of 10 invariants.
[2020-05-22 00:26:45] [INFO ] Computed 10 place invariants in 11 ms
[2020-05-22 00:26:45] [INFO ] Flatten gal took : 58 ms
[2020-05-22 00:26:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-22 00:26:45] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-22 00:26:45] [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]

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(X(((!(G("((((u15.Message_1_1>=1)||(i2.u6.Message_2_1>=1))||(i0.u10.Message_2_2>=1))||(i5.u8.Message_1_2>=1))")))||(G("((((i3.u1.updating_2_1>=1)||(i5.u14.updating_1_1>=1))||(i5.u14.updating_1_2>=1))||(i3.u1.updating_2_2>=1))")))||("(((((i5.u8.RecBuff_1_2<1)||(i5.u14.all_passive_1<1))&&((i3.u1.all_passive_2<1)||(i0.u10.RecBuff_2_2<1)))&&((u15.RecBuff_1_1<1)||(i5.u14.all_passive_1<1)))&&((i3.u1.all_passive_2<1)||(i2.u6.RecBuff_2_1<1)))")))))
Formula 0 simplified : !XX("(((((i5.u8.RecBuff_1_2<1)||(i5.u14.all_passive_1<1))&&((i3.u1.all_passive_2<1)||(i0.u10.RecBuff_2_2<1)))&&((u15.RecBuff_1_1<1)||(i5.u14.all_passive_1<1)))&&((i3.u1.all_passive_2<1)||(i2.u6.RecBuff_2_1<1)))" | !G"((((u15.Message_1_1>=1)||(i2.u6.Message_2_1>=1))||(i0.u10.Message_2_2>=1))||(i5.u8.Message_1_2>=1))" | G"((((i3.u1.updating_2_1>=1)||(i5.u14.updating_1_1>=1))||(i5.u14.updating_1_2>=1))||(i3.u1.updating_2_2>=1))")
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-22 00:26:45] [INFO ] Proved 38 variables to be positive in 136 ms
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-22 00:26:45] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2020-05-22 00:26:45] [INFO ] Computation of disable matrix completed :0/32 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 00:26:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
[2020-05-22 00:26:45] [INFO ] Computing symmetric may enable matrix : 32 transitions.
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
[2020-05-22 00:26:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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.029697,16868,1,0,462,65,410,467,72,116,1070
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(F(X(X(((((G("((((i3.u1.updating_2_1>=1)||(i5.u14.updating_1_1>=1))||(i5.u14.updating_1_2>=1))||(i3.u1.updating_2_2>=1))"))||("(u15.Message_1_1>=1)"))||("(i2.u6.Message_2_1>=1)"))||("(i0.u10.Message_2_2>=1)"))||("(i5.u8.Message_1_2>=1)"))))))))
Formula 1 simplified : !XGFXX("(i0.u10.Message_2_2>=1)" | "(i2.u6.Message_2_1>=1)" | "(i5.u8.Message_1_2>=1)" | "(u15.Message_1_1>=1)" | G"((((i3.u1.updating_2_1>=1)||(i5.u14.updating_1_1>=1))||(i5.u14.updating_1_2>=1))||(i3.u1.updating_2_2>=1))")
4 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.042166,18456,1,0,1774,80,590,1543,78,149,4944
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G("((((i1.u0.Modify_2_2<1)&&(i2.u12.Modify_2_1<1))&&(i2.u4.Modify_1_1<1))&&(i0.u13.Modify_1_2<1))"))||((X("((i0.u2.all_active_1<1)&&(i1.u3.all_active_2<1))"))U(("((i0.u2.all_active_1>=1)||(i1.u3.all_active_2>=1))")U("(((((((((i0.u2.WaitMutex_1_2>=1)&&(i1.u0.Mutex_2>=1))||((i1.u3.WaitMutex_2_2>=1)&&(i1.u0.Mutex_2>=1)))||((i0.u2.WaitMutex_1_1>=1)&&(i2.u12.Mutex_1>=1)))||((i2.u12.Mutex_1>=1)&&(i1.u3.WaitMutex_2_1>=1)))||(i1.u0.Modify_2_2>=1))||(i2.u12.Modify_2_1>=1))||(i2.u4.Modify_1_1>=1))||(i0.u13.Modify_1_2>=1))")))))
Formula 2 simplified : !(G"((((i1.u0.Modify_2_2<1)&&(i2.u12.Modify_2_1<1))&&(i2.u4.Modify_1_1<1))&&(i0.u13.Modify_1_2<1))" | (X"((i0.u2.all_active_1<1)&&(i1.u3.all_active_2<1))" U ("((i0.u2.all_active_1>=1)||(i1.u3.all_active_2>=1))" U "(((((((((i0.u2.WaitMutex_1_2>=1)&&(i1.u0.Mutex_2>=1))||((i1.u3.WaitMutex_2_2>=1)&&(i1.u0.Mutex_2>=1)))||((i0.u2.WaitMutex_1_1>=1)&&(i2.u12.Mutex_1>=1)))||((i2.u12.Mutex_1>=1)&&(i1.u3.WaitMutex_2_1>=1)))||(i1.u0.Modify_2_2>=1))||(i2.u12.Modify_2_1>=1))||(i2.u4.Modify_1_1>=1))||(i0.u13.Modify_1_2>=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,0.049588,19444,1,0,1782,80,794,1559,78,149,5147
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(!(F("(((((i3.u1.updating_2_1>=1)||(i5.u14.updating_1_1>=1))||(i5.u14.updating_1_2>=1))||(i3.u1.updating_2_2>=1))||(((((i0.u2.WaitMutex_1_2<1)||(i1.u0.Mutex_2<1))&&((i1.u3.WaitMutex_2_2<1)||(i1.u0.Mutex_2<1)))&&((i0.u2.WaitMutex_1_1<1)||(i2.u12.Mutex_1<1)))&&((i2.u12.Mutex_1<1)||(i1.u3.WaitMutex_2_1<1))))"))))))
Formula 3 simplified : !XG!F"(((((i3.u1.updating_2_1>=1)||(i5.u14.updating_1_1>=1))||(i5.u14.updating_1_2>=1))||(i3.u1.updating_2_2>=1))||(((((i0.u2.WaitMutex_1_2<1)||(i1.u0.Mutex_2<1))&&((i1.u3.WaitMutex_2_2<1)||(i1.u0.Mutex_2<1)))&&((i0.u2.WaitMutex_1_1<1)||(i2.u12.Mutex_1<1)))&&((i2.u12.Mutex_1<1)||(i1.u3.WaitMutex_2_1<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.055634,19444,1,0,2200,81,835,1987,79,156,6784
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(F(X(F(X(X((F("((((i3.u1.updating_2_1>=1)||(i5.u14.updating_1_1>=1))||(i5.u14.updating_1_2>=1))||(i3.u1.updating_2_2>=1))"))&&(G(!(F(G("((i0.u2.all_active_1>=1)||(i1.u3.all_active_2>=1))"))))))))))))))
Formula 4 simplified : !G!FXFXX(F"((((i3.u1.updating_2_1>=1)||(i5.u14.updating_1_1>=1))||(i5.u14.updating_1_2>=1))||(i3.u1.updating_2_2>=1))" & G!FG"((i0.u2.all_active_1>=1)||(i1.u3.all_active_2>=1))")
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 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.068205,20212,1,0,4058,82,890,3528,79,162,11798
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(!(X(X(!(F(X(G("((((i1.u0.Modify_2_2>=1)||(i2.u12.Modify_2_1>=1))||(i2.u4.Modify_1_1>=1))||(i0.u13.Modify_1_2>=1))")))))))))))
Formula 5 simplified : !GX!XX!FXG"((((i1.u0.Modify_2_2>=1)||(i2.u12.Modify_2_1>=1))||(i2.u4.Modify_1_1>=1))||(i0.u13.Modify_1_2>=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,0.074394,20476,1,0,4645,82,916,4149,79,162,13410
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G(X((F("((((i3.u5.MesBuffReply_2_2<1)&&(i3.u9.MesBuffReply_2_1<1))&&(i5.u11.MesBuffReply_1_1<1))&&(u7.MesBuffReply_1_2<1))"))&&(X(X("(((((i5.u8.RecBuff_1_2>=1)&&(i5.u14.all_passive_1>=1))||((i3.u1.all_passive_2>=1)&&(i0.u10.RecBuff_2_2>=1)))||((u15.RecBuff_1_1>=1)&&(i5.u14.all_passive_1>=1)))||((i3.u1.all_passive_2>=1)&&(i2.u6.RecBuff_2_1>=1)))"))))))U(((((F("(((((i5.u8.RecBuff_1_2>=1)&&(i5.u14.all_passive_1>=1))||((i3.u1.all_passive_2>=1)&&(i0.u10.RecBuff_2_2>=1)))||((u15.RecBuff_1_1>=1)&&(i5.u14.all_passive_1>=1)))||((i3.u1.all_passive_2>=1)&&(i2.u6.RecBuff_2_1>=1)))"))||("((i5.u8.RecBuff_1_2>=1)&&(i5.u14.all_passive_1>=1))"))||("((i3.u1.all_passive_2>=1)&&(i0.u10.RecBuff_2_2>=1))"))||("((u15.RecBuff_1_1>=1)&&(i5.u14.all_passive_1>=1))"))||("((i3.u1.all_passive_2>=1)&&(i2.u6.RecBuff_2_1>=1))"))))
Formula 6 simplified : !(GX(F"((((i3.u5.MesBuffReply_2_2<1)&&(i3.u9.MesBuffReply_2_1<1))&&(i5.u11.MesBuffReply_1_1<1))&&(u7.MesBuffReply_1_2<1))" & XX"(((((i5.u8.RecBuff_1_2>=1)&&(i5.u14.all_passive_1>=1))||((i3.u1.all_passive_2>=1)&&(i0.u10.RecBuff_2_2>=1)))||((u15.RecBuff_1_1>=1)&&(i5.u14.all_passive_1>=1)))||((i3.u1.all_passive_2>=1)&&(i2.u6.RecBuff_2_1>=1)))") U ("((i3.u1.all_passive_2>=1)&&(i0.u10.RecBuff_2_2>=1))" | "((i3.u1.all_passive_2>=1)&&(i2.u6.RecBuff_2_1>=1))" | "((i5.u8.RecBuff_1_2>=1)&&(i5.u14.all_passive_1>=1))" | "((u15.RecBuff_1_1>=1)&&(i5.u14.all_passive_1>=1))" | F"(((((i5.u8.RecBuff_1_2>=1)&&(i5.u14.all_passive_1>=1))||((i3.u1.all_passive_2>=1)&&(i0.u10.RecBuff_2_2>=1)))||((u15.RecBuff_1_1>=1)&&(i5.u14.all_passive_1>=1)))||((i3.u1.all_passive_2>=1)&&(i2.u6.RecBuff_2_1>=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.078662,20720,1,0,4884,82,974,4352,79,162,14566
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F("(((((i0.u2.WaitMutex_1_2>=1)&&(i1.u0.Mutex_2>=1))||((i1.u3.WaitMutex_2_2>=1)&&(i1.u0.Mutex_2>=1)))||((i0.u2.WaitMutex_1_1>=1)&&(i2.u12.Mutex_1>=1)))||((i2.u12.Mutex_1>=1)&&(i1.u3.WaitMutex_2_1>=1)))"))))
Formula 7 simplified : !XF"(((((i0.u2.WaitMutex_1_2>=1)&&(i1.u0.Mutex_2>=1))||((i1.u3.WaitMutex_2_2>=1)&&(i1.u0.Mutex_2>=1)))||((i0.u2.WaitMutex_1_1>=1)&&(i2.u12.Mutex_1>=1)))||((i2.u12.Mutex_1>=1)&&(i1.u3.WaitMutex_2_1>=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,0.079412,20720,1,0,4884,82,987,4352,79,162,14580
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((((!(F("((i1.u3.all_active_2>=1)||(i5.u14.updating_1_1<1))")))||(!(X("(i1.u3.all_active_2>=1)"))))U(F("((i1.u0.Active_2_2>=1)&&(u7.Acknowledge_1_2>=1))")))||(F("(i5.u14.updating_1_1>=1)"))))
Formula 8 simplified : !(((!F"((i1.u3.all_active_2>=1)||(i5.u14.updating_1_1<1))" | !X"(i1.u3.all_active_2>=1)") U F"((i1.u0.Active_2_2>=1)&&(u7.Acknowledge_1_2>=1))") | F"(i5.u14.updating_1_1>=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.080929,20720,1,0,4991,82,1021,4462,79,162,15031
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G("(i0.u2.all_active_1>=1)"))&&(X("((i0.u2.WaitMutex_1_1>=1)&&(i2.u12.Mutex_1>=1))"))))
Formula 9 simplified : !(G"(i0.u2.all_active_1>=1)" & X"((i0.u2.WaitMutex_1_1>=1)&&(i2.u12.Mutex_1>=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.082037,20720,1,0,4998,82,1037,4481,81,162,15115
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F((!(F(X("((i5.u11.Acknowledge_1_1>=1)&&(i2.u12.Active_2_1>=1))"))))||("(i0.u2.all_active_1<1)")))))
Formula 10 simplified : !GF("(i0.u2.all_active_1<1)" | !FX"((i5.u11.Acknowledge_1_1>=1)&&(i2.u12.Active_2_1>=1))")
4 unique states visited
2 strongly connected components in search stack
6 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.084293,20720,1,0,5184,82,1081,4642,81,162,15691
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(F((F("(((((i0.u2.WaitMutex_1_2<1)||(i1.u0.Mutex_2<1))&&(u15.RecBuff_1_1>=1))&&(i5.u14.all_passive_1>=1))||((i1.u0.Active_2_2>=1)&&(u7.Acknowledge_1_2>=1)))"))||(G(F("((u15.RecBuff_1_1>=1)&&(i5.u14.all_passive_1>=1))")))))))
Formula 11 simplified : !XF(F"(((((i0.u2.WaitMutex_1_2<1)||(i1.u0.Mutex_2<1))&&(u15.RecBuff_1_1>=1))&&(i5.u14.all_passive_1>=1))||((i1.u0.Active_2_2>=1)&&(u7.Acknowledge_1_2>=1)))" | GF"((u15.RecBuff_1_1>=1)&&(i5.u14.all_passive_1>=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.087948,20984,1,0,5601,82,1119,5009,81,162,16781
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(G(F(!(X(!(G(!(X("(i1.u0.Modify_2_2>=1)"))))))))))))
Formula 12 simplified : !GXGF!X!G!X"(i1.u0.Modify_2_2>=1)"
3 unique states visited
2 strongly connected components in search stack
5 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.08952,21248,1,0,5633,82,1136,5045,81,162,16965
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((!((G("(i1.u3.all_active_2>=1)"))U("((i1.u0.Active_2_2>=1)&&(u7.Acknowledge_1_2>=1))")))&&(!(("(i1.u3.all_active_2>=1)")U("(i3.u1.updating_2_2>=1)")))))
Formula 13 simplified : !(!(G"(i1.u3.all_active_2>=1)" U "((i1.u0.Active_2_2>=1)&&(u7.Acknowledge_1_2>=1))") & !("(i1.u3.all_active_2>=1)" U "(i3.u1.updating_2_2>=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.091875,21248,1,0,5804,82,1187,5147,81,162,17581
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-14 FALSE 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-22 00:26:45] [INFO ] Built C files in 333ms 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 1590107205427

--------------------
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="DatabaseWithMutex-PT-02"
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 DatabaseWithMutex-PT-02, 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-158922814100266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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