Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
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 r261-csrt-152732586100220
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME Philosophers-PT-000010-LTLFireability-01
FORMULA_NAME Philosophers-PT-000010-LTLFireability-02
FORMULA_NAME Philosophers-PT-000010-LTLFireability-03
FORMULA_NAME Philosophers-PT-000010-LTLFireability-04
FORMULA_NAME Philosophers-PT-000010-LTLFireability-05
FORMULA_NAME Philosophers-PT-000010-LTLFireability-06
FORMULA_NAME Philosophers-PT-000010-LTLFireability-07
FORMULA_NAME Philosophers-PT-000010-LTLFireability-08
FORMULA_NAME Philosophers-PT-000010-LTLFireability-09
FORMULA_NAME Philosophers-PT-000010-LTLFireability-10
FORMULA_NAME Philosophers-PT-000010-LTLFireability-11
FORMULA_NAME Philosophers-PT-000010-LTLFireability-12
FORMULA_NAME Philosophers-PT-000010-LTLFireability-13
FORMULA_NAME Philosophers-PT-000010-LTLFireability-14
FORMULA_NAME Philosophers-PT-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527507489585

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph275529766587155381.txt, -o, /tmp/graph275529766587155381.bin, -w, /tmp/graph275529766587155381.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph275529766587155381.bin, -l, -1, -v, -w, /tmp/graph275529766587155381.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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.201805241334/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 16 LTL properties
Checking formula 0 : !((X((G(X("((((((((((i3.u4.Eat_1>=1)||(i0.u1.Eat_3>=1))||(u5.Eat_2>=1))||(i3.u9.Eat_10>=1))||(i2.u7.Eat_8>=1))||(u6.Eat_9>=1))||(i1.u3.Eat_6>=1))||(i2.u8.Eat_7>=1))||(i0.u0.Eat_4>=1))||(i1.u2.Eat_5>=1))")))U(X(X("(((((((((((i0.u0.Fork_4>=1)&&(i0.u0.Catch1_4>=1))||((i1.u2.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i2.u8.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i2.u7.Fork_7>=1)&&(i2.u8.Catch1_7>=1)))||((i3.u4.Catch1_1>=1)&&(i3.u4.Fork_1>=1)))||((u5.Fork_2>=1)&&(u5.Catch1_2>=1)))||((i0.u1.Fork_3>=1)&&(i0.u1.Catch1_3>=1)))||((u6.Fork_9>=1)&&(u6.Catch1_9>=1)))||((i2.u7.Catch1_8>=1)&&(u6.Fork_8>=1)))||((i3.u9.Catch1_10>=1)&&(i3.u9.Fork_10>=1)))"))))))
Formula 0 simplified : !X(GX"((((((((((i3.u4.Eat_1>=1)||(i0.u1.Eat_3>=1))||(u5.Eat_2>=1))||(i3.u9.Eat_10>=1))||(i2.u7.Eat_8>=1))||(u6.Eat_9>=1))||(i1.u3.Eat_6>=1))||(i2.u8.Eat_7>=1))||(i0.u0.Eat_4>=1))||(i1.u2.Eat_5>=1))" U XX"(((((((((((i0.u0.Fork_4>=1)&&(i0.u0.Catch1_4>=1))||((i1.u2.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i2.u8.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i2.u7.Fork_7>=1)&&(i2.u8.Catch1_7>=1)))||((i3.u4.Catch1_1>=1)&&(i3.u4.Fork_1>=1)))||((u5.Fork_2>=1)&&(u5.Catch1_2>=1)))||((i0.u1.Fork_3>=1)&&(i0.u1.Catch1_3>=1)))||((u6.Fork_9>=1)&&(u6.Catch1_9>=1)))||((i2.u7.Catch1_8>=1)&&(u6.Fork_8>=1)))||((i3.u9.Catch1_10>=1)&&(i3.u9.Fork_10>=1)))")
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
4 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.056947,19060,1,0,2305,313,625,2220,216,700,4477
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G("(((((((((((i0.u0.Fork_4>=1)&&(i0.u0.Catch1_4>=1))||((i1.u2.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i2.u8.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i2.u7.Fork_7>=1)&&(i2.u8.Catch1_7>=1)))||((i3.u4.Catch1_1>=1)&&(i3.u4.Fork_1>=1)))||((u5.Fork_2>=1)&&(u5.Catch1_2>=1)))||((i0.u1.Fork_3>=1)&&(i0.u1.Catch1_3>=1)))||((u6.Fork_9>=1)&&(u6.Catch1_9>=1)))||((i2.u7.Catch1_8>=1)&&(u6.Fork_8>=1)))||((i3.u9.Catch1_10>=1)&&(i3.u9.Fork_10>=1)))")))
Formula 1 simplified : !G"(((((((((((i0.u0.Fork_4>=1)&&(i0.u0.Catch1_4>=1))||((i1.u2.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i2.u8.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i2.u7.Fork_7>=1)&&(i2.u8.Catch1_7>=1)))||((i3.u4.Catch1_1>=1)&&(i3.u4.Fork_1>=1)))||((u5.Fork_2>=1)&&(u5.Catch1_2>=1)))||((i0.u1.Fork_3>=1)&&(i0.u1.Catch1_3>=1)))||((u6.Fork_9>=1)&&(u6.Catch1_9>=1)))||((i2.u7.Catch1_8>=1)&&(u6.Fork_8>=1)))||((i3.u9.Catch1_10>=1)&&(i3.u9.Fork_10>=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.060531,19376,1,0,2314,313,628,2225,216,700,4523
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F("(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))"))))
Formula 2 simplified : !XF"(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))"
Computing Next relation with stutter on 2 deadlock states
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.063182,19376,1,0,2327,313,704,2244,222,700,4680
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(X(F("(((((((((((i0.u1.Think_3>=1)&&(u5.Fork_2>=1))||((i3.u4.Fork_1>=1)&&(u5.Think_2>=1)))||((i3.u9.Fork_10>=1)&&(i3.u4.Think_1>=1)))||((i2.u8.Fork_6>=1)&&(i2.u8.Think_7>=1)))||((i1.u3.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i0.u0.Fork_4>=1)&&(i1.u2.Think_5>=1)))||((i0.u0.Think_4>=1)&&(i0.u1.Fork_3>=1)))||((i3.u9.Think_10>=1)&&(u6.Fork_9>=1)))||((u6.Fork_8>=1)&&(u6.Think_9>=1)))||((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=1)))"))))U(F("(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))"))))
Formula 3 simplified : !(FXF"(((((((((((i0.u1.Think_3>=1)&&(u5.Fork_2>=1))||((i3.u4.Fork_1>=1)&&(u5.Think_2>=1)))||((i3.u9.Fork_10>=1)&&(i3.u4.Think_1>=1)))||((i2.u8.Fork_6>=1)&&(i2.u8.Think_7>=1)))||((i1.u3.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i0.u0.Fork_4>=1)&&(i1.u2.Think_5>=1)))||((i0.u0.Think_4>=1)&&(i0.u1.Fork_3>=1)))||((i3.u9.Think_10>=1)&&(u6.Fork_9>=1)))||((u6.Fork_8>=1)&&(u6.Think_9>=1)))||((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=1)))" U F"(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))")
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.064918,19376,1,0,2327,313,704,2244,222,700,4689
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(("(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))")U("(((((((((((i0.u1.Think_3>=1)&&(u5.Fork_2>=1))||((i3.u4.Fork_1>=1)&&(u5.Think_2>=1)))||((i3.u9.Fork_10>=1)&&(i3.u4.Think_1>=1)))||((i2.u8.Fork_6>=1)&&(i2.u8.Think_7>=1)))||((i1.u3.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i0.u0.Fork_4>=1)&&(i1.u2.Think_5>=1)))||((i0.u0.Think_4>=1)&&(i0.u1.Fork_3>=1)))||((i3.u9.Think_10>=1)&&(u6.Fork_9>=1)))||((u6.Fork_8>=1)&&(u6.Think_9>=1)))||((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=1)))")))U(F(X(X("(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))"))))))
Formula 4 simplified : !(G("(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))" U "(((((((((((i0.u1.Think_3>=1)&&(u5.Fork_2>=1))||((i3.u4.Fork_1>=1)&&(u5.Think_2>=1)))||((i3.u9.Fork_10>=1)&&(i3.u4.Think_1>=1)))||((i2.u8.Fork_6>=1)&&(i2.u8.Think_7>=1)))||((i1.u3.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i0.u0.Fork_4>=1)&&(i1.u2.Think_5>=1)))||((i0.u0.Think_4>=1)&&(i0.u1.Fork_3>=1)))||((i3.u9.Think_10>=1)&&(u6.Fork_9>=1)))||((u6.Fork_8>=1)&&(u6.Think_9>=1)))||((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=1)))") U FXX"(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.067905,19576,1,0,2370,313,704,2283,222,700,4822
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X((F("(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))"))U(F("(((((((((((u5.Fork_2>=1)&&(i0.u1.Catch2_3>=1))||((i3.u4.Fork_1>=1)&&(u5.Catch2_2>=1)))||((i0.u0.Fork_4>=1)&&(i1.u2.Catch2_5>=1)))||((i0.u1.Fork_3>=1)&&(i0.u0.Catch2_4>=1)))||((i3.u9.Fork_10>=1)&&(i3.u4.Catch2_1>=1)))||((i3.u9.Catch2_10>=1)&&(u6.Fork_9>=1)))||((i2.u8.Catch2_7>=1)&&(i2.u8.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Catch2_6>=1)))||((u6.Catch2_9>=1)&&(u6.Fork_8>=1)))||((i2.u7.Catch2_8>=1)&&(i2.u7.Fork_7>=1)))"))))))
Formula 5 simplified : !XX(F"(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))" U F"(((((((((((u5.Fork_2>=1)&&(i0.u1.Catch2_3>=1))||((i3.u4.Fork_1>=1)&&(u5.Catch2_2>=1)))||((i0.u0.Fork_4>=1)&&(i1.u2.Catch2_5>=1)))||((i0.u1.Fork_3>=1)&&(i0.u0.Catch2_4>=1)))||((i3.u9.Fork_10>=1)&&(i3.u4.Catch2_1>=1)))||((i3.u9.Catch2_10>=1)&&(u6.Fork_9>=1)))||((i2.u8.Catch2_7>=1)&&(i2.u8.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Catch2_6>=1)))||((u6.Catch2_9>=1)&&(u6.Fork_8>=1)))||((i2.u7.Catch2_8>=1)&&(i2.u7.Fork_7>=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
4 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.102146,20940,1,0,6572,322,771,6477,224,781,10066
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(F(F("(((((((((((i0.u1.Think_3>=1)&&(u5.Fork_2>=1))||((i3.u4.Fork_1>=1)&&(u5.Think_2>=1)))||((i3.u9.Fork_10>=1)&&(i3.u4.Think_1>=1)))||((i2.u8.Fork_6>=1)&&(i2.u8.Think_7>=1)))||((i1.u3.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i0.u0.Fork_4>=1)&&(i1.u2.Think_5>=1)))||((i0.u0.Think_4>=1)&&(i0.u1.Fork_3>=1)))||((i3.u9.Think_10>=1)&&(u6.Fork_9>=1)))||((u6.Fork_8>=1)&&(u6.Think_9>=1)))||((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=1)))"))))))
Formula 6 simplified : !GXF"(((((((((((i0.u1.Think_3>=1)&&(u5.Fork_2>=1))||((i3.u4.Fork_1>=1)&&(u5.Think_2>=1)))||((i3.u9.Fork_10>=1)&&(i3.u4.Think_1>=1)))||((i2.u8.Fork_6>=1)&&(i2.u8.Think_7>=1)))||((i1.u3.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i0.u0.Fork_4>=1)&&(i1.u2.Think_5>=1)))||((i0.u0.Think_4>=1)&&(i0.u1.Fork_3>=1)))||((i3.u9.Think_10>=1)&&(u6.Fork_9>=1)))||((u6.Fork_8>=1)&&(u6.Think_9>=1)))||((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=1)))"
Computing Next relation with stutter on 2 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 50 rows 50 cols
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.125375,22260,1,0,9312,337,836,9253,230,861,15153
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((X(F("(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))")))U(F(X("(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))"))))))
Formula 7 simplified : !F(XF"(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))" U FX"(((((((((((i3.u4.Fork_1>=1)&&(i3.u4.Think_1>=1))||((i1.u3.Think_6>=1)&&(i2.u8.Fork_6>=1)))||((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1)))||((u6.Fork_8>=1)&&(i2.u7.Think_8>=1)))||((u6.Fork_9>=1)&&(u6.Think_9>=1)))||((u5.Fork_2>=1)&&(u5.Think_2>=1)))||((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1)))||((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1)))||((i3.u9.Fork_10>=1)&&(i3.u9.Think_10>=1)))")
Computing Next relation with stutter on 2 deadlock states
invariant :i1:u2:Fork_5 + i1:u2:Catch2_5 + i1:u2:Eat_5 + i1:u3:Catch1_6 + -1'i1:u3:Catch2_6 + -1'i2:u8:Fork_6 + -1'i2:u8:Catch1_7 + -1'i2:u8:Eat_7 = 0
invariant :u6:Think_9 + u6:Catch1_9 + u6:Catch2_9 + u6:Eat_9 = 1
invariant :i2:u7:Fork_7 + i2:u7:Catch1_8 + i2:u7:Eat_8 + i2:u8:Catch2_7 + i2:u8:Eat_7 = 1
invariant :i0:u0:Fork_4 + -1'i0:u0:Catch1_4 + i0:u0:Catch2_4 + -1'i0:u1:Fork_3 + -1'i0:u1:Catch2_3 + -1'i0:u1:Eat_3 + i1:u2:Catch1_5 + i1:u2:Eat_5 = 0
invariant :i1:u2:Think_5 + i1:u2:Catch1_5 + i1:u2:Catch2_5 + i1:u2:Eat_5 = 1
invariant :u5:Think_2 + u5:Catch2_2 + -1'i3:u4:Fork_1 + i3:u4:Catch1_1 + -1'i3:u4:Catch2_1 + i3:u9:Fork_10 + i3:u9:Catch2_10 + i3:u9:Eat_10 = 1
invariant :i3:u4:Think_1 + i3:u4:Catch2_1 + -1'i3:u9:Fork_10 + -1'i3:u9:Catch2_10 + -1'i3:u9:Eat_10 = 0
invariant :i0:u0:Catch1_4 + i0:u0:Eat_4 + i0:u1:Fork_3 + i0:u1:Catch2_3 + i0:u1:Eat_3 = 1
invariant :i2:u8:Think_7 + i2:u8:Catch1_7 + i2:u8:Catch2_7 + i2:u8:Eat_7 = 1
invariant :i0:u0:Think_4 + i0:u0:Catch2_4 + -1'i0:u1:Fork_3 + -1'i0:u1:Catch2_3 + -1'i0:u1:Eat_3 = 0
invariant :i3:u4:Catch1_1 + i3:u4:Eat_1 + i3:u9:Fork_10 + i3:u9:Catch2_10 + i3:u9:Eat_10 = 1
invariant :i2:u7:Think_8 + i2:u7:Catch1_8 + i2:u7:Catch2_8 + i2:u7:Eat_8 = 1
invariant :u5:Fork_2 + -1'u5:Catch1_2 + u5:Catch2_2 + i0:u1:Catch1_3 + i0:u1:Eat_3 + -1'i3:u4:Fork_1 + i3:u4:Catch1_1 + -1'i3:u4:Catch2_1 + i3:u9:Fork_10 + i3:u9:Catch2_10 + i3:u9:Eat_10 = 1
invariant :u6:Fork_8 + u6:Catch1_9 + u6:Eat_9 + i2:u7:Catch2_8 + i2:u7:Eat_8 = 1
invariant :i1:u3:Catch2_6 + i1:u3:Eat_6 + i2:u8:Fork_6 + i2:u8:Catch1_7 + i2:u8:Eat_7 = 1
invariant :i0:u1:Think_3 + i0:u1:Catch1_3 + i0:u1:Catch2_3 + i0:u1:Eat_3 = 1
invariant :u5:Catch1_2 + u5:Eat_2 + i3:u4:Fork_1 + -1'i3:u4:Catch1_1 + i3:u4:Catch2_1 + -1'i3:u9:Fork_10 + -1'i3:u9:Catch2_10 + -1'i3:u9:Eat_10 = 0
invariant :u6:Fork_9 + u6:Catch2_9 + u6:Eat_9 + i3:u9:Catch1_10 + i3:u9:Eat_10 = 1
2 unique states visited
invariant :i1:u3:Think_6 + i1:u3:Catch1_6 + -1'i2:u8:Fork_6 + -1'i2:u8:Catch1_7 + -1'i2:u8:Eat_7 = 0
invariant :i3:u9:Think_10 + i3:u9:Catch1_10 + i3:u9:Catch2_10 + i3:u9:Eat_10 = 1
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.126824,22524,1,0,9312,337,836,9253,230,861,15153
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G("((u5.Fork_2>=1)&&(u5.Catch1_2>=1))")))U(X(X("((i3.u9.Fork_10>=1)&&(i3.u4.Catch2_1>=1))")))))
Formula 8 simplified : !(XG"((u5.Fork_2>=1)&&(u5.Catch1_2>=1))" U XX"((i3.u9.Fork_10>=1)&&(i3.u4.Catch2_1>=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.130153,22872,1,0,9467,337,843,9359,233,863,15527
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(("((i2.u8.Fork_6>=1)&&(i2.u8.Think_7>=1))")U("((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1))")))U((F("(u6.Eat_9>=1)"))U(X("((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=1))")))))
Formula 9 simplified : !(F("((i2.u8.Fork_6>=1)&&(i2.u8.Think_7>=1))" U "((i2.u8.Think_7>=1)&&(i2.u7.Fork_7>=1))") U (F"(u6.Eat_9>=1)" U X"((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=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.135954,22856,1,0,10015,341,890,10047,235,926,16486
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("((i0.u0.Fork_4>=1)&&(i1.u2.Think_5>=1))")U(X("((i0.u0.Think_4>=1)&&(i0.u0.Fork_4>=1))"))))
Formula 10 simplified : !("((i0.u0.Fork_4>=1)&&(i1.u2.Think_5>=1))" U X"((i0.u0.Think_4>=1)&&(i0.u0.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.141411,23120,1,0,10910,341,930,10623,239,926,17885
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G("((i3.u9.Fork_10>=1)&&(i3.u4.Catch2_1>=1))")))
Formula 11 simplified : !G"((i3.u9.Fork_10>=1)&&(i3.u4.Catch2_1>=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,0.142055,23120,1,0,10910,341,942,10623,239,926,17893
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(i1.u3.Eat_6>=1)"))
Formula 12 simplified : !"(i1.u3.Eat_6>=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,0.142353,23120,1,0,10910,341,946,10623,240,926,17901
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F((("((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1))")U("((i3.u9.Think_10>=1)&&(u6.Fork_9>=1))"))U(G(X("((u6.Fork_9>=1)&&(u6.Catch1_9>=1))"))))))
Formula 13 simplified : !F(("((i0.u1.Think_3>=1)&&(i0.u1.Fork_3>=1))" U "((i3.u9.Think_10>=1)&&(u6.Fork_9>=1))") U GX"((u6.Fork_9>=1)&&(u6.Catch1_9>=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.143423,23120,1,0,10921,343,957,10643,242,944,17933
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(X(F(F("((i2.u7.Think_8>=1)&&(i2.u7.Fork_7>=1))"))))))
Formula 14 simplified : !FXF"((i2.u7.Think_8>=1)&&(i2.u7.Fork_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,0.143853,23364,1,0,10921,343,961,10643,242,944,17936
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1))"))
Formula 15 simplified : !"((i1.u2.Fork_5>=1)&&(i1.u2.Think_5>=1))"
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.14418,23364,1,0,10921,343,963,10643,242,944,17943
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527507492346

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 11:38:11 AM fr.lip6.move.gal.application.Application start
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/, -louvain, -smt]
May 28, 2018 11:38:11 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 11:38:11 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 39 ms
May 28, 2018 11:38:11 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
May 28, 2018 11:38:11 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 transitions.
May 28, 2018 11:38:11 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
May 28, 2018 11:38:11 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 11:38:11 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 28 ms
May 28, 2018 11:38:11 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 14 ms
Begin: Mon May 28 11:38:11 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Mon May 28 11:38:11 2018
network size: 50 nodes, 180 links, 100 weight
quality increased from -0.0223889 to 0.631911
end computation: Mon May 28 11:38:11 2018
level 1:
start computation: Mon May 28 11:38:11 2018
network size: 10 nodes, 30 links, 100 weight
quality increased from 0.631911 to 0.663911
end computation: Mon May 28 11:38:11 2018
level 2:
start computation: Mon May 28 11:38:11 2018
network size: 6 nodes, 18 links, 100 weight
quality increased from 0.663911 to 0.663911
end computation: Mon May 28 11:38:11 2018
End: Mon May 28 11:38:11 2018
Total duration: 0 sec
0.663911
May 28, 2018 11:38:11 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 11:38:11 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
May 28, 2018 11:38:11 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 11:38:11 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 10 redundant transitions.
May 28, 2018 11:38:11 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
May 28, 2018 11:38:11 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
May 28, 2018 11:38:12 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
May 28, 2018 11:38:12 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 9 ms
May 28, 2018 11:38:12 AM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 11:38:12 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 206ms conformant to PINS in folder :/home/mcc/execution

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="itstoolsl"
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

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000010.tgz
mv Philosophers-PT-000010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
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 r261-csrt-152732586100220"
echo "====================================================================="
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
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 ;