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 188K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 13K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is CSRepetitions-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-ebro-152732378800114
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527573512822

05:58:37.318 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
05:58:37.322 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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.201805151631/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.201805151631/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(F(F("(((((((((Client0.clientSending_0>=1)&&(Computation0.serverAnwering_0>=1))||((Client1.clientSending_1>=1)&&(Computation2.serverAnwering_2>=1)))||((Client2.clientSending_2>=1)&&(Computation4.serverAnwering_4>=1)))||((Client3.clientSending_3>=1)&&(Computation6.serverAnwering_6>=1)))||((Client0.clientSending_0>=1)&&(Computation1.serverAnwering_1>=1)))||((Client1.clientSending_1>=1)&&(Computation3.serverAnwering_3>=1)))||((Client2.clientSending_2>=1)&&(Computation5.serverAnwering_5>=1)))||((Client3.clientSending_3>=1)&&(Computation7.serverAnwering_7>=1)))"))))))
Formula 0 simplified : !XGF"(((((((((Client0.clientSending_0>=1)&&(Computation0.serverAnwering_0>=1))||((Client1.clientSending_1>=1)&&(Computation2.serverAnwering_2>=1)))||((Client2.clientSending_2>=1)&&(Computation4.serverAnwering_4>=1)))||((Client3.clientSending_3>=1)&&(Computation6.serverAnwering_6>=1)))||((Client0.clientSending_0>=1)&&(Computation1.serverAnwering_1>=1)))||((Client1.clientSending_1>=1)&&(Computation3.serverAnwering_3>=1)))||((Client2.clientSending_2>=1)&&(Computation5.serverAnwering_5>=1)))||((Client3.clientSending_3>=1)&&(Computation7.serverAnwering_7>=1)))"
built 25 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions sendAnswer_0, sendAnswer_1, sendAnswer_2, sendAnswer_3, Client0.prepareRequest_0, Client0.loseRequest_0, Client1.prepareRequest_1, Client1.loseRequest_1, Client2.prepareRequest_2, Client2.loseRequest_2, Client3.prepareRequest_3, Client3.loseRequest_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2/12/14
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
invariant :Server1:serverWaiting_1 + Computation1:serverAnwering_1 + Computation3:serverAnwering_3 + Computation5:serverAnwering_5 + Computation7:serverAnwering_7 = 1
invariant :Client3:clientSending_3 + Client3:clientWaiting_3 = 1
invariant :Client0:clientSending_0 + Client0:clientWaiting_0 = 1
invariant :Client2:clientSending_2 + Client2:clientWaiting_2 = 1
invariant :Client1:clientSending_1 + Client1:clientWaiting_1 = 1
invariant :Server0:serverWaiting_0 + Computation0:serverAnwering_0 + Computation2:serverAnwering_2 + Computation4:serverAnwering_4 + Computation6:serverAnwering_6 = 1
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
68 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.735978,27840,1,0,27540,129,375,31501,75,803,51741
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))"))
Formula 1 simplified : !"((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))"
Computing Next relation with stutter on 1 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.737211,28104,1,0,27540,129,384,31501,75,803,51764
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G((X("(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))"))U(F("((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))"))))))
Formula 2 simplified : !G(X"(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))" U F"((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.816764,29052,1,0,31350,129,390,35048,75,831,59243
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))"))
Formula 3 simplified : !"(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))"
Computing Next relation with stutter on 1 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.819791,29844,1,0,31350,129,436,35048,75,831,59280
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))"))
Formula 4 simplified : !"(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))"
Computing Next relation with stutter on 1 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.821297,29844,1,0,31350,129,436,35048,75,831,59280
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(((((((((Client0.clientSending_0>=1)&&(Computation0.serverAnwering_0>=1))||((Client1.clientSending_1>=1)&&(Computation2.serverAnwering_2>=1)))||((Client2.clientSending_2>=1)&&(Computation4.serverAnwering_4>=1)))||((Client3.clientSending_3>=1)&&(Computation6.serverAnwering_6>=1)))||((Client0.clientSending_0>=1)&&(Computation1.serverAnwering_1>=1)))||((Client1.clientSending_1>=1)&&(Computation3.serverAnwering_3>=1)))||((Client2.clientSending_2>=1)&&(Computation5.serverAnwering_5>=1)))||((Client3.clientSending_3>=1)&&(Computation7.serverAnwering_7>=1)))"))
Formula 5 simplified : !"(((((((((Client0.clientSending_0>=1)&&(Computation0.serverAnwering_0>=1))||((Client1.clientSending_1>=1)&&(Computation2.serverAnwering_2>=1)))||((Client2.clientSending_2>=1)&&(Computation4.serverAnwering_4>=1)))||((Client3.clientSending_3>=1)&&(Computation6.serverAnwering_6>=1)))||((Client0.clientSending_0>=1)&&(Computation1.serverAnwering_1>=1)))||((Client1.clientSending_1>=1)&&(Computation3.serverAnwering_3>=1)))||((Client2.clientSending_2>=1)&&(Computation5.serverAnwering_5>=1)))||((Client3.clientSending_3>=1)&&(Computation7.serverAnwering_7>=1)))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.84312,29844,1,0,31350,129,436,35048,75,831,59316
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X("(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))")))
Formula 6 simplified : !X"(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))"
Computing Next relation with stutter on 1 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,0.847727,29844,1,0,31679,129,436,35299,75,833,60019
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G("((((Client0.requestBuffer_0>=1)||(Client1.requestBuffer_1>=1))||(Client2.requestBuffer_2>=1))||(Client3.requestBuffer_3>=1))"))))
Formula 7 simplified : !XG"((((Client0.requestBuffer_0>=1)||(Client1.requestBuffer_1>=1))||(Client2.requestBuffer_2>=1))||(Client3.requestBuffer_3>=1))"
Computing Next relation with stutter on 1 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,0.849057,29844,1,0,31679,129,443,35299,75,833,60035
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G(F("((((Client0.requestBuffer_0>=1)||(Client1.requestBuffer_1>=1))||(Client2.requestBuffer_2>=1))||(Client3.requestBuffer_3>=1))")))))
Formula 8 simplified : !GF"((((Client0.requestBuffer_0>=1)||(Client1.requestBuffer_1>=1))||(Client2.requestBuffer_2>=1))||(Client3.requestBuffer_3>=1))"
Computing Next relation with stutter on 1 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.871254,30076,1,0,33490,129,449,36892,75,836,64539
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((((Client0.requestBuffer_0>=1)||(Client1.requestBuffer_1>=1))||(Client2.requestBuffer_2>=1))||(Client3.requestBuffer_3>=1))"))
Formula 9 simplified : !"((((Client0.requestBuffer_0>=1)||(Client1.requestBuffer_1>=1))||(Client2.requestBuffer_2>=1))||(Client3.requestBuffer_3>=1))"
Computing Next relation with stutter on 1 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.872207,30340,1,0,33490,129,449,36892,75,836,64544
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F("((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))"))))
Formula 10 simplified : !XF"((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))"
Computing Next relation with stutter on 1 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.873062,30340,1,0,33490,129,449,36894,75,836,64560
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))")))
Formula 11 simplified : !F"(((((((((Server0.serverWaiting_0>=1)&&(Client0.requestBuffer_0>=1))||((Server0.serverWaiting_0>=1)&&(Client1.requestBuffer_1>=1)))||((Server0.serverWaiting_0>=1)&&(Client2.requestBuffer_2>=1)))||((Server0.serverWaiting_0>=1)&&(Client3.requestBuffer_3>=1)))||((Server1.serverWaiting_1>=1)&&(Client0.requestBuffer_0>=1)))||((Server1.serverWaiting_1>=1)&&(Client1.requestBuffer_1>=1)))||((Server1.serverWaiting_1>=1)&&(Client2.requestBuffer_2>=1)))||((Server1.serverWaiting_1>=1)&&(Client3.requestBuffer_3>=1)))"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.899535,30340,1,0,33886,129,455,37156,75,836,65688
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))")))
Formula 12 simplified : !F"((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))"
Computing Next relation with stutter on 1 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.900471,30340,1,0,33886,129,455,37156,75,836,65690
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(G(("((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))")U(G("((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))"))))))
Formula 13 simplified : !XG("((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))" U G"((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
58 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.47796,42692,1,0,63853,129,458,75147,75,1198,116214
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))")))
Formula 14 simplified : !G"((((Client0.clientWaiting_0>=1)||(Client1.clientWaiting_1>=1))||(Client2.clientWaiting_2>=1))||(Client3.clientWaiting_3>=1))"
Computing Next relation with stutter on 1 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.48145,43212,1,0,63998,129,458,75286,75,1198,116524
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F("(((((((((Client0.clientSending_0>=1)&&(Computation0.serverAnwering_0>=1))||((Client1.clientSending_1>=1)&&(Computation2.serverAnwering_2>=1)))||((Client2.clientSending_2>=1)&&(Computation4.serverAnwering_4>=1)))||((Client3.clientSending_3>=1)&&(Computation6.serverAnwering_6>=1)))||((Client0.clientSending_0>=1)&&(Computation1.serverAnwering_1>=1)))||((Client1.clientSending_1>=1)&&(Computation3.serverAnwering_3>=1)))||((Client2.clientSending_2>=1)&&(Computation5.serverAnwering_5>=1)))||((Client3.clientSending_3>=1)&&(Computation7.serverAnwering_7>=1)))")))
Formula 15 simplified : !F"(((((((((Client0.clientSending_0>=1)&&(Computation0.serverAnwering_0>=1))||((Client1.clientSending_1>=1)&&(Computation2.serverAnwering_2>=1)))||((Client2.clientSending_2>=1)&&(Computation4.serverAnwering_4>=1)))||((Client3.clientSending_3>=1)&&(Computation6.serverAnwering_6>=1)))||((Client0.clientSending_0>=1)&&(Computation1.serverAnwering_1>=1)))||((Client1.clientSending_1>=1)&&(Computation3.serverAnwering_3>=1)))||((Client2.clientSending_2>=1)&&(Computation5.serverAnwering_5>=1)))||((Client3.clientSending_3>=1)&&(Computation7.serverAnwering_7>=1)))"
Computing Next relation with stutter on 1 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,1.49847,43476,1,0,65670,129,458,76754,75,1198,121030
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1527573520893

--------------------
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/ -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/ -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 29, 2018 5:58:36 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/, -smt]
May 29, 2018 5:58:36 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 5:58:36 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 29, 2018 5:58:37 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1297 ms
May 29, 2018 5:58:37 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
May 29, 2018 5:58:37 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 29, 2018 5:58:37 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

May 29, 2018 5:58:38 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 29, 2018 5:58:38 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 29, 2018 5:58:38 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
May 29, 2018 5:58:38 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 29, 2018 5:58:38 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 29, 2018 5:58:38 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 41 ms
May 29, 2018 5:58:38 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays clientSending, requestBuffer, serverWaiting, clientWaiting, serverAnwering to variables to allow decomposition.
May 29, 2018 5:58:38 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 12 redundant transitions.
May 29, 2018 5:58:38 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
May 29, 2018 5:58:38 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 ms
May 29, 2018 5:58:38 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 14 transitions. Expanding to a total of 38 deterministic transitions.
May 29, 2018 5:58:38 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 4 ms.
May 29, 2018 5:58:39 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 23 ms
May 29, 2018 5:58:39 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 297 ms
May 29, 2018 5:58:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
May 29, 2018 5:58:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/28 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 5:58:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 5:58:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
May 29, 2018 5:58:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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 29, 2018 5:58:40 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1704ms 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="CSRepetitions-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 itstools"
echo " Input is CSRepetitions-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-ebro-152732378800114"
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 ;