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.r126-tajo-158961389800114.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 Philosophers-PT-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389800114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 41K Apr 27 15:14 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 Philosophers-PT-000010-00
FORMULA_NAME Philosophers-PT-000010-01
FORMULA_NAME Philosophers-PT-000010-02
FORMULA_NAME Philosophers-PT-000010-03
FORMULA_NAME Philosophers-PT-000010-04
FORMULA_NAME Philosophers-PT-000010-05
FORMULA_NAME Philosophers-PT-000010-06
FORMULA_NAME Philosophers-PT-000010-07
FORMULA_NAME Philosophers-PT-000010-08
FORMULA_NAME Philosophers-PT-000010-09
FORMULA_NAME Philosophers-PT-000010-10
FORMULA_NAME Philosophers-PT-000010-11
FORMULA_NAME Philosophers-PT-000010-12
FORMULA_NAME Philosophers-PT-000010-13
FORMULA_NAME Philosophers-PT-000010-14
FORMULA_NAME Philosophers-PT-000010-15

=== Now, execution of the tool begins

BK_START 1589786619424

[2020-05-18 07:23:41] [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-18 07:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 07:23:41] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-05-18 07:23:41] [INFO ] Transformed 50 places.
[2020-05-18 07:23:41] [INFO ] Transformed 50 transitions.
[2020-05-18 07:23:41] [INFO ] Parsed PT model containing 50 places and 50 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 276 steps, including 1 resets, run visited all 43 properties in 14 ms. (steps per millisecond=19 )
[2020-05-18 07:23:41] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-18 07:23:41] [INFO ] Flatten gal took : 39 ms
FORMULA Philosophers-PT-000010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 07:23:41] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 07:23:41] [INFO ] Applying decomposition
[2020-05-18 07:23:41] [INFO ] Flatten gal took : 8 ms
[2020-05-18 07:23:41] [INFO ] Input system was already deterministic with 50 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/graph13338609634929132317.txt, -o, /tmp/graph13338609634929132317.bin, -w, /tmp/graph13338609634929132317.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/graph13338609634929132317.bin, -l, -1, -v, -w, /tmp/graph13338609634929132317.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 07:23:42] [INFO ] Decomposing Gal with order
[2020-05-18 07:23:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 07:23:42] [INFO ] Removed a total of 9 redundant transitions.
[2020-05-18 07:23:42] [INFO ] Flatten gal took : 33 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 50 rows 50 cols
[2020-05-18 07:23:42] [INFO ] Computed 20 place invariants in 4 ms
inv : Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
inv : Fork_9 + Catch1_10 + Catch2_9 + Eat_9 + Eat_10 = 1
inv : Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
inv : Fork_2 + Catch1_3 + Catch2_2 + Eat_2 + Eat_3 = 1
inv : Fork_3 + Catch1_4 + Catch2_3 + Eat_4 + Eat_3 = 1
inv : Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
inv : Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
inv : Think_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
inv : Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
inv : Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
inv : Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
inv : Fork_1 + Catch1_2 + Catch2_1 + Eat_1 + Eat_2 = 1
inv : Catch1_1 + Fork_10 + Catch2_10 + Eat_1 + Eat_10 = 1
inv : Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 1
inv : Fork_4 + Catch1_5 + Catch2_4 + Eat_4 + Eat_5 = 1
inv : Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
inv : Fork_5 + Catch1_6 + Catch2_5 + Eat_5 + Eat_6 = 1
inv : Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
inv : Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 1
inv : Fork_7 + Catch1_8 + Catch2_7 + Eat_8 + Eat_7 = 1
Total of 20 invariants.
[2020-05-18 07:23:42] [INFO ] Computed 20 place invariants in 6 ms
[2020-05-18 07:23:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2020-05-18 07:23:42] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
[2020-05-18 07:23:42] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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 9 LTL properties
Checking formula 0 : !(((F(G("((((((((((i4.u5.Eat_10>=1)||(i0.u4.Eat_6>=1))||(u6.Eat_1>=1))||(i1.u7.Eat_4>=1))||(u6.Eat_2>=1))||(i0.u2.Eat_5>=1))||(i4.u8.Eat_9>=1))||(i1.u1.Eat_3>=1))||(i2.u0.Eat_7>=1))||(i2.u3.Eat_8>=1))")))&&(X(!(X((G("((((((((((i4.u5.Eat_10>=1)||(i0.u4.Eat_6>=1))||(u6.Eat_1>=1))||(i1.u7.Eat_4>=1))||(u6.Eat_2>=1))||(i0.u2.Eat_5>=1))||(i4.u8.Eat_9>=1))||(i1.u1.Eat_3>=1))||(i2.u0.Eat_7>=1))||(i2.u3.Eat_8>=1))"))U(F(G("(((((((((((i1.u7.Fork_3>=1)&&(i1.u7.Catch2_4>=1))||((i0.u2.Fork_5>=1)&&(i0.u4.Catch2_6>=1)))||((i4.u5.Fork_9>=1)&&(i4.u5.Catch2_10>=1)))||((u6.Fork_1>=1)&&(u6.Catch2_2>=1)))||((i0.u4.Fork_6>=1)&&(i2.u0.Catch2_7>=1)))||((i1.u1.Fork_2>=1)&&(i1.u1.Catch2_3>=1)))||((i1.u7.Fork_4>=1)&&(i0.u2.Catch2_5>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Catch2_9>=1)))||((i4.u5.Fork_10>=1)&&(u6.Catch2_1>=1)))||((i2.u3.Fork_7>=1)&&(i2.u3.Catch2_8>=1)))")))))))))
Formula 0 simplified : !(FG"((((((((((i4.u5.Eat_10>=1)||(i0.u4.Eat_6>=1))||(u6.Eat_1>=1))||(i1.u7.Eat_4>=1))||(u6.Eat_2>=1))||(i0.u2.Eat_5>=1))||(i4.u8.Eat_9>=1))||(i1.u1.Eat_3>=1))||(i2.u0.Eat_7>=1))||(i2.u3.Eat_8>=1))" & X!X(G"((((((((((i4.u5.Eat_10>=1)||(i0.u4.Eat_6>=1))||(u6.Eat_1>=1))||(i1.u7.Eat_4>=1))||(u6.Eat_2>=1))||(i0.u2.Eat_5>=1))||(i4.u8.Eat_9>=1))||(i1.u1.Eat_3>=1))||(i2.u0.Eat_7>=1))||(i2.u3.Eat_8>=1))" U FG"(((((((((((i1.u7.Fork_3>=1)&&(i1.u7.Catch2_4>=1))||((i0.u2.Fork_5>=1)&&(i0.u4.Catch2_6>=1)))||((i4.u5.Fork_9>=1)&&(i4.u5.Catch2_10>=1)))||((u6.Fork_1>=1)&&(u6.Catch2_2>=1)))||((i0.u4.Fork_6>=1)&&(i2.u0.Catch2_7>=1)))||((i1.u1.Fork_2>=1)&&(i1.u1.Catch2_3>=1)))||((i1.u7.Fork_4>=1)&&(i0.u2.Catch2_5>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Catch2_9>=1)))||((i4.u5.Fork_10>=1)&&(u6.Catch2_1>=1)))||((i2.u3.Fork_7>=1)&&(i2.u3.Catch2_8>=1)))"))
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.074625,19720,1,0,5597,571,456,7724,322,1444,6534
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(((((((((((G(X(X(X(!(("(((((((((((i1.u7.Think_4<1)||(i1.u7.Fork_3<1))&&((u6.Think_1<1)||(i4.u5.Fork_10<1)))&&((u6.Think_2<1)||(u6.Fork_1<1)))&&((i0.u4.Think_6<1)||(i0.u2.Fork_5<1)))&&((i1.u1.Think_3<1)||(i1.u1.Fork_2<1)))&&((i2.u0.Think_7<1)||(i0.u4.Fork_6<1)))&&((i4.u8.Think_9<1)||(i4.u8.Fork_8<1)))&&((i4.u5.Think_10<1)||(i4.u5.Fork_9<1)))&&((i2.u3.Think_8<1)||(i2.u3.Fork_7<1)))&&((i0.u2.Think_5<1)||(i1.u7.Fork_4<1)))")U("(((((((((((i1.u7.Think_4>=1)&&(i1.u7.Fork_3>=1))||((u6.Think_1>=1)&&(i4.u5.Fork_10>=1)))||((u6.Think_2>=1)&&(u6.Fork_1>=1)))||((i0.u4.Think_6>=1)&&(i0.u2.Fork_5>=1)))||((i1.u1.Think_3>=1)&&(i1.u1.Fork_2>=1)))||((i2.u0.Think_7>=1)&&(i0.u4.Fork_6>=1)))||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_9>=1)))||((i2.u3.Think_8>=1)&&(i2.u3.Fork_7>=1)))||((i0.u2.Think_5>=1)&&(i1.u7.Fork_4>=1)))")))))))&&("((i1.u7.Think_4<1)||(i1.u7.Fork_3<1))"))&&("((u6.Think_1<1)||(i4.u5.Fork_10<1))"))&&("((u6.Think_2<1)||(u6.Fork_1<1))"))&&("((i0.u4.Think_6<1)||(i0.u2.Fork_5<1))"))&&("((i1.u1.Think_3<1)||(i1.u1.Fork_2<1))"))&&("((i2.u0.Think_7<1)||(i0.u4.Fork_6<1))"))&&("((i4.u8.Think_9<1)||(i4.u8.Fork_8<1))"))&&("((i4.u5.Think_10<1)||(i4.u5.Fork_9<1))"))&&("((i2.u3.Think_8<1)||(i2.u3.Fork_7<1))"))&&("((i0.u2.Think_5<1)||(i1.u7.Fork_4<1))"))))
Formula 1 simplified : !F("((i0.u2.Think_5<1)||(i1.u7.Fork_4<1))" & "((i0.u4.Think_6<1)||(i0.u2.Fork_5<1))" & "((i1.u1.Think_3<1)||(i1.u1.Fork_2<1))" & "((i1.u7.Think_4<1)||(i1.u7.Fork_3<1))" & "((i2.u0.Think_7<1)||(i0.u4.Fork_6<1))" & "((i2.u3.Think_8<1)||(i2.u3.Fork_7<1))" & "((i4.u5.Think_10<1)||(i4.u5.Fork_9<1))" & "((i4.u8.Think_9<1)||(i4.u8.Fork_8<1))" & "((u6.Think_1<1)||(i4.u5.Fork_10<1))" & "((u6.Think_2<1)||(u6.Fork_1<1))" & GXXX!("(((((((((((i1.u7.Think_4<1)||(i1.u7.Fork_3<1))&&((u6.Think_1<1)||(i4.u5.Fork_10<1)))&&((u6.Think_2<1)||(u6.Fork_1<1)))&&((i0.u4.Think_6<1)||(i0.u2.Fork_5<1)))&&((i1.u1.Think_3<1)||(i1.u1.Fork_2<1)))&&((i2.u0.Think_7<1)||(i0.u4.Fork_6<1)))&&((i4.u8.Think_9<1)||(i4.u8.Fork_8<1)))&&((i4.u5.Think_10<1)||(i4.u5.Fork_9<1)))&&((i2.u3.Think_8<1)||(i2.u3.Fork_7<1)))&&((i0.u2.Think_5<1)||(i1.u7.Fork_4<1)))" U "(((((((((((i1.u7.Think_4>=1)&&(i1.u7.Fork_3>=1))||((u6.Think_1>=1)&&(i4.u5.Fork_10>=1)))||((u6.Think_2>=1)&&(u6.Fork_1>=1)))||((i0.u4.Think_6>=1)&&(i0.u2.Fork_5>=1)))||((i1.u1.Think_3>=1)&&(i1.u1.Fork_2>=1)))||((i2.u0.Think_7>=1)&&(i0.u4.Fork_6>=1)))||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_9>=1)))||((i2.u3.Think_8>=1)&&(i2.u3.Fork_7>=1)))||((i0.u2.Think_5>=1)&&(i1.u7.Fork_4>=1)))"))
[2020-05-18 07:23:42] [INFO ] Proved 50 variables to be positive in 139 ms
[2020-05-18 07:23:42] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2020-05-18 07:23:42] [INFO ] Computation of disable matrix completed :0/50 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:23:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:23:42] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2020-05-18 07:23:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Computing Next relation with stutter on 2 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.859198,23740,1,0,9024,613,603,12007,334,1715,10903
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X((X(!(X(F("(((((((((((i2.u3.Fork_7>=1)&&(i2.u0.Catch1_7>=1))||((i1.u1.Fork_2>=1)&&(u6.Catch1_2>=1)))||((i0.u2.Fork_5>=1)&&(i0.u2.Catch1_5>=1)))||((i4.u5.Fork_9>=1)&&(i4.u8.Catch1_9>=1)))||((i1.u7.Fork_4>=1)&&(i1.u7.Catch1_4>=1)))||((i4.u5.Fork_10>=1)&&(i4.u5.Catch1_10>=1)))||((i0.u4.Fork_6>=1)&&(i0.u4.Catch1_6>=1)))||((i4.u8.Fork_8>=1)&&(i2.u3.Catch1_8>=1)))||((u6.Fork_1>=1)&&(u6.Catch1_1>=1)))||((i1.u7.Fork_3>=1)&&(i1.u1.Catch1_3>=1)))")))))&&(F(((((((((((X("(((((((((((i2.u3.Fork_7>=1)&&(i2.u0.Catch1_7>=1))||((i1.u1.Fork_2>=1)&&(u6.Catch1_2>=1)))||((i0.u2.Fork_5>=1)&&(i0.u2.Catch1_5>=1)))||((i4.u5.Fork_9>=1)&&(i4.u8.Catch1_9>=1)))||((i1.u7.Fork_4>=1)&&(i1.u7.Catch1_4>=1)))||((i4.u5.Fork_10>=1)&&(i4.u5.Catch1_10>=1)))||((i0.u4.Fork_6>=1)&&(i0.u4.Catch1_6>=1)))||((i4.u8.Fork_8>=1)&&(i2.u3.Catch1_8>=1)))||((u6.Fork_1>=1)&&(u6.Catch1_1>=1)))||((i1.u7.Fork_3>=1)&&(i1.u1.Catch1_3>=1)))"))||("((i2.u3.Think_8>=1)&&(i4.u8.Fork_8>=1))"))||("((i0.u4.Think_6>=1)&&(i0.u4.Fork_6>=1))"))||("((i4.u5.Think_10>=1)&&(i4.u5.Fork_10>=1))"))||("((i0.u2.Think_5>=1)&&(i0.u2.Fork_5>=1))"))||("((i1.u7.Think_4>=1)&&(i1.u7.Fork_4>=1))"))||("((u6.Think_1>=1)&&(u6.Fork_1>=1))"))||("((i2.u0.Think_7>=1)&&(i2.u3.Fork_7>=1))"))||("((i4.u8.Think_9>=1)&&(i4.u5.Fork_9>=1))"))||("((u6.Think_2>=1)&&(i1.u1.Fork_2>=1))"))||("((i1.u1.Think_3>=1)&&(i1.u7.Fork_3>=1))")))))))
Formula 2 simplified : !XX(X!XF"(((((((((((i2.u3.Fork_7>=1)&&(i2.u0.Catch1_7>=1))||((i1.u1.Fork_2>=1)&&(u6.Catch1_2>=1)))||((i0.u2.Fork_5>=1)&&(i0.u2.Catch1_5>=1)))||((i4.u5.Fork_9>=1)&&(i4.u8.Catch1_9>=1)))||((i1.u7.Fork_4>=1)&&(i1.u7.Catch1_4>=1)))||((i4.u5.Fork_10>=1)&&(i4.u5.Catch1_10>=1)))||((i0.u4.Fork_6>=1)&&(i0.u4.Catch1_6>=1)))||((i4.u8.Fork_8>=1)&&(i2.u3.Catch1_8>=1)))||((u6.Fork_1>=1)&&(u6.Catch1_1>=1)))||((i1.u7.Fork_3>=1)&&(i1.u1.Catch1_3>=1)))" & F("((i0.u2.Think_5>=1)&&(i0.u2.Fork_5>=1))" | "((i0.u4.Think_6>=1)&&(i0.u4.Fork_6>=1))" | "((i1.u1.Think_3>=1)&&(i1.u7.Fork_3>=1))" | "((i1.u7.Think_4>=1)&&(i1.u7.Fork_4>=1))" | "((i2.u0.Think_7>=1)&&(i2.u3.Fork_7>=1))" | "((i2.u3.Think_8>=1)&&(i4.u8.Fork_8>=1))" | "((i4.u5.Think_10>=1)&&(i4.u5.Fork_10>=1))" | "((i4.u8.Think_9>=1)&&(i4.u5.Fork_9>=1))" | "((u6.Think_1>=1)&&(u6.Fork_1>=1))" | "((u6.Think_2>=1)&&(i1.u1.Fork_2>=1))" | X"(((((((((((i2.u3.Fork_7>=1)&&(i2.u0.Catch1_7>=1))||((i1.u1.Fork_2>=1)&&(u6.Catch1_2>=1)))||((i0.u2.Fork_5>=1)&&(i0.u2.Catch1_5>=1)))||((i4.u5.Fork_9>=1)&&(i4.u8.Catch1_9>=1)))||((i1.u7.Fork_4>=1)&&(i1.u7.Catch1_4>=1)))||((i4.u5.Fork_10>=1)&&(i4.u5.Catch1_10>=1)))||((i0.u4.Fork_6>=1)&&(i0.u4.Catch1_6>=1)))||((i4.u8.Fork_8>=1)&&(i2.u3.Catch1_8>=1)))||((u6.Fork_1>=1)&&(u6.Catch1_1>=1)))||((i1.u7.Fork_3>=1)&&(i1.u1.Catch1_3>=1)))"))
Computing Next relation with stutter on 2 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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,0.967718,25852,1,0,17120,652,813,24762,348,2045,20070
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(X(G("(((((((((((i1.u7.Think_4>=1)&&(i1.u7.Fork_3>=1))||((u6.Think_1>=1)&&(i4.u5.Fork_10>=1)))||((u6.Think_2>=1)&&(u6.Fork_1>=1)))||((i0.u4.Think_6>=1)&&(i0.u2.Fork_5>=1)))||((i1.u1.Think_3>=1)&&(i1.u1.Fork_2>=1)))||((i2.u0.Think_7>=1)&&(i0.u4.Fork_6>=1)))||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_9>=1)))||((i2.u3.Think_8>=1)&&(i2.u3.Fork_7>=1)))||((i0.u2.Think_5>=1)&&(i1.u7.Fork_4>=1)))"))))))
Formula 3 simplified : !GXXG"(((((((((((i1.u7.Think_4>=1)&&(i1.u7.Fork_3>=1))||((u6.Think_1>=1)&&(i4.u5.Fork_10>=1)))||((u6.Think_2>=1)&&(u6.Fork_1>=1)))||((i0.u4.Think_6>=1)&&(i0.u2.Fork_5>=1)))||((i1.u1.Think_3>=1)&&(i1.u1.Fork_2>=1)))||((i2.u0.Think_7>=1)&&(i0.u4.Fork_6>=1)))||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_9>=1)))||((i2.u3.Think_8>=1)&&(i2.u3.Fork_7>=1)))||((i0.u2.Think_5>=1)&&(i1.u7.Fork_4>=1)))"
Computing Next relation with stutter on 2 deadlock states
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.977371,26380,1,0,17588,653,868,25450,351,2073,21787
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G(!(X("(((((((((((i2.u3.Think_8>=1)&&(i4.u8.Fork_8>=1))||((i0.u4.Think_6>=1)&&(i0.u4.Fork_6>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_10>=1)))||((i0.u2.Think_5>=1)&&(i0.u2.Fork_5>=1)))||((i1.u7.Think_4>=1)&&(i1.u7.Fork_4>=1)))||((u6.Think_1>=1)&&(u6.Fork_1>=1)))||((i2.u0.Think_7>=1)&&(i2.u3.Fork_7>=1)))||((i4.u8.Think_9>=1)&&(i4.u5.Fork_9>=1)))||((u6.Think_2>=1)&&(i1.u1.Fork_2>=1)))||((i1.u1.Think_3>=1)&&(i1.u7.Fork_3>=1)))"))))))
Formula 4 simplified : !FG!X"(((((((((((i2.u3.Think_8>=1)&&(i4.u8.Fork_8>=1))||((i0.u4.Think_6>=1)&&(i0.u4.Fork_6>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_10>=1)))||((i0.u2.Think_5>=1)&&(i0.u2.Fork_5>=1)))||((i1.u7.Think_4>=1)&&(i1.u7.Fork_4>=1)))||((u6.Think_1>=1)&&(u6.Fork_1>=1)))||((i2.u0.Think_7>=1)&&(i2.u3.Fork_7>=1)))||((i4.u8.Think_9>=1)&&(i4.u5.Fork_9>=1)))||((u6.Think_2>=1)&&(i1.u1.Fork_2>=1)))||((i1.u1.Think_3>=1)&&(i1.u7.Fork_3>=1)))"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 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.982873,26380,1,0,18017,656,894,26129,351,2111,22426
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(X((("(((((((((((i1.u7.Think_4<1)||(i1.u7.Fork_3<1))&&((u6.Think_1<1)||(i4.u5.Fork_10<1)))&&((u6.Think_2<1)||(u6.Fork_1<1)))&&((i0.u4.Think_6<1)||(i0.u2.Fork_5<1)))&&((i1.u1.Think_3<1)||(i1.u1.Fork_2<1)))&&((i2.u0.Think_7<1)||(i0.u4.Fork_6<1)))&&((i4.u8.Think_9<1)||(i4.u8.Fork_8<1)))&&((i4.u5.Think_10<1)||(i4.u5.Fork_9<1)))&&((i2.u3.Think_8<1)||(i2.u3.Fork_7<1)))&&((i0.u2.Think_5<1)||(i1.u7.Fork_4<1)))")U("(((((((((((i1.u7.Fork_3>=1)&&(i1.u7.Catch2_4>=1))||((i0.u2.Fork_5>=1)&&(i0.u4.Catch2_6>=1)))||((i4.u5.Fork_9>=1)&&(i4.u5.Catch2_10>=1)))||((u6.Fork_1>=1)&&(u6.Catch2_2>=1)))||((i0.u4.Fork_6>=1)&&(i2.u0.Catch2_7>=1)))||((i1.u1.Fork_2>=1)&&(i1.u1.Catch2_3>=1)))||((i1.u7.Fork_4>=1)&&(i0.u2.Catch2_5>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Catch2_9>=1)))||((i4.u5.Fork_10>=1)&&(u6.Catch2_1>=1)))||((i2.u3.Fork_7>=1)&&(i2.u3.Catch2_8>=1)))"))||((X(G("(((((((((((i1.u7.Think_4>=1)&&(i1.u7.Fork_3>=1))||((u6.Think_1>=1)&&(i4.u5.Fork_10>=1)))||((u6.Think_2>=1)&&(u6.Fork_1>=1)))||((i0.u4.Think_6>=1)&&(i0.u2.Fork_5>=1)))||((i1.u1.Think_3>=1)&&(i1.u1.Fork_2>=1)))||((i2.u0.Think_7>=1)&&(i0.u4.Fork_6>=1)))||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_9>=1)))||((i2.u3.Think_8>=1)&&(i2.u3.Fork_7>=1)))||((i0.u2.Think_5>=1)&&(i1.u7.Fork_4>=1)))")))U("(((((((((((i1.u7.Think_4>=1)&&(i1.u7.Fork_3>=1))||((u6.Think_1>=1)&&(i4.u5.Fork_10>=1)))||((u6.Think_2>=1)&&(u6.Fork_1>=1)))||((i0.u4.Think_6>=1)&&(i0.u2.Fork_5>=1)))||((i1.u1.Think_3>=1)&&(i1.u1.Fork_2>=1)))||((i2.u0.Think_7>=1)&&(i0.u4.Fork_6>=1)))||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_9>=1)))||((i2.u3.Think_8>=1)&&(i2.u3.Fork_7>=1)))||((i0.u2.Think_5>=1)&&(i1.u7.Fork_4>=1)))")))))))
Formula 5 simplified : !FGX(("(((((((((((i1.u7.Think_4<1)||(i1.u7.Fork_3<1))&&((u6.Think_1<1)||(i4.u5.Fork_10<1)))&&((u6.Think_2<1)||(u6.Fork_1<1)))&&((i0.u4.Think_6<1)||(i0.u2.Fork_5<1)))&&((i1.u1.Think_3<1)||(i1.u1.Fork_2<1)))&&((i2.u0.Think_7<1)||(i0.u4.Fork_6<1)))&&((i4.u8.Think_9<1)||(i4.u8.Fork_8<1)))&&((i4.u5.Think_10<1)||(i4.u5.Fork_9<1)))&&((i2.u3.Think_8<1)||(i2.u3.Fork_7<1)))&&((i0.u2.Think_5<1)||(i1.u7.Fork_4<1)))" U "(((((((((((i1.u7.Fork_3>=1)&&(i1.u7.Catch2_4>=1))||((i0.u2.Fork_5>=1)&&(i0.u4.Catch2_6>=1)))||((i4.u5.Fork_9>=1)&&(i4.u5.Catch2_10>=1)))||((u6.Fork_1>=1)&&(u6.Catch2_2>=1)))||((i0.u4.Fork_6>=1)&&(i2.u0.Catch2_7>=1)))||((i1.u1.Fork_2>=1)&&(i1.u1.Catch2_3>=1)))||((i1.u7.Fork_4>=1)&&(i0.u2.Catch2_5>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Catch2_9>=1)))||((i4.u5.Fork_10>=1)&&(u6.Catch2_1>=1)))||((i2.u3.Fork_7>=1)&&(i2.u3.Catch2_8>=1)))") | (XG"(((((((((((i1.u7.Think_4>=1)&&(i1.u7.Fork_3>=1))||((u6.Think_1>=1)&&(i4.u5.Fork_10>=1)))||((u6.Think_2>=1)&&(u6.Fork_1>=1)))||((i0.u4.Think_6>=1)&&(i0.u2.Fork_5>=1)))||((i1.u1.Think_3>=1)&&(i1.u1.Fork_2>=1)))||((i2.u0.Think_7>=1)&&(i0.u4.Fork_6>=1)))||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_9>=1)))||((i2.u3.Think_8>=1)&&(i2.u3.Fork_7>=1)))||((i0.u2.Think_5>=1)&&(i1.u7.Fork_4>=1)))" U "(((((((((((i1.u7.Think_4>=1)&&(i1.u7.Fork_3>=1))||((u6.Think_1>=1)&&(i4.u5.Fork_10>=1)))||((u6.Think_2>=1)&&(u6.Fork_1>=1)))||((i0.u4.Think_6>=1)&&(i0.u2.Fork_5>=1)))||((i1.u1.Think_3>=1)&&(i1.u1.Fork_2>=1)))||((i2.u0.Think_7>=1)&&(i0.u4.Fork_6>=1)))||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u5.Think_10>=1)&&(i4.u5.Fork_9>=1)))||((i2.u3.Think_8>=1)&&(i2.u3.Fork_7>=1)))||((i0.u2.Think_5>=1)&&(i1.u7.Fork_4>=1)))"))
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 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,1.00421,26908,1,0,18493,669,1043,26582,357,2143,24003
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(F(!(G("((u6.Think_1>=1)&&(i4.u5.Fork_10>=1))")))))&&((X(("((i2.u3.Fork_7>=1)&&(i2.u0.Catch1_7>=1))")U("((u6.Think_1>=1)&&(i4.u5.Fork_10>=1))")))U(F("((i2.u3.Fork_7>=1)&&(i2.u0.Catch1_7>=1))")))))
Formula 6 simplified : !(XF!G"((u6.Think_1>=1)&&(i4.u5.Fork_10>=1))" & (X("((i2.u3.Fork_7>=1)&&(i2.u0.Catch1_7>=1))" U "((u6.Think_1>=1)&&(i4.u5.Fork_10>=1))") U F"((i2.u3.Fork_7>=1)&&(i2.u0.Catch1_7>=1))"))
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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,1.00923,26908,1,0,18820,669,1075,26927,357,2168,24566
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(!(X(!(X(((G(F("(i4.u5.Eat_10<1)")))&&(X("((i4.u8.Fork_8>=1)&&(i4.u8.Catch2_9>=1))")))&&("(i0.u4.Eat_6>=1)"))))))))
Formula 7 simplified : !F!X!X("(i0.u4.Eat_6>=1)" & GF"(i4.u5.Eat_10<1)" & X"((i4.u8.Fork_8>=1)&&(i4.u8.Catch2_9>=1))")
Computing Next relation with stutter on 2 deadlock states
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,1.01718,27436,1,0,19747,669,1100,27748,357,2180,26197
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("((i4.u8.Eat_9>=1)||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))")))
Formula 8 simplified : !G"((i4.u8.Eat_9>=1)||((i4.u8.Think_9>=1)&&(i4.u8.Fork_8>=1)))"
Computing Next relation with stutter on 2 deadlock states
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,1.02167,27436,1,0,19934,669,1118,27973,360,2180,26547
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-15 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-18 07:23:43] [INFO ] Built C files in 1240ms 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 1589786623569

--------------------
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="Philosophers-PT-000010"
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 Philosophers-PT-000010, 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 r126-tajo-158961389800114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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