Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r030-smll-155225126600061.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstools
Input is CSRepetitions-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-155225126600061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 6.4K Feb 9 08:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 9 08:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 5 06:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 5 06:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 23:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 2 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 2 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Jan 29 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Jan 29 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 26K Mar 10 17:31 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 CSRepetitions-PT-02-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552465747244

Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/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(X(F(("(((((((((Client_Sending_3>=1)&&(Server_Anwering_3_2>=1))||((Client_Sending_4>=1)&&(Server_Anwering_4_2>=1)))||((Server_Anwering_1_1>=1)&&(Client_Sending_1>=1)))||((Server_Anwering_3_1>=1)&&(Client_Sending_3>=1)))||((Server_Anwering_2_1>=1)&&(Client_Sending_2>=1)))||((Server_Anwering_4_1>=1)&&(Client_Sending_4>=1)))||((Server_Anwering_1_2>=1)&&(Client_Sending_1>=1)))||((Client_Sending_2>=1)&&(Server_Anwering_2_2>=1)))")U("(((((((((Client_Sending_3>=1)&&(Server_Anwering_3_2>=1))||((Client_Sending_4>=1)&&(Server_Anwering_4_2>=1)))||((Server_Anwering_1_1>=1)&&(Client_Sending_1>=1)))||((Server_Anwering_3_1>=1)&&(Client_Sending_3>=1)))||((Server_Anwering_2_1>=1)&&(Client_Sending_2>=1)))||((Server_Anwering_4_1>=1)&&(Client_Sending_4>=1)))||((Server_Anwering_1_2>=1)&&(Client_Sending_1>=1)))||((Client_Sending_2>=1)&&(Server_Anwering_2_2>=1)))"))))))
Formula 0 simplified : !XXF"(((((((((Client_Sending_3>=1)&&(Server_Anwering_3_2>=1))||((Client_Sending_4>=1)&&(Server_Anwering_4_2>=1)))||((Server_Anwering_1_1>=1)&&(Client_Sending_1>=1)))||((Server_Anwering_3_1>=1)&&(Client_Sending_3>=1)))||((Server_Anwering_2_1>=1)&&(Client_Sending_2>=1)))||((Server_Anwering_4_1>=1)&&(Client_Sending_4>=1)))||((Server_Anwering_1_2>=1)&&(Client_Sending_1>=1)))||((Client_Sending_2>=1)&&(Server_Anwering_2_2>=1)))"
Reverse transition relation is NOT exact ! Due to transitions Send_Answer_3_2, Prepare_Request_2, Send_Answer_4_2, Send_Answer_1_1, Prepare_Request_3, Lose_Request_4, Prepare_Request_1, Send_Answer_3_1, Send_Answer_2_1, Lose_Request_2, Send_Answer_4_1, Lose_Request_3, Prepare_Request_4, Send_Answer_1_2, Send_Answer_2_2, Lose_Request_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
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
13 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.148276,19344,1,0,114,16766,82,59,809,17536,141
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G("(((((RequestBufferSlots>=1)&&(Client_Sending_2>=1))||((Client_Sending_4>=1)&&(RequestBufferSlots>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_1>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_3>=1)))")))
Formula 1 simplified : !G"(((((RequestBufferSlots>=1)&&(Client_Sending_2>=1))||((Client_Sending_4>=1)&&(RequestBufferSlots>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_1>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_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
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.165935,19576,1,0,114,17876,94,61,851,20570,157
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F("((((Client_Waiting_2>=1)||(Client_Waiting_3>=1))||(Client_Waiting_1>=1))||(Client_Waiting_4>=1))")))
Formula 2 simplified : !F"((((Client_Waiting_2>=1)||(Client_Waiting_3>=1))||(Client_Waiting_1>=1))||(Client_Waiting_4>=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.167063,19836,1,0,114,17876,103,61,859,20570,161
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(((((((((Client_Sending_3>=1)&&(Server_Anwering_3_2>=1))||((Client_Sending_4>=1)&&(Server_Anwering_4_2>=1)))||((Server_Anwering_1_1>=1)&&(Client_Sending_1>=1)))||((Server_Anwering_3_1>=1)&&(Client_Sending_3>=1)))||((Server_Anwering_2_1>=1)&&(Client_Sending_2>=1)))||((Server_Anwering_4_1>=1)&&(Client_Sending_4>=1)))||((Server_Anwering_1_2>=1)&&(Client_Sending_1>=1)))||((Client_Sending_2>=1)&&(Server_Anwering_2_2>=1)))"))
Formula 3 simplified : !"(((((((((Client_Sending_3>=1)&&(Server_Anwering_3_2>=1))||((Client_Sending_4>=1)&&(Server_Anwering_4_2>=1)))||((Server_Anwering_1_1>=1)&&(Client_Sending_1>=1)))||((Server_Anwering_3_1>=1)&&(Client_Sending_3>=1)))||((Server_Anwering_2_1>=1)&&(Client_Sending_2>=1)))||((Server_Anwering_4_1>=1)&&(Client_Sending_4>=1)))||((Server_Anwering_1_2>=1)&&(Client_Sending_1>=1)))||((Client_Sending_2>=1)&&(Server_Anwering_2_2>=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.169437,20100,1,0,114,17876,103,61,859,20573,163
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(X((G("((((RequestBuffer_4>=1)||(RequestBuffer_2>=1))||(RequestBuffer_3>=1))||(RequestBuffer_1>=1))"))U("(((((((((RequestBuffer_4>=1)&&(Server_Waiting_2>=1))||((RequestBuffer_3>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_1>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_2>=1)&&(Server_Waiting_2>=1)))||((Server_Waiting_2>=1)&&(RequestBuffer_1>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_4>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_3>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_2>=1)))")))))
Formula 4 simplified : !GX(G"((((RequestBuffer_4>=1)||(RequestBuffer_2>=1))||(RequestBuffer_3>=1))||(RequestBuffer_1>=1))" U "(((((((((RequestBuffer_4>=1)&&(Server_Waiting_2>=1))||((RequestBuffer_3>=1)&&(Server_Waiting_2>=1)))||((RequestBuffer_1>=1)&&(Server_Waiting_1>=1)))||((RequestBuffer_2>=1)&&(Server_Waiting_2>=1)))||((Server_Waiting_2>=1)&&(RequestBuffer_1>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_4>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_3>=1)))||((Server_Waiting_1>=1)&&(RequestBuffer_2>=1)))")
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 :Client_Sending_1 + Client_Waiting_1 = 1
invariant :Client_Waiting_3 + Client_Sending_3 = 1
invariant :Client_Waiting_4 + Client_Sending_4 = 1
invariant :Server_Anwering_3_2 + Server_Anwering_1_2 + Server_Waiting_2 + Server_Anwering_4_2 + Server_Anwering_2_2 = 1
invariant :Client_Sending_2 + Client_Waiting_2 = 1
invariant :Server_Anwering_4_1 + Server_Anwering_3_1 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Waiting_1 = 1
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
10 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.268436,22820,1,0,147,28635,115,89,890,34929,267
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("((((Client_Waiting_2>=1)||(Client_Waiting_3>=1))||(Client_Waiting_1>=1))||(Client_Waiting_4>=1))"))
Formula 5 simplified : !"((((Client_Waiting_2>=1)||(Client_Waiting_3>=1))||(Client_Waiting_1>=1))||(Client_Waiting_4>=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.269397,22820,1,0,147,28635,115,89,890,34929,267
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("((((Client_Waiting_2>=1)||(Client_Waiting_3>=1))||(Client_Waiting_1>=1))||(Client_Waiting_4>=1))"))
Formula 6 simplified : !"((((Client_Waiting_2>=1)||(Client_Waiting_3>=1))||(Client_Waiting_1>=1))||(Client_Waiting_4>=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.271124,23084,1,0,147,28635,115,89,890,34929,267
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(((((RequestBufferSlots>=1)&&(Client_Sending_2>=1))||((Client_Sending_4>=1)&&(RequestBufferSlots>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_1>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_3>=1)))"))
Formula 7 simplified : !"(((((RequestBufferSlots>=1)&&(Client_Sending_2>=1))||((Client_Sending_4>=1)&&(RequestBufferSlots>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_1>=1)))||((RequestBufferSlots>=1)&&(Client_Sending_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.272915,23084,1,0,147,28635,115,89,890,34929,267
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X((G(F("((Client_Sending_4>=1)&&(RequestBufferSlots>=1))")))U(G("((Server_Waiting_2>=1)&&(RequestBuffer_1>=1))")))))
Formula 8 simplified : !X(GF"((Client_Sending_4>=1)&&(RequestBufferSlots>=1))" U G"((Server_Waiting_2>=1)&&(RequestBuffer_1>=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
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.286282,23672,1,0,154,30035,126,95,892,37059,297
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(F(G(F(F("((Client_Sending_4>=1)&&(RequestBufferSlots>=1))")))))))
Formula 9 simplified : !XFGF"((Client_Sending_4>=1)&&(RequestBufferSlots>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.306861,24196,1,0,173,32588,133,115,892,42021,353
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G("((Server_Anwering_4_1>=1)&&(Client_Sending_4>=1))")))
Formula 10 simplified : !G"((Server_Anwering_4_1>=1)&&(Client_Sending_4>=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.308641,24460,1,0,173,32588,139,115,892,42021,358
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G("((Server_Waiting_1>=1)&&(RequestBuffer_2>=1))")))
Formula 11 simplified : !G"((Server_Waiting_1>=1)&&(RequestBuffer_2>=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.310208,24460,1,0,173,32588,145,115,892,42022,363
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(G((X("(Client_Waiting_1>=1)"))U(G("((RequestBuffer_2>=1)&&(Server_Waiting_2>=1))"))))))
Formula 12 simplified : !G(X"(Client_Waiting_1>=1)" U G"((RequestBuffer_2>=1)&&(Server_Waiting_2>=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
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.321501,25060,1,0,178,33804,151,120,892,43812,386
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((((F("((Server_Waiting_1>=1)&&(RequestBuffer_4>=1))"))U(F("((Client_Sending_4>=1)&&(RequestBufferSlots>=1))")))U("((RequestBuffer_1>=1)&&(Server_Waiting_1>=1))")))
Formula 13 simplified : !((F"((Server_Waiting_1>=1)&&(RequestBuffer_4>=1))" U F"((Client_Sending_4>=1)&&(RequestBufferSlots>=1))") U "((RequestBuffer_1>=1)&&(Server_Waiting_1>=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
25 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.573036,31076,1,0,278,62398,159,239,894,94369,623
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(X(F(("(Client_Waiting_1>=1)")U("(Client_Waiting_4>=1)"))))))
Formula 14 simplified : !FXF("(Client_Waiting_1>=1)" U "(Client_Waiting_4>=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
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.605404,31856,1,0,320,65966,168,290,894,101680,728
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(G(G(G(F("((Client_Sending_4>=1)&&(RequestBufferSlots>=1))")))))))
Formula 15 simplified : !GF"((Client_Sending_4>=1)&&(RequestBufferSlots>=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
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.606175,31856,1,0,320,65966,168,290,894,101680,728
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1552465752182

--------------------
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/ -smt
+ 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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 13, 2019 8:29:09 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]
Mar 13, 2019 8:29:09 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 13, 2019 8:29:09 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 43 ms
Mar 13, 2019 8:29:09 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 23 places.
Mar 13, 2019 8:29:09 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 transitions.
Mar 13, 2019 8:29:09 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 30 ms
Mar 13, 2019 8:29:10 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Mar 13, 2019 8:29:10 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 28 transitions.
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 6 ms
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 73 ms
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
Mar 13, 2019 8:29:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 13, 2019 8:29:11 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 16) 1) (>= (select s0 8) 1)) (= (store (store (store (store s0 16 (- (select s0 16) 1)) 20 (+ (select s0 20) 1)) 15 (+ (select s0 15) 1)) 8 (- (select s0 8) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 16) 1) (>= (select s0 8) 1)) (= (store (store (store (store s0 16 (- (select s0 16) 1)) 20 (+ (select s0 20) 1)) 15 (+ (select s0 15) 1)) 8 (- (select s0 8) 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:755)
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)
Mar 13, 2019 8:29:11 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 773ms 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-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-155225126600061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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
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 ;