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 itstoolsl
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 r213-smll-152732264600568
=====================================================================

--------------------
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 1527862468500

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph496104974504233855.txt, -o, /tmp/graph496104974504233855.bin, -w, /tmp/graph496104974504233855.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph496104974504233855.bin, -l, -1, -v, -w, /tmp/graph496104974504233855.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((("((((((((((((((((((((((u1.Ext_Bus>=1)&&(u2.Memory_2>=1))&&(u4.Queue_1>=1))||(((u1.Ext_Bus>=1)&&(u9.Queue_3>=1))&&(u2.Memory_2>=1)))||(((u1.Ext_Bus>=1)&&(u6.Queue_4>=1))&&(u2.Memory_2>=1)))||(((u7.Queue_5>=1)&&(u2.Memory_2>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u0.Memory_1>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u9.Queue_3>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u6.Queue_4>=1)))||(((u0.Memory_1>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u1.Memory_4>=1))&&(u4.Queue_1>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u1.Memory_4>=1)))||(((u9.Queue_3>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u4.Queue_1>=1))&&(u3.Memory_3>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u8.Queue_2>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u6.Queue_4>=1)))||(((u3.Memory_3>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u5.Memory_5>=1))&&(u8.Queue_2>=1)))||(((u4.Queue_1>=1)&&(u5.Memory_5>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1)))")U(F("(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u7.Active_5>=1))||(u9.Active_3>=1))||(u6.Active_4>=1))")))U(X(("((((((((((((((((((((((u1.Ext_Bus>=1)&&(u2.Memory_2>=1))&&(u4.Queue_1>=1))||(((u1.Ext_Bus>=1)&&(u9.Queue_3>=1))&&(u2.Memory_2>=1)))||(((u1.Ext_Bus>=1)&&(u6.Queue_4>=1))&&(u2.Memory_2>=1)))||(((u7.Queue_5>=1)&&(u2.Memory_2>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u0.Memory_1>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u9.Queue_3>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u6.Queue_4>=1)))||(((u0.Memory_1>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u1.Memory_4>=1))&&(u4.Queue_1>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u1.Memory_4>=1)))||(((u9.Queue_3>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u4.Queue_1>=1))&&(u3.Memory_3>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u8.Queue_2>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u6.Queue_4>=1)))||(((u3.Memory_3>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u5.Memory_5>=1))&&(u8.Queue_2>=1)))||(((u4.Queue_1>=1)&&(u5.Memory_5>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1)))")U("((((((u7.OwnMemAcc_5>=1)&&(u5.Memory_5>=1))||((u6.OwnMemAcc_4>=1)&&(u1.Memory_4>=1)))||((u4.OwnMemAcc_1>=1)&&(u0.Memory_1>=1)))||((u9.OwnMemAcc_3>=1)&&(u3.Memory_3>=1)))||((u8.OwnMemAcc_2>=1)&&(u2.Memory_2>=1)))")))))
Formula 0 simplified : !(("((((((((((((((((((((((u1.Ext_Bus>=1)&&(u2.Memory_2>=1))&&(u4.Queue_1>=1))||(((u1.Ext_Bus>=1)&&(u9.Queue_3>=1))&&(u2.Memory_2>=1)))||(((u1.Ext_Bus>=1)&&(u6.Queue_4>=1))&&(u2.Memory_2>=1)))||(((u7.Queue_5>=1)&&(u2.Memory_2>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u0.Memory_1>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u9.Queue_3>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u6.Queue_4>=1)))||(((u0.Memory_1>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u1.Memory_4>=1))&&(u4.Queue_1>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u1.Memory_4>=1)))||(((u9.Queue_3>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u4.Queue_1>=1))&&(u3.Memory_3>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u8.Queue_2>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u6.Queue_4>=1)))||(((u3.Memory_3>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u5.Memory_5>=1))&&(u8.Queue_2>=1)))||(((u4.Queue_1>=1)&&(u5.Memory_5>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1)))" U F"(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u7.Active_5>=1))||(u9.Active_3>=1))||(u6.Active_4>=1))") U X("((((((((((((((((((((((u1.Ext_Bus>=1)&&(u2.Memory_2>=1))&&(u4.Queue_1>=1))||(((u1.Ext_Bus>=1)&&(u9.Queue_3>=1))&&(u2.Memory_2>=1)))||(((u1.Ext_Bus>=1)&&(u6.Queue_4>=1))&&(u2.Memory_2>=1)))||(((u7.Queue_5>=1)&&(u2.Memory_2>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u0.Memory_1>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u9.Queue_3>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u6.Queue_4>=1)))||(((u0.Memory_1>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u1.Memory_4>=1))&&(u4.Queue_1>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u1.Memory_4>=1)))||(((u9.Queue_3>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u4.Queue_1>=1))&&(u3.Memory_3>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u8.Queue_2>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u6.Queue_4>=1)))||(((u3.Memory_3>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u5.Memory_5>=1))&&(u8.Queue_2>=1)))||(((u4.Queue_1>=1)&&(u5.Memory_5>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1)))" U "((((((u7.OwnMemAcc_5>=1)&&(u5.Memory_5>=1))||((u6.OwnMemAcc_4>=1)&&(u1.Memory_4>=1)))||((u4.OwnMemAcc_1>=1)&&(u0.Memory_1>=1)))||((u9.OwnMemAcc_3>=1)&&(u3.Memory_3>=1)))||((u8.OwnMemAcc_2>=1)&&(u2.Memory_2>=1)))"))
built 25 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
2 strongly connected components in search stack
4 transitions explored
4 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.067576,18776,1,0,3459,225,859,2084,172,473,13767
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 USE_NUPN
Checking formula 1 : !((X(X(X("(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))")))))
Formula 1 simplified : !XXX"(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))"
4 unique states visited
0 strongly connected components in search stack
3 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.069717,19180,1,0,3586,225,861,2162,172,476,14430
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(G(F(F("(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u7.Active_5>=1))||(u9.Active_3>=1))||(u6.Active_4>=1))")))))))
Formula 2 simplified : !XFGF"(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u7.Active_5>=1))||(u9.Active_3>=1))||(u6.Active_4>=1))"
3 unique states visited
0 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.078631,19180,1,0,4195,236,938,2632,178,508,18594
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((G("((((((((((((((((((((u0.Ext_Mem_Acc_4_1>=1)||(u7.Ext_Mem_Acc_5_1>=1))||(u0.Ext_Mem_Acc_2_1>=1))||(u0.Ext_Mem_Acc_3_1>=1))||(u2.Ext_Mem_Acc_5_2>=1))||(u2.Ext_Mem_Acc_4_2>=1))||(u9.Ext_Mem_Acc_3_2>=1))||(u2.Ext_Mem_Acc_1_2>=1))||(u3.Ext_Mem_Acc_5_3>=1))||(u6.Ext_Mem_Acc_4_3>=1))||(u3.Ext_Mem_Acc_2_3>=1))||(u3.Ext_Mem_Acc_1_3>=1))||(u1.Ext_Mem_Acc_5_4>=1))||(u1.Ext_Mem_Acc_3_4>=1))||(u1.Ext_Mem_Acc_2_4>=1))||(u1.Ext_Mem_Acc_1_4>=1))||(u5.Ext_Mem_Acc_4_5>=1))||(u5.Ext_Mem_Acc_3_5>=1))||(u5.Ext_Mem_Acc_2_5>=1))||(u4.Ext_Mem_Acc_1_5>=1))"))U(F("((((((((((((((((((((((u1.Ext_Bus>=1)&&(u2.Memory_2>=1))&&(u4.Queue_1>=1))||(((u1.Ext_Bus>=1)&&(u9.Queue_3>=1))&&(u2.Memory_2>=1)))||(((u1.Ext_Bus>=1)&&(u6.Queue_4>=1))&&(u2.Memory_2>=1)))||(((u7.Queue_5>=1)&&(u2.Memory_2>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u0.Memory_1>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u9.Queue_3>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u6.Queue_4>=1)))||(((u0.Memory_1>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u1.Memory_4>=1))&&(u4.Queue_1>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u1.Memory_4>=1)))||(((u9.Queue_3>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u4.Queue_1>=1))&&(u3.Memory_3>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u8.Queue_2>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u6.Queue_4>=1)))||(((u3.Memory_3>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u5.Memory_5>=1))&&(u8.Queue_2>=1)))||(((u4.Queue_1>=1)&&(u5.Memory_5>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1)))"))))))
Formula 3 simplified : !XF(G"((((((((((((((((((((u0.Ext_Mem_Acc_4_1>=1)||(u7.Ext_Mem_Acc_5_1>=1))||(u0.Ext_Mem_Acc_2_1>=1))||(u0.Ext_Mem_Acc_3_1>=1))||(u2.Ext_Mem_Acc_5_2>=1))||(u2.Ext_Mem_Acc_4_2>=1))||(u9.Ext_Mem_Acc_3_2>=1))||(u2.Ext_Mem_Acc_1_2>=1))||(u3.Ext_Mem_Acc_5_3>=1))||(u6.Ext_Mem_Acc_4_3>=1))||(u3.Ext_Mem_Acc_2_3>=1))||(u3.Ext_Mem_Acc_1_3>=1))||(u1.Ext_Mem_Acc_5_4>=1))||(u1.Ext_Mem_Acc_3_4>=1))||(u1.Ext_Mem_Acc_2_4>=1))||(u1.Ext_Mem_Acc_1_4>=1))||(u5.Ext_Mem_Acc_4_5>=1))||(u5.Ext_Mem_Acc_3_5>=1))||(u5.Ext_Mem_Acc_2_5>=1))||(u4.Ext_Mem_Acc_1_5>=1))" U F"((((((((((((((((((((((u1.Ext_Bus>=1)&&(u2.Memory_2>=1))&&(u4.Queue_1>=1))||(((u1.Ext_Bus>=1)&&(u9.Queue_3>=1))&&(u2.Memory_2>=1)))||(((u1.Ext_Bus>=1)&&(u6.Queue_4>=1))&&(u2.Memory_2>=1)))||(((u7.Queue_5>=1)&&(u2.Memory_2>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u0.Memory_1>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u9.Queue_3>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u6.Queue_4>=1)))||(((u0.Memory_1>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u1.Memory_4>=1))&&(u4.Queue_1>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u1.Memory_4>=1)))||(((u9.Queue_3>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u4.Queue_1>=1))&&(u3.Memory_3>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u8.Queue_2>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u6.Queue_4>=1)))||(((u3.Memory_3>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u5.Memory_5>=1))&&(u8.Queue_2>=1)))||(((u4.Queue_1>=1)&&(u5.Memory_5>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1)))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.087124,19516,1,0,4426,238,945,2853,178,517,19814
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 USE_NUPN
Checking formula 4 : !((F(X(G(X("(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))"))))))
Formula 4 simplified : !FXGX"(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))"
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.091976,19744,1,0,4610,248,945,3066,178,544,20799
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(F(("(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))")U("((((((((((((((((((((((u1.Ext_Bus>=1)&&(u2.Memory_2>=1))&&(u4.Queue_1>=1))||(((u1.Ext_Bus>=1)&&(u9.Queue_3>=1))&&(u2.Memory_2>=1)))||(((u1.Ext_Bus>=1)&&(u6.Queue_4>=1))&&(u2.Memory_2>=1)))||(((u7.Queue_5>=1)&&(u2.Memory_2>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u0.Memory_1>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u9.Queue_3>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u6.Queue_4>=1)))||(((u0.Memory_1>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u1.Memory_4>=1))&&(u4.Queue_1>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u1.Memory_4>=1)))||(((u9.Queue_3>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u4.Queue_1>=1))&&(u3.Memory_3>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u8.Queue_2>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u6.Queue_4>=1)))||(((u3.Memory_3>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u5.Memory_5>=1))&&(u8.Queue_2>=1)))||(((u4.Queue_1>=1)&&(u5.Memory_5>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1)))"))))))
Formula 5 simplified : !XXF("(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))" U "((((((((((((((((((((((u1.Ext_Bus>=1)&&(u2.Memory_2>=1))&&(u4.Queue_1>=1))||(((u1.Ext_Bus>=1)&&(u9.Queue_3>=1))&&(u2.Memory_2>=1)))||(((u1.Ext_Bus>=1)&&(u6.Queue_4>=1))&&(u2.Memory_2>=1)))||(((u7.Queue_5>=1)&&(u2.Memory_2>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u0.Memory_1>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u9.Queue_3>=1)))||(((u1.Ext_Bus>=1)&&(u0.Memory_1>=1))&&(u6.Queue_4>=1)))||(((u0.Memory_1>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u1.Memory_4>=1))&&(u4.Queue_1>=1)))||(((u1.Ext_Bus>=1)&&(u8.Queue_2>=1))&&(u1.Memory_4>=1)))||(((u9.Queue_3>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u4.Queue_1>=1))&&(u3.Memory_3>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u8.Queue_2>=1)))||(((u1.Ext_Bus>=1)&&(u3.Memory_3>=1))&&(u6.Queue_4>=1)))||(((u3.Memory_3>=1)&&(u7.Queue_5>=1))&&(u1.Ext_Bus>=1)))||(((u1.Ext_Bus>=1)&&(u5.Memory_5>=1))&&(u8.Queue_2>=1)))||(((u4.Queue_1>=1)&&(u5.Memory_5>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1)))||(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1)))")
4 unique states visited
4 strongly connected components in search stack
4 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.11003,20264,1,0,5548,248,945,4028,178,550,25347
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 USE_NUPN
Checking formula 6 : !(("((((((u7.OwnMemAcc_5>=1)&&(u5.Memory_5>=1))||((u6.OwnMemAcc_4>=1)&&(u1.Memory_4>=1)))||((u4.OwnMemAcc_1>=1)&&(u0.Memory_1>=1)))||((u9.OwnMemAcc_3>=1)&&(u3.Memory_3>=1)))||((u8.OwnMemAcc_2>=1)&&(u2.Memory_2>=1)))"))
Formula 6 simplified : !"((((((u7.OwnMemAcc_5>=1)&&(u5.Memory_5>=1))||((u6.OwnMemAcc_4>=1)&&(u1.Memory_4>=1)))||((u4.OwnMemAcc_1>=1)&&(u0.Memory_1>=1)))||((u9.OwnMemAcc_3>=1)&&(u3.Memory_3>=1)))||((u8.OwnMemAcc_2>=1)&&(u2.Memory_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.111208,20528,1,0,5548,248,947,4028,178,550,25355
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 USE_NUPN
Checking formula 7 : !((F(F(G(("(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))")U("(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))"))))))
Formula 7 simplified : !FG"(((((u8.Active_2>=1)||(u4.Active_1>=1))||(u6.Active_4>=1))||(u9.Active_3>=1))||(u7.Active_5>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.132837,20788,1,0,7027,248,957,5280,178,550,31305
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1))")))
Formula 8 simplified : !G"(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=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.134798,20788,1,0,7027,248,975,5280,178,550,31319
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 USE_NUPN
Checking formula 9 : !(((G(F(G("(u2.Ext_Mem_Acc_4_2>=1)"))))U(X("(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1))"))))
Formula 9 simplified : !(GFG"(u2.Ext_Mem_Acc_4_2>=1)" U X"(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.143476,21464,1,0,7592,248,1020,5759,179,550,33989
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 USE_NUPN
Checking formula 10 : !(((X(X("(u2.Ext_Mem_Acc_1_2>=1)")))U("(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=1))")))
Formula 10 simplified : !(XX"(u2.Ext_Mem_Acc_1_2>=1)" U "(((u5.Memory_5>=1)&&(u6.Queue_4>=1))&&(u1.Ext_Bus>=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.150225,21716,1,0,8112,248,1042,6217,179,550,36020
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 USE_NUPN
Checking formula 11 : !((F("(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=1))")))
Formula 11 simplified : !F"(((u5.Memory_5>=1)&&(u9.Queue_3>=1))&&(u1.Ext_Bus>=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.154465,21716,1,0,8188,248,1066,6313,179,550,36436
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 USE_NUPN
Checking formula 12 : !(("(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=1))"))
Formula 12 simplified : !"(((u7.Queue_5>=1)&&(u1.Memory_4>=1))&&(u1.Ext_Bus>=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.155375,21980,1,0,8188,248,1066,6313,179,550,36436
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 USE_NUPN
Checking formula 13 : !((F(G((X("(u1.Ext_Mem_Acc_3_4>=1)"))U(F("((u6.OwnMemAcc_4>=1)&&(u1.Memory_4>=1))"))))))
Formula 13 simplified : !FG(X"(u1.Ext_Mem_Acc_3_4>=1)" U F"((u6.OwnMemAcc_4>=1)&&(u1.Memory_4>=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.16021,21980,1,0,8453,248,1085,6549,179,550,37645
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 USE_NUPN
Checking formula 14 : !(("(u3.Ext_Mem_Acc_5_3>=1)"))
Formula 14 simplified : !"(u3.Ext_Mem_Acc_5_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.160865,21980,1,0,8453,248,1089,6549,180,550,37652
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 USE_NUPN
Checking formula 15 : !((X(X(G(X(G("(u9.Ext_Mem_Acc_3_2>=1)")))))))
Formula 15 simplified : !XXGXG"(u9.Ext_Mem_Acc_3_2>=1)"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.166774,21980,1,0,8579,248,1102,6726,181,550,38356
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 USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
ITS tools runner thread asked to quit. Dying gracefully.
// Phase 1: matrix 55 rows 41 cols
invariant :u2:Ext_Mem_Acc_1_2 + u2:Ext_Mem_Acc_4_2 + u2:Ext_Mem_Acc_5_2 + u2:Memory_2 + u9:Ext_Mem_Acc_3_2 = 1
invariant :u0:Ext_Mem_Acc_2_1 + u0:Ext_Mem_Acc_3_1 + u0:Ext_Mem_Acc_4_1 + u1:Ext_Bus + -1'u1:Memory_4 + -1'u2:Memory_2 + -1'u3:Memory_3 + -1'u5:Memory_5 + u7:Ext_Mem_Acc_5_1 = -3
invariant :u0:Ext_Mem_Acc_4_1 + u2:Ext_Mem_Acc_4_2 + u5:Ext_Mem_Acc_4_5 + u6:Ext_Mem_Acc_4_3 + u6:Active_4 + u6:Queue_4 + u6:OwnMemAcc_4 = 1
invariant :u1:Ext_Mem_Acc_1_4 + u1:Ext_Mem_Acc_3_4 + u1:Ext_Mem_Acc_2_4 + u1:Ext_Mem_Acc_5_4 + u1:Memory_4 = 1
invariant :u0:Memory_1 + -1'u1:Ext_Bus + u1:Memory_4 + u2:Memory_2 + u3:Memory_3 + u5:Memory_5 = 4
invariant :u4:Ext_Mem_Acc_1_5 + u5:Ext_Mem_Acc_3_5 + u5:Ext_Mem_Acc_2_5 + u5:Ext_Mem_Acc_4_5 + u5:Memory_5 = 1
invariant :-1'u0:Ext_Mem_Acc_3_1 + -1'u0:Ext_Mem_Acc_4_1 + u1:Ext_Mem_Acc_2_4 + -1'u1:Ext_Bus + u1:Memory_4 + u2:Memory_2 + u3:Ext_Mem_Acc_2_3 + u3:Memory_3 + u5:Ext_Mem_Acc_2_5 + u5:Memory_5 + -1'u7:Ext_Mem_Acc_5_1 + u8:Active_2 + u8:Queue_2 + u8:OwnMemAcc_2 = 4
invariant :-1'u1:Ext_Mem_Acc_3_4 + -1'u1:Ext_Mem_Acc_2_4 + -1'u1:Ext_Mem_Acc_5_4 + -1'u1:Memory_4 + -1'u2:Ext_Mem_Acc_4_2 + -1'u2:Ext_Mem_Acc_5_2 + -1'u2:Memory_2 + -1'u3:Ext_Mem_Acc_2_3 + -1'u3:Ext_Mem_Acc_5_3 + -1'u3:Memory_3 + u4:Active_1 + u4:Queue_1 + u4:OwnMemAcc_1 + -1'u5:Ext_Mem_Acc_3_5 + -1'u5:Ext_Mem_Acc_2_5 + -1'u5:Ext_Mem_Acc_4_5 + -1'u5:Memory_5 + -1'u6:Ext_Mem_Acc_4_3 + -1'u9:Ext_Mem_Acc_3_2 = -3
invariant :u0:Ext_Mem_Acc_3_1 + u1:Ext_Mem_Acc_3_4 + u5:Ext_Mem_Acc_3_5 + u9:Ext_Mem_Acc_3_2 + u9:Active_3 + u9:Queue_3 + u9:OwnMemAcc_3 = 1
invariant :u1:Ext_Mem_Acc_5_4 + u2:Ext_Mem_Acc_5_2 + u3:Ext_Mem_Acc_5_3 + u7:Ext_Mem_Acc_5_1 + u7:Active_5 + u7:Queue_5 + u7:OwnMemAcc_5 = 1
invariant :u3:Ext_Mem_Acc_1_3 + u3:Ext_Mem_Acc_2_3 + u3:Ext_Mem_Acc_5_3 + u3:Memory_3 + u6:Ext_Mem_Acc_4_3 = 1
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 1527862472749

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -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 2:14:30 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/, -louvain, -smt]
Jun 01, 2018 2:14:30 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 2:14:30 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 61 ms
Jun 01, 2018 2:14:30 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 places.
Jun 01, 2018 2:14:30 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 transitions.
Jun 01, 2018 2:14:30 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Jun 01, 2018 2:14:30 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2018 2:14:30 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 39 ms
Jun 01, 2018 2:14:30 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
Begin: Fri Jun 1 14:14:31 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Fri Jun 1 14:14:31 2018
network size: 41 nodes, 190 links, 110 weight
quality increased from -0.0363866 to 0.401116
end computation: Fri Jun 1 14:14:31 2018
level 1:
start computation: Fri Jun 1 14:14:31 2018
network size: 10 nodes, 68 links, 110 weight
quality increased from 0.401116 to 0.401116
end computation: Fri Jun 1 14:14:31 2018
End: Fri Jun 1 14:14:31 2018
Total duration: 0 sec
0.401116
Jun 01, 2018 2:14:31 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2018 2:14:31 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 16 ms
Jun 01, 2018 2:14:31 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 01, 2018 2:14:31 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 52 redundant transitions.
Jun 01, 2018 2:14:31 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 01, 2018 2:14:31 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Jun 01, 2018 2:14:31 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 55 transitions.
Jun 01, 2018 2:14:31 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 17 ms
Skipping mayMatrices nes/nds SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.computeAndDeclareInvariants(KInductionSolver.java:293)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:71)
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 2:14:31 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 237ms 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="itstoolsl"
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 itstoolsl"
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 r213-smll-152732264600568"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;