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 380K
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K 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.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K 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 82K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is SharedMemory-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263400567
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527861038606

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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)>=2)"))
Formula 0 simplified : !"(((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)>=2)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
6 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.085183,18404,1,0,5,11617,14,0,1041,2926,4
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(G(G(G("(((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)>=2)"))))))
Formula 1 simplified : !XG"(((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)>=2)"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.130437,20124,1,0,11,15447,17,5,1156,9408,41
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(F(G(G("(Ext_Bus<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5))"))))))
Formula 2 simplified : !GFG"(Ext_Bus<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.159271,20800,1,0,29,16658,30,15,1318,12237,104
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G("((((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)<=((((Active_1+Active_3)+Active_2)+Active_4)+Active_5))")))
Formula 3 simplified : !G"((((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)<=((((Active_1+Active_3)+Active_2)+Active_4)+Active_5))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 55 rows 41 cols
invariant :Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Memory_1 = 1
invariant :-1'Ext_Mem_Acc_3_1 + -1'Ext_Mem_Acc_4_1 + -1'Ext_Mem_Acc_5_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + -1'Memory_1 + Active_2 + Queue_2 + OwnMemAcc_2 = 0
invariant :-1'Ext_Mem_Acc_3_2 + -1'Ext_Mem_Acc_4_2 + -1'Ext_Mem_Acc_5_2 + -1'Ext_Mem_Acc_2_3 + -1'Ext_Mem_Acc_4_3 + -1'Ext_Mem_Acc_5_3 + -1'Ext_Mem_Acc_3_4 + -1'Ext_Mem_Acc_2_4 + -1'Ext_Mem_Acc_5_4 + -1'Ext_Mem_Acc_3_5 + -1'Ext_Mem_Acc_2_5 + -1'Ext_Mem_Acc_4_5 + -1'Memory_2 + -1'Memory_4 + -1'Memory_3 + Active_1 + -1'Memory_5 + Queue_1 + OwnMemAcc_1 = -3
invariant :Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Active_5 + Queue_5 + OwnMemAcc_5 = 1
invariant :Ext_Mem_Acc_1_5 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_4_5 + Memory_5 = 1
invariant :Ext_Mem_Acc_1_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_5_3 + Memory_3 = 1
invariant :Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Memory_2 = 1
invariant :Ext_Mem_Acc_1_4 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_5_4 + Memory_4 = 1
invariant :Ext_Bus + -1'Memory_2 + -1'Memory_1 + -1'Memory_4 + -1'Memory_3 + -1'Memory_5 = -4
invariant :Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Active_4 + Queue_4 + OwnMemAcc_4 = 1
invariant :Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Active_3 + Queue_3 + OwnMemAcc_3 = 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.230863,22100,1,0,31,17668,42,15,1898,13402,132
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("(((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4))"))
Formula 4 simplified : !"(((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4))"
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.231948,22364,1,0,31,17668,45,15,1909,13402,134
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(X(G(X("(Ext_Bus>=1)"))))))
Formula 5 simplified : !GXGX"(Ext_Bus>=1)"
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.235964,22560,1,0,33,17997,51,16,1910,13797,153
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("(((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)>=1)"))
Formula 6 simplified : !"(((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)>=1)"
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.237235,22560,1,0,33,18005,54,16,1916,13805,157
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(G(G(F("(((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5))"))))))
Formula 7 simplified : !XGF"(((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.262174,22560,1,0,35,19401,63,16,2177,15356,168
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G("(OwnMemAcc_3<=Memory_1)")))
Formula 8 simplified : !G"(OwnMemAcc_3<=Memory_1)"
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.27139,23076,1,0,41,20176,69,16,2181,16224,203
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G((X("(Memory_5<=Queue_5)"))U("(Queue_3<=Active_1)"))))
Formula 9 simplified : !G(X"(Memory_5<=Queue_5)" U "(Queue_3<=Active_1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.282234,23512,1,0,45,21365,75,16,2189,17638,217
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("(Ext_Bus<=Ext_Mem_Acc_2_1)"))
Formula 10 simplified : !"(Ext_Bus<=Ext_Mem_Acc_2_1)"
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.282718,23776,1,0,45,21365,78,16,2192,17638,219
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F("(OwnMemAcc_5<=OwnMemAcc_2)")))
Formula 11 simplified : !F"(OwnMemAcc_5<=OwnMemAcc_2)"
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.283148,23776,1,0,45,21365,87,16,2195,17638,223
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("(Ext_Mem_Acc_1_5<=Ext_Mem_Acc_1_3)"))
Formula 12 simplified : !"(Ext_Mem_Acc_1_5<=Ext_Mem_Acc_1_3)"
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.283502,23776,1,0,45,21365,90,16,2198,17638,225
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("(Ext_Mem_Acc_5_3<=Queue_3)"))
Formula 13 simplified : !"(Ext_Mem_Acc_5_3<=Queue_3)"
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.283834,23776,1,0,45,21365,93,16,2201,17639,227
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("(Ext_Mem_Acc_3_5<=Ext_Mem_Acc_5_2)"))
Formula 14 simplified : !"(Ext_Mem_Acc_3_5<=Ext_Mem_Acc_5_2)"
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.284171,23776,1,0,45,21365,96,16,2204,17639,229
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(G("(Ext_Mem_Acc_2_1<=Ext_Mem_Acc_1_4)"))))
Formula 15 simplified : !G"(Ext_Mem_Acc_2_1<=Ext_Mem_Acc_1_4)"
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.291672,24040,1,0,52,21799,102,16,2208,18224,267
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1527861042900

--------------------
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 LTLCardinality -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 LTLCardinality -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
Jun 01, 2018 1:50:40 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Jun 01, 2018 1:50:40 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 1:50:40 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 55 ms
Jun 01, 2018 1:50:40 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 places.
Jun 01, 2018 1:50:41 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 transitions.
Jun 01, 2018 1:50:41 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 12 ms
Jun 01, 2018 1:50:41 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 69 ms
Jun 01, 2018 1:50:41 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
Jun 01, 2018 1:50:41 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 01, 2018 1:50:41 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 55 transitions.
Jun 01, 2018 1:50:41 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 13 ms
Skipping mayMatrices nes/nds SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 33) 0)")
java.lang.RuntimeException: SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 33) 0)")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:102)
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)
Jun 01, 2018 1:50:41 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 351ms 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="SharedMemory-PT-000005"
export BK_EXAMINATION="LTLCardinality"
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/SharedMemory-PT-000005.tgz
mv SharedMemory-PT-000005 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 SharedMemory-PT-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-smll-152732263400567"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;