fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r201-csrt-155286433900241
Last Updated
Apr 15, 2019

About the Execution of ITS-Tools.M for SharedMemory-PT-000005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
347.950 26403.00 50287.00 207.60 FFFFTFFTFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r201-csrt-155286433900241.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is SharedMemory-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-csrt-155286433900241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 7.3K Feb 12 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 12 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 8 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 8 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 5.0K Feb 5 01:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 5 01:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 4 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 4 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 1 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 1 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.7K Feb 4 22:30 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 82K 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 SharedMemory-PT-000005-LTLFireability-00
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-01
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-02
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-03
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-04
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-05
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-06
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-07
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-08
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-09
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-10
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-11
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-12
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-13
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-14
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553799424851

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))")U(G("((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))")))U(F(G(G("((((((((((((((((((((Ext_Mem_Acc_4_1>=1)||(Ext_Mem_Acc_5_1>=1))||(Ext_Mem_Acc_2_1>=1))||(Ext_Mem_Acc_3_1>=1))||(Ext_Mem_Acc_5_2>=1))||(Ext_Mem_Acc_4_2>=1))||(Ext_Mem_Acc_3_2>=1))||(Ext_Mem_Acc_1_2>=1))||(Ext_Mem_Acc_5_3>=1))||(Ext_Mem_Acc_4_3>=1))||(Ext_Mem_Acc_2_3>=1))||(Ext_Mem_Acc_1_3>=1))||(Ext_Mem_Acc_5_4>=1))||(Ext_Mem_Acc_3_4>=1))||(Ext_Mem_Acc_2_4>=1))||(Ext_Mem_Acc_1_4>=1))||(Ext_Mem_Acc_4_5>=1))||(Ext_Mem_Acc_3_5>=1))||(Ext_Mem_Acc_2_5>=1))||(Ext_Mem_Acc_1_5>=1))"))))))
Formula 0 simplified : !(("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))" U G"((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))") U FG"((((((((((((((((((((Ext_Mem_Acc_4_1>=1)||(Ext_Mem_Acc_5_1>=1))||(Ext_Mem_Acc_2_1>=1))||(Ext_Mem_Acc_3_1>=1))||(Ext_Mem_Acc_5_2>=1))||(Ext_Mem_Acc_4_2>=1))||(Ext_Mem_Acc_3_2>=1))||(Ext_Mem_Acc_1_2>=1))||(Ext_Mem_Acc_5_3>=1))||(Ext_Mem_Acc_4_3>=1))||(Ext_Mem_Acc_2_3>=1))||(Ext_Mem_Acc_1_3>=1))||(Ext_Mem_Acc_5_4>=1))||(Ext_Mem_Acc_3_4>=1))||(Ext_Mem_Acc_2_4>=1))||(Ext_Mem_Acc_1_4>=1))||(Ext_Mem_Acc_4_5>=1))||(Ext_Mem_Acc_3_5>=1))||(Ext_Mem_Acc_2_5>=1))||(Ext_Mem_Acc_1_5>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12 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.187995,22392,1,0,28,20638,24,10,1211,12668,68
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((("(((((Active_2>=1)||(Active_1>=1))||(Active_5>=1))||(Active_3>=1))||(Active_4>=1))")U(G("((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))")))U((F("(((((Active_2>=1)||(Active_1>=1))||(Active_5>=1))||(Active_3>=1))||(Active_4>=1))"))U(G("((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))")))))
Formula 1 simplified : !(("(((((Active_2>=1)||(Active_1>=1))||(Active_5>=1))||(Active_3>=1))||(Active_4>=1))" U G"((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))") U (F"(((((Active_2>=1)||(Active_1>=1))||(Active_5>=1))||(Active_3>=1))||(Active_4>=1))" U G"((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 55 rows 41 cols
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.327306,25112,1,0,37,28176,64,17,1381,21072,133
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((X(X(G("((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))"))))U(X("((((((((((((((((((((Ext_Mem_Acc_4_1>=1)||(Ext_Mem_Acc_5_1>=1))||(Ext_Mem_Acc_2_1>=1))||(Ext_Mem_Acc_3_1>=1))||(Ext_Mem_Acc_5_2>=1))||(Ext_Mem_Acc_4_2>=1))||(Ext_Mem_Acc_3_2>=1))||(Ext_Mem_Acc_1_2>=1))||(Ext_Mem_Acc_5_3>=1))||(Ext_Mem_Acc_4_3>=1))||(Ext_Mem_Acc_2_3>=1))||(Ext_Mem_Acc_1_3>=1))||(Ext_Mem_Acc_5_4>=1))||(Ext_Mem_Acc_3_4>=1))||(Ext_Mem_Acc_2_4>=1))||(Ext_Mem_Acc_1_4>=1))||(Ext_Mem_Acc_4_5>=1))||(Ext_Mem_Acc_3_5>=1))||(Ext_Mem_Acc_2_5>=1))||(Ext_Mem_Acc_1_5>=1))"))))
Formula 2 simplified : !(XXG"((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))" U X"((((((((((((((((((((Ext_Mem_Acc_4_1>=1)||(Ext_Mem_Acc_5_1>=1))||(Ext_Mem_Acc_2_1>=1))||(Ext_Mem_Acc_3_1>=1))||(Ext_Mem_Acc_5_2>=1))||(Ext_Mem_Acc_4_2>=1))||(Ext_Mem_Acc_3_2>=1))||(Ext_Mem_Acc_1_2>=1))||(Ext_Mem_Acc_5_3>=1))||(Ext_Mem_Acc_4_3>=1))||(Ext_Mem_Acc_2_3>=1))||(Ext_Mem_Acc_1_3>=1))||(Ext_Mem_Acc_5_4>=1))||(Ext_Mem_Acc_3_4>=1))||(Ext_Mem_Acc_2_4>=1))||(Ext_Mem_Acc_1_4>=1))||(Ext_Mem_Acc_4_5>=1))||(Ext_Mem_Acc_3_5>=1))||(Ext_Mem_Acc_2_5>=1))||(Ext_Mem_Acc_1_5>=1))")
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
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8 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.401419,26368,1,0,48,30692,77,20,1408,24828,177
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((false))
Formula 3 simplified : 1
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.401876,26368,1,0,48,30694,79,20,1408,24831,184
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(F("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))"))))
Formula 4 simplified : !XF"(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))"
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.405745,26368,1,0,48,30694,86,20,1408,24831,188
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G((F(G("((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))")))U(("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))")U("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))")))))
Formula 5 simplified : !G(FG"((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))" U "(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
21 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.63523,31084,1,0,75,49892,97,36,1411,56240,260
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(F("((((((((((((((((((((Ext_Mem_Acc_4_1>=1)||(Ext_Mem_Acc_5_1>=1))||(Ext_Mem_Acc_2_1>=1))||(Ext_Mem_Acc_3_1>=1))||(Ext_Mem_Acc_5_2>=1))||(Ext_Mem_Acc_4_2>=1))||(Ext_Mem_Acc_3_2>=1))||(Ext_Mem_Acc_1_2>=1))||(Ext_Mem_Acc_5_3>=1))||(Ext_Mem_Acc_4_3>=1))||(Ext_Mem_Acc_2_3>=1))||(Ext_Mem_Acc_1_3>=1))||(Ext_Mem_Acc_5_4>=1))||(Ext_Mem_Acc_3_4>=1))||(Ext_Mem_Acc_2_4>=1))||(Ext_Mem_Acc_1_4>=1))||(Ext_Mem_Acc_4_5>=1))||(Ext_Mem_Acc_3_5>=1))||(Ext_Mem_Acc_2_5>=1))||(Ext_Mem_Acc_1_5>=1))"))))
Formula 6 simplified : !GF"((((((((((((((((((((Ext_Mem_Acc_4_1>=1)||(Ext_Mem_Acc_5_1>=1))||(Ext_Mem_Acc_2_1>=1))||(Ext_Mem_Acc_3_1>=1))||(Ext_Mem_Acc_5_2>=1))||(Ext_Mem_Acc_4_2>=1))||(Ext_Mem_Acc_3_2>=1))||(Ext_Mem_Acc_1_2>=1))||(Ext_Mem_Acc_5_3>=1))||(Ext_Mem_Acc_4_3>=1))||(Ext_Mem_Acc_2_3>=1))||(Ext_Mem_Acc_1_3>=1))||(Ext_Mem_Acc_5_4>=1))||(Ext_Mem_Acc_3_4>=1))||(Ext_Mem_Acc_2_4>=1))||(Ext_Mem_Acc_1_4>=1))||(Ext_Mem_Acc_4_5>=1))||(Ext_Mem_Acc_3_5>=1))||(Ext_Mem_Acc_2_5>=1))||(Ext_Mem_Acc_1_5>=1))"
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.637178,31084,1,0,75,49892,103,36,1411,56240,264
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((true))
Formula 7 simplified : 0
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.637304,31084,1,0,75,49892,103,36,1411,56240,264
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((((F("(Ext_Mem_Acc_2_3>=1)"))U(X("(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1))")))U((F("(Ext_Mem_Acc_2_1>=1)"))U(F("(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1))")))))
Formula 8 simplified : !((F"(Ext_Mem_Acc_2_3>=1)" U X"(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1))") U (F"(Ext_Mem_Acc_2_1>=1)" U F"(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1))"))
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.667527,31584,1,0,86,51880,112,41,1411,59077,301
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F((F("(Ext_Mem_Acc_4_1>=1)"))U("(Ext_Mem_Acc_5_1>=1)"))))
Formula 9 simplified : !F(F"(Ext_Mem_Acc_4_1>=1)" U "(Ext_Mem_Acc_5_1>=1)")
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.676948,31848,1,0,91,52141,121,41,1411,59583,335
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((((G("(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1))"))U(X("(Active_1>=1)")))U(F(("(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1))")U("(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1))")))))
Formula 10 simplified : !((G"(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1))" U X"(Active_1>=1)") U F("(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1))" U "(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.71669,32640,1,0,102,54325,130,46,1411,62963,372
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(((X("(Ext_Mem_Acc_4_3>=1)"))U(G(F(G("(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1))"))))))
Formula 11 simplified : !(X"(Ext_Mem_Acc_4_3>=1)" U GFG"(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.764885,34212,1,0,127,59209,143,57,1411,74856,440
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((X(X(G("((OwnMemAcc_3>=1)&&(Memory_3>=1))"))))U(G(G(G("(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1))"))))))
Formula 12 simplified : !(XXG"((OwnMemAcc_3>=1)&&(Memory_3>=1))" U G"(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1))")
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.774008,34464,1,0,130,60270,149,57,1411,75739,460
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((F(G("(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1))")))U(F(G("(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1))")))))
Formula 13 simplified : !(FG"(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1))" U FG"(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1))")
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.777322,34728,1,0,155,60379,162,68,1411,76143,528
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(F("(Ext_Mem_Acc_5_1>=1)"))))
Formula 14 simplified : !XF"(Ext_Mem_Acc_5_1>=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.777838,34992,1,0,155,60379,162,68,1411,76143,531
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X((X("(Ext_Mem_Acc_3_5>=1)"))U(("(Ext_Mem_Acc_5_4>=1)")U("(Active_4>=1)")))))
Formula 15 simplified : !X(X"(Ext_Mem_Acc_3_5>=1)" U ("(Ext_Mem_Acc_5_4>=1)" U "(Active_4>=1)"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.780286,34992,1,0,158,60389,181,68,1421,76159,549
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-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 1553799451254

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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 28, 2019 6:57:07 PM 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 28, 2019 6:57:07 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 51 ms
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 places.
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 transitions.
Mar 28, 2019 6:57:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 33 ms
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 31 ms
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 55 transitions.
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 41 places.
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 55 transitions.
Mar 28, 2019 6:57:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 28, 2019 6:57:08 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 28, 2019 6:57:08 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 55 transitions.
Mar 28, 2019 6:57:09 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 32 ms
Mar 28, 2019 6:57:09 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 41 variables to be positive in 526 ms
Mar 28, 2019 6:57:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 55 transitions.
Mar 28, 2019 6:57:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/55 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 6:57:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 6:57:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 55 transitions.
Mar 28, 2019 6:57:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 6:57:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 55 transitions.
Mar 28, 2019 6:57:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/55) took 38 ms. Total solver calls (SAT/UNSAT): 26(9/17)
Mar 28, 2019 6:57:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(13/55) took 3062 ms. Total solver calls (SAT/UNSAT): 369(198/171)
Mar 28, 2019 6:57:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(25/55) took 6331 ms. Total solver calls (SAT/UNSAT): 648(413/235)
Mar 28, 2019 6:57:30 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(43/55) took 9359 ms. Total solver calls (SAT/UNSAT): 872(611/261)
Mar 28, 2019 6:57:30 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 9823 ms. Total solver calls (SAT/UNSAT): 894(629/265)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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 28, 2019 6:57:30 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 21980ms 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="LTLFireability"
export BK_TOOL="itstoolsm"
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-3954"
echo " Executing tool itstoolsm"
echo " Input is SharedMemory-PT-000005, 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 r201-csrt-155286433900241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000005.tgz
mv SharedMemory-PT-000005 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 ;