fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r212-smll-152732263400539
Last Updated
June 26, 2018

About the Execution of ITS-Tools for SharedMemory-COL-000005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15754.270 6735.00 10862.00 544.90 TTFFTFFFFFTTFTTF normal

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 180K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 2.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is SharedMemory-COL-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263400539
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527844320812

09:12:04.009 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
09:12:04.013 [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/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_0+memory_1)+memory_2)+memory_3)+memory_4)>=2)"))
Formula 0 simplified : !"(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=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.083504,17584,1,0,5,7626,14,0,935,1674,4
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(G(G("(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=2)"))))))
Formula 1 simplified : !XG"(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=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.141316,19192,1,0,11,15164,17,5,992,7227,41
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(G(G("(extBus_0<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))"))))))
Formula 2 simplified : !GFG"(extBus_0<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))"
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.174141,19868,1,0,29,17183,30,15,1107,9522,104
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("(((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24)<=((((active_0+active_1)+active_2)+active_3)+active_4))")))
Formula 3 simplified : !G"(((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24)<=((((active_0+active_1)+active_2)+active_3)+active_4))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.214302,20648,1,0,31,20250,42,15,1543,10931,132
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(((((ownMemAcc_0+ownMemAcc_1)+ownMemAcc_2)+ownMemAcc_3)+ownMemAcc_4)<=((((queue_0+queue_1)+queue_2)+queue_3)+queue_4))"))
Formula 4 simplified : !"(((((ownMemAcc_0+ownMemAcc_1)+ownMemAcc_2)+ownMemAcc_3)+ownMemAcc_4)<=((((queue_0+queue_1)+queue_2)+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.215125,20912,1,0,31,20250,45,15,1555,10931,134
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(G(X("(extBus_0>=1)"))))))
Formula 5 simplified : !GXGX"(extBus_0>=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.219002,21108,1,0,33,21002,51,16,1556,11284,153
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(((((ownMemAcc_0+ownMemAcc_1)+ownMemAcc_2)+ownMemAcc_3)+ownMemAcc_4)>=1)"))
Formula 6 simplified : !"(((((ownMemAcc_0+ownMemAcc_1)+ownMemAcc_2)+ownMemAcc_3)+ownMemAcc_4)>=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.219897,21108,1,0,33,21005,54,16,1562,11290,157
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(G(F("(((((queue_0+queue_1)+queue_2)+queue_3)+queue_4)<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))"))))))
Formula 7 simplified : !XGF"(((((queue_0+queue_1)+queue_2)+queue_3)+queue_4)<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))"
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.243399,21624,1,0,35,23975,63,16,1773,12929,168
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(G(X("(((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24)>=2)"))))))
Formula 8 simplified : !FXGX"(((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24)>=2)"
3 unique states visited
2 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.24762,21828,1,0,35,23979,68,16,1829,12933,171
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(F(F("(((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24)>=2)"))))))
Formula 9 simplified : !XF"(((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24)>=2)"
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.250875,21828,1,0,35,23979,72,16,1829,12933,185
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(X("(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=3)")))))
Formula 10 simplified : !FGX"(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=3)"
2 unique states visited
0 strongly connected components in search stack
2 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.252127,22092,1,0,35,23980,77,16,1839,12935,190
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X(F(F("(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=2)"))))))
Formula 11 simplified : !FXF"(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=2)"
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.252674,22092,1,0,35,23980,83,16,1839,12935,194
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(F("(extBus_0<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))"))))
Formula 12 simplified : !F"(extBus_0<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))"
2 unique states visited
2 strongly connected components in search stack
2 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.254256,22092,1,0,35,23980,89,16,1839,12935,207
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("(((((ownMemAcc_0+ownMemAcc_1)+ownMemAcc_2)+ownMemAcc_3)+ownMemAcc_4)<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))"))
Formula 13 simplified : !"(((((ownMemAcc_0+ownMemAcc_1)+ownMemAcc_2)+ownMemAcc_3)+ownMemAcc_4)<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.256045,22092,1,0,35,23980,92,16,1871,12935,209
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=2)")))
Formula 14 simplified : !G"(((((memory_0+memory_1)+memory_2)+memory_3)+memory_4)>=2)"
1 unique states visited
0 strongly connected components in search stack
1 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.256766,22092,1,0,35,23980,92,16,1871,12935,214
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F(X("(((((queue_0+queue_1)+queue_2)+queue_3)+queue_4)<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))")))U("(extBus_0<=((((ownMemAcc_0+ownMemAcc_1)+ownMemAcc_2)+ownMemAcc_3)+ownMemAcc_4))")))
Formula 15 simplified : !(FX"(((((queue_0+queue_1)+queue_2)+queue_3)+queue_4)<=((((((((((((((((((((((((extMemAcc_0+extMemAcc_1)+extMemAcc_2)+extMemAcc_3)+extMemAcc_4)+extMemAcc_5)+extMemAcc_6)+extMemAcc_7)+extMemAcc_8)+extMemAcc_9)+extMemAcc_10)+extMemAcc_11)+extMemAcc_12)+extMemAcc_13)+extMemAcc_14)+extMemAcc_15)+extMemAcc_16)+extMemAcc_17)+extMemAcc_18)+extMemAcc_19)+extMemAcc_20)+extMemAcc_21)+extMemAcc_22)+extMemAcc_23)+extMemAcc_24))" U "(extBus_0<=((((ownMemAcc_0+ownMemAcc_1)+ownMemAcc_2)+ownMemAcc_3)+ownMemAcc_4))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 60 rows 46 cols
invariant :ownMemAcc_1 + queue_1 + active_1 + extMemAcc_5 + extMemAcc_6 + extMemAcc_7 + extMemAcc_8 + extMemAcc_9 = 1
invariant :memory_0 + extMemAcc_0 + extMemAcc_5 + extMemAcc_10 + extMemAcc_15 + extMemAcc_20 = 1
invariant :memory_4 + extMemAcc_4 + extMemAcc_9 + extMemAcc_14 + extMemAcc_19 + extMemAcc_24 = 1
invariant :memory_1 + -1'extMemAcc_0 + -1'extMemAcc_2 + -1'extMemAcc_3 + -1'extMemAcc_4 + -1'extMemAcc_5 + -1'extMemAcc_7 + -1'extMemAcc_8 + -1'extMemAcc_9 + -1'extMemAcc_10 + -1'extMemAcc_12 + -1'extMemAcc_13 + -1'extMemAcc_14 + -1'extMemAcc_15 + -1'extMemAcc_17 + -1'extMemAcc_18 + -1'extMemAcc_19 + -1'extMemAcc_20 + -1'extMemAcc_22 + -1'extMemAcc_23 + -1'extMemAcc_24 + -1'extBus_0 = 0
invariant :ownMemAcc_2 + queue_2 + active_2 + extMemAcc_10 + extMemAcc_11 + extMemAcc_12 + extMemAcc_13 + extMemAcc_14 = 1
invariant :memory_2 + extMemAcc_2 + extMemAcc_7 + extMemAcc_12 + extMemAcc_17 + extMemAcc_22 = 1
invariant :ownMemAcc_3 + queue_3 + active_3 + extMemAcc_15 + extMemAcc_16 + extMemAcc_17 + extMemAcc_18 + extMemAcc_19 = 1
invariant :ownMemAcc_4 + queue_4 + active_4 + extMemAcc_20 + extMemAcc_21 + extMemAcc_22 + extMemAcc_23 + extMemAcc_24 = 1
invariant :memory_3 + extMemAcc_3 + extMemAcc_8 + extMemAcc_13 + extMemAcc_18 + extMemAcc_23 = 1
invariant :extMemAcc_0 + extMemAcc_1 + extMemAcc_2 + extMemAcc_3 + extMemAcc_4 + extMemAcc_5 + extMemAcc_6 + extMemAcc_7 + extMemAcc_8 + extMemAcc_9 + extMemAcc_10 + extMemAcc_11 + extMemAcc_12 + extMemAcc_13 + extMemAcc_14 + extMemAcc_15 + extMemAcc_16 + extMemAcc_17 + extMemAcc_18 + extMemAcc_19 + extMemAcc_20 + extMemAcc_21 + extMemAcc_22 + extMemAcc_23 + extMemAcc_24 + extBus_0 = 1
invariant :ownMemAcc_0 + queue_0 + active_0 + -1'extMemAcc_5 + -1'extMemAcc_6 + -1'extMemAcc_7 + -1'extMemAcc_8 + -1'extMemAcc_9 + -1'extMemAcc_10 + -1'extMemAcc_11 + -1'extMemAcc_12 + -1'extMemAcc_13 + -1'extMemAcc_14 + -1'extMemAcc_15 + -1'extMemAcc_16 + -1'extMemAcc_17 + -1'extMemAcc_18 + -1'extMemAcc_19 + -1'extMemAcc_20 + -1'extMemAcc_21 + -1'extMemAcc_22 + -1'extMemAcc_23 + -1'extMemAcc_24 + -1'extBus_0 = 0
9 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 items max in DFS search stack
18 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.445136,26792,1,0,96,52451,97,48,1883,43984,387
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-15 FALSE 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 1527844327547

--------------------
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 9:12:03 AM 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 9:12:03 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 9:12:03 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1079 ms
Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :P->ownMemAcc,queue,memory,active,
Dot->extBus,
PxP->extMemAcc,

Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 01, 2018 9:12:04 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $m and $x of transition endOwnAcc
Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 5.0 instantiations of transitions. Total transitions/syncs built is 72
Jun 01, 2018 9:12:04 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 80 ms
Jun 01, 2018 9:12:05 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
Jun 01, 2018 9:12:05 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Jun 01, 2018 9:12:05 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 17 transitions. Expanding to a total of 72 deterministic transitions.
Jun 01, 2018 9:12:05 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 8 ms.
Jun 01, 2018 9:12:05 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 21 ms
Skipping mayMatrices nes/nds SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 20) 0)")
java.lang.RuntimeException: SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 20) 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 9:12:05 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 533ms 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-COL-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-COL-000005.tgz
mv SharedMemory-COL-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-COL-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-152732263400539"
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 ;