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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 9.7K 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-COL-000005-00
FORMULA_NAME Philosophers-COL-000005-01
FORMULA_NAME Philosophers-COL-000005-02
FORMULA_NAME Philosophers-COL-000005-03
FORMULA_NAME Philosophers-COL-000005-04
FORMULA_NAME Philosophers-COL-000005-05
FORMULA_NAME Philosophers-COL-000005-06
FORMULA_NAME Philosophers-COL-000005-07
FORMULA_NAME Philosophers-COL-000005-08
FORMULA_NAME Philosophers-COL-000005-09
FORMULA_NAME Philosophers-COL-000005-10
FORMULA_NAME Philosophers-COL-000005-11
FORMULA_NAME Philosophers-COL-000005-12
FORMULA_NAME Philosophers-COL-000005-13
FORMULA_NAME Philosophers-COL-000005-14
FORMULA_NAME Philosophers-COL-000005-15

=== Now, execution of the tool begins

BK_START 1589780466803

[2020-05-18 05:41:08] [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 05:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 05:41:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 05:41:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 566 ms
[2020-05-18 05:41:09] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-05-18 05:41:09] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 15 ms.
[2020-05-18 05:41:09] [INFO ] Computed order based on color domains.
[2020-05-18 05:41:09] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions in 6 ms.
[2020-05-18 05:41:09] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 87 steps, including 3 resets, run visited all 41 properties in 4 ms. (steps per millisecond=21 )
[2020-05-18 05:41:09] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-18 05:41:09] [INFO ] Flatten gal took : 38 ms
FORMULA Philosophers-COL-000005-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 05:41:09] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 05:41:09] [INFO ] Applying decomposition
[2020-05-18 05:41:09] [INFO ] Flatten gal took : 12 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/graph5260094331373869497.txt, -o, /tmp/graph5260094331373869497.bin, -w, /tmp/graph5260094331373869497.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/graph5260094331373869497.bin, -l, -1, -v, -w, /tmp/graph5260094331373869497.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 05:41:10] [INFO ] Decomposing Gal with order
[2020-05-18 05:41:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 05:41:10] [INFO ] Removed a total of 5 redundant transitions.
[2020-05-18 05:41:10] [INFO ] Input system was already deterministic with 25 transitions.
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 89 ms
[2020-05-18 05:41:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2020-05-18 05:41:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-18 05:41:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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 12 LTL properties
Checking formula 0 : !((X(X(("(((((u3.eat_0<1)&&(u4.eat_1<1))&&(u0.eat_2<1))&&(u1.eat_3<1))&&(u2.eat_4<1))")U(G(((((((F("((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))"))||("((u2.think_4>=1)&&(u2.fork_3>=1))"))||("((u4.think_1>=1)&&(u4.fork_0>=1))"))||("((u1.think_3>=1)&&(u1.fork_2>=1))"))||("((u0.think_2>=1)&&(u0.fork_1>=1))"))||("((u3.think_0>=1)&&(u3.fork_4>=1))"))U(X("((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))"))))))))
Formula 0 simplified : !XX("(((((u3.eat_0<1)&&(u4.eat_1<1))&&(u0.eat_2<1))&&(u1.eat_3<1))&&(u2.eat_4<1))" U G(("((u0.think_2>=1)&&(u0.fork_1>=1))" | "((u1.think_3>=1)&&(u1.fork_2>=1))" | "((u2.think_4>=1)&&(u2.fork_3>=1))" | "((u3.think_0>=1)&&(u3.fork_4>=1))" | "((u4.think_1>=1)&&(u4.fork_0>=1))" | F"((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))") U X"((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 25 cols
[2020-05-18 05:41:10] [INFO ] Computed 10 place invariants in 5 ms
inv : think_3 + catch1_3 + catch2_3 + eat_3 = 1
inv : think_4 + catch1_4 + catch2_4 + eat_4 = 1
inv : fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
inv : fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
inv : fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
inv : fork_4 + catch1_0 + catch2_4 + eat_0 + eat_4 = 1
inv : think_2 + catch1_2 + catch2_2 + eat_2 = 1
inv : think_1 + catch1_1 + catch2_1 + eat_1 = 1
inv : think_0 + catch1_0 + catch2_0 + eat_0 = 1
inv : fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
Total of 10 invariants.
[2020-05-18 05:41:10] [INFO ] Computed 10 place invariants in 10 ms
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
16 unique states visited
12 strongly connected components in search stack
18 transitions explored
12 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.071466,19328,1,0,1760,166,439,1110,162,265,3803
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((G((F(X("((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))")))&&(X(G("((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))")))))U("((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))"))))
Formula 1 simplified : !X(G(FX"((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))" & XG"((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))") U "((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=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,0.079802,19592,1,0,3158,167,470,2279,162,268,6324
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(G(X(X(((!(F("((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))")))||(!(X("((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=1)))"))))U(F(G("((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=1)))"))))))))))
Formula 2 simplified : !FXGXX((!F"((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))" | !X"((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=1)))") U FG"((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=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,0.088264,19856,1,0,3855,167,489,3005,162,270,7666
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((("((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))")U(G("(((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))&&((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1))))")))U("((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))"))))
Formula 3 simplified : !G(("((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))" U G"(((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))&&((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1))))") U "((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.101194,20384,1,0,4918,169,533,3961,162,272,10143
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(X(G(X(G((X("((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))"))||(G("((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=1)))"))))))))))
Formula 4 simplified : GXGXG(X"((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))" | G"((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.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
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.105543,20648,1,0,5424,169,534,4349,162,272,11102
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(G((G("((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))"))U("(((((((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))||((u1.fork_2>=1)&&(u1.catch2_3>=1)))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))"))))))
Formula 5 simplified : !XFG(G"((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))" U "(((((((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))||((u1.fork_2>=1)&&(u1.catch2_3>=1)))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))")
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
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.11172,20648,1,0,5767,169,559,4717,162,272,11926
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X((G("(((((((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))||((u2.fork_3>=1)&&(u1.catch1_3>=1)))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))"))U("(((((((((((u2.fork_3<1)||(u1.catch1_3<1))&&((u3.fork_4<1)||(u2.catch1_4<1)))&&((u4.fork_0<1)||(u3.catch1_0<1)))&&((u0.fork_1<1)||(u4.catch1_1<1)))&&((u1.fork_2<1)||(u0.catch1_2<1)))&&(u3.eat_0<1))&&(u4.eat_1<1))&&(u0.eat_2<1))&&(u1.eat_3<1))&&(u2.eat_4<1))")))&&(("(((((u3.eat_0>=1)||(u4.eat_1>=1))||(u0.eat_2>=1))||(u1.eat_3>=1))||(u2.eat_4>=1))")U("(((((u3.eat_0<1)&&(u4.eat_1<1))&&(u0.eat_2<1))&&(u1.eat_3<1))&&(u2.eat_4<1))"))))
Formula 6 simplified : !(X(G"(((((((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))||((u2.fork_3>=1)&&(u1.catch1_3>=1)))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))" U "(((((((((((u2.fork_3<1)||(u1.catch1_3<1))&&((u3.fork_4<1)||(u2.catch1_4<1)))&&((u4.fork_0<1)||(u3.catch1_0<1)))&&((u0.fork_1<1)||(u4.catch1_1<1)))&&((u1.fork_2<1)||(u0.catch1_2<1)))&&(u3.eat_0<1))&&(u4.eat_1<1))&&(u0.eat_2<1))&&(u1.eat_3<1))&&(u2.eat_4<1))") & ("(((((u3.eat_0>=1)||(u4.eat_1>=1))||(u0.eat_2>=1))||(u1.eat_3>=1))||(u2.eat_4>=1))" U "(((((u3.eat_0<1)&&(u4.eat_1<1))&&(u0.eat_2<1))&&(u1.eat_3<1))&&(u2.eat_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
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.119525,20912,1,0,6111,170,632,5044,163,273,12948
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((((X(G("((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=1)))")))U("((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))"))U(X("((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))")))U((G("((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))"))U("(((((u3.eat_0>=1)||(u4.eat_1>=1))||(u0.eat_2>=1))||(u1.eat_3>=1))||(u2.eat_4>=1))"))))
Formula 7 simplified : !(((XG"((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=1)))" U "((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))") U X"((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))") U (G"((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))" U "(((((u3.eat_0>=1)||(u4.eat_1>=1))||(u0.eat_2>=1))||(u1.eat_3>=1))||(u2.eat_4>=1))"))
Computing Next relation with stutter on 2 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.126722,21176,1,0,6362,172,638,5305,163,275,13689
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(("((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))")U(G(F(X("(((((u3.eat_0>=1)||(u4.eat_1>=1))||(u0.eat_2>=1))||(u1.eat_3>=1))||(u2.eat_4>=1))")))))))
Formula 8 simplified : !F("((((((u1.fork_2>=1)&&(u1.catch2_3>=1))||((u4.fork_0>=1)&&(u4.catch2_1>=1)))||((u3.fork_4>=1)&&(u3.catch2_0>=1)))||((u0.fork_1>=1)&&(u0.catch2_2>=1)))||((u2.fork_3>=1)&&(u2.catch2_4>=1)))" U GFX"(((((u3.eat_0>=1)||(u4.eat_1>=1))||(u0.eat_2>=1))||(u1.eat_3>=1))||(u2.eat_4>=1))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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.1277,21176,1,0,6364,172,642,5318,163,275,13732
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(F((((((X((((((F("((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))"))||("((u3.think_0>=1)&&(u4.fork_0>=1))"))||("((u2.think_4>=1)&&(u3.fork_4>=1))"))||("((u4.think_1>=1)&&(u0.fork_1>=1))"))||("((u1.think_3>=1)&&(u2.fork_3>=1))"))||("((u0.think_2>=1)&&(u1.fork_2>=1))")))||("((u2.think_4>=1)&&(u2.fork_3>=1))"))||("((u4.think_1>=1)&&(u4.fork_0>=1))"))||("((u1.think_3>=1)&&(u1.fork_2>=1))"))||("((u0.think_2>=1)&&(u0.fork_1>=1))"))||("((u3.think_0>=1)&&(u3.fork_4>=1))"))))||(G("((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))"))))
Formula 9 simplified : !(!F("((u0.think_2>=1)&&(u0.fork_1>=1))" | "((u1.think_3>=1)&&(u1.fork_2>=1))" | "((u2.think_4>=1)&&(u2.fork_3>=1))" | "((u3.think_0>=1)&&(u3.fork_4>=1))" | "((u4.think_1>=1)&&(u4.fork_0>=1))" | X("((u0.think_2>=1)&&(u1.fork_2>=1))" | "((u1.think_3>=1)&&(u2.fork_3>=1))" | "((u2.think_4>=1)&&(u3.fork_4>=1))" | "((u3.think_0>=1)&&(u4.fork_0>=1))" | "((u4.think_1>=1)&&(u0.fork_1>=1))" | F"((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))")) | G"((((((u3.think_0>=1)&&(u4.fork_0>=1))||((u2.think_4>=1)&&(u3.fork_4>=1)))||((u4.think_1>=1)&&(u0.fork_1>=1)))||((u1.think_3>=1)&&(u2.fork_3>=1)))||((u0.think_2>=1)&&(u1.fork_2>=1)))")
[2020-05-18 05:41:10] [INFO ] Proved 25 variables to be positive in 171 ms
[2020-05-18 05:41:10] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2020-05-18 05:41:10] [INFO ] Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 05:41:10] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2020-05-18 05:41:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.302904,23680,1,0,6473,172,669,5401,163,275,13984
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!(G(F("((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))"))))||(X(("((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=1)))")U((((((X("((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))"))||("(u3.eat_0>=1)"))||("(u4.eat_1>=1)"))||("(u0.eat_2>=1)"))||("(u1.eat_3>=1)"))||("(u2.eat_4>=1)"))))))
Formula 10 simplified : !(!GF"((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))" | X("((((((u2.think_4>=1)&&(u2.fork_3>=1))||((u4.think_1>=1)&&(u4.fork_0>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_2>=1)&&(u0.fork_1>=1)))||((u3.think_0>=1)&&(u3.fork_4>=1)))" U ("(u0.eat_2>=1)" | "(u1.eat_3>=1)" | "(u2.eat_4>=1)" | "(u3.eat_0>=1)" | "(u4.eat_1>=1)" | X"((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))")))
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.315491,23680,1,0,7494,172,714,6332,163,275,16441
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X(!(F("((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=1)))"))))))
Formula 11 simplified : !XX!F"((((((u2.fork_3>=1)&&(u1.catch1_3>=1))||((u3.fork_4>=1)&&(u2.catch1_4>=1)))||((u4.fork_0>=1)&&(u3.catch1_0>=1)))||((u0.fork_1>=1)&&(u4.catch1_1>=1)))||((u1.fork_2>=1)&&(u0.catch1_2>=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
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.317843,23680,1,0,7606,172,714,6455,163,276,16670
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-18 05:41:10] [WARNING] Script execution failed on command (assert (and (>= (select s0 22) 1) (= (store (store (store (store s0 22 (- (select s0 22) 1)) 6 (+ (select s0 6) 1)) 2 (+ (select s0 2) 1)) 7 (+ (select s0 7) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 22) 1) (= (store (store (store (store s0 22 (- (select s0 22) 1)) 6 (+ (select s0 6) 1)) 2 (+ (select s0 2) 1)) 7 (+ (select s0 7) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
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 05:41:10] [INFO ] Built C files in 636ms 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 1589780471074

--------------------
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-COL-000005"
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-COL-000005, 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-158961389700002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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