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 396K
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 193K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is IBM703-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264200316
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527941479574

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/graph7882570124148948069.txt, -o, /tmp/graph7882570124148948069.bin, -w, /tmp/graph7882570124148948069.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/graph7882570124148948069.bin, -l, -1, -v, -w, /tmp/graph7882570124148948069.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 : !((("(i5.u70.merge_s00000320_input_s00000290>=1)")U((F("(i5.u16.task_s00000704_inputCriterion_s00000257_used>=1)"))U(G("(i0.u94.task_s00000753_inputCriterion_s00000257_used>=1)")))))
Formula 0 simplified : !("(i5.u70.merge_s00000320_input_s00000290>=1)" U (F"(i5.u16.task_s00000704_inputCriterion_s00000257_used>=1)" U G"(i0.u94.task_s00000753_inputCriterion_s00000257_used>=1)"))
built 35 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions merge_s00000320_activate_s00000286, merge_s00000451_activate_s00000284, merge_s00000451_activate_s00000286, merge_s00000319_activate_s00000284, merge_s00000453_activate_s00000286, merge_s00000446_activate_s00000284, merge_s00000454_activate_s00000286, merge_s00000319_activate_s00000448, merge_s00000455_activate_s00000286, merge_s00000446_activate_s00000286, merge_s00000319_activate_s00000289, merge_s00000455_activate_s00000289, merge_s00000446_activate_s00000289, i0.u1.merge_s00000341_activate_s00000286, i4.u13.merge_s00000319_activate_s00000286, i5.u70.merge_s00000320_activate_s00000284, i5.u39.merge_s00000449_activate_s00000286, i7.u27.merge_s00000461_activate_s00000289, i10.u5.merge_s00000455_activate_s00000284, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/265/19/284
Computing Next relation with stutter on 9 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 284 rows 262 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
29 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.347484,28156,1,0,22442,167,2787,29953,106,318,67072
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G("(i1.u73.decision_s00000768_activated>=1)")))
Formula 1 simplified : !G"(i1.u73.decision_s00000768_activated>=1)"
Computing Next relation with stutter on 9 deadlock states
invariant :i0:u1:merge_s00000341_activated + i0:u1:merge_s00000341_input_s00000285 + i0:u1:decision_s00000784_input_s00000263 + i0:u56:task_s00000752_output_s00000264 + i0:u56:decision_s00000801_activated + i0:u50:merge_s00000454_activated + i0:u50:decision_s00000764_input_s00000263 + i0:u94:task_s00000753_input_s00000263 + i0:u94:task_s00000753_output_s00000264 + i0:u94:task_s00000753_inputCriterion_s00000257_used + i0:u46:task_s00000705_output_s00000264 + i0:u46:task_s00000718_output_s00000264 + i0:u46:task_s00000718_inputCriterion_s00000257_used + i0:u67:merge_s00000341_input_s00000263 + i0:u67:decision_s00000789_activated + i0:u84:task_s00000705_input_s00000263 + i0:u84:task_s00000705_inputCriterion_s00000257_used + i0:u40:task_s00000710_output_s00000264 + i0:u40:task_s00000752_inputCriterion_s00000257_used + i0:u76:task_s00000710_input_s00000263 + i0:u76:task_s00000710_inputCriterion_s00000257_used + i1:u0:alpha + i1:u0:process_s00000030__s00000703_input_s00000263 + i1:u99:task_s00000708_output_s00000264 + i1:u99:task_s00000708_inputCriterion_s00000257_used + i1:u3:merge_s00000445_activated + i1:u3:decision_s00000775_input_s00000263 + i1:u88:task_s00000715_input_s00000263 + i1:u88:task_s00000715_output_s00000264 + i1:u88:task_s00000715_inputCriterion_s00000257_used + i1:u10:task_s00000711_input_s00000263 + i1:u10:task_s00000711_inputCriterion_s00000257_used + i1:u79:task_s00000711_output_s00000264 + i1:u79:task_s00000712_output_s00000264 + i1:u79:task_s00000712_inputCriterion_s00000257_used + i1:u73:decision_s00000768_activated + i1:u73:stopNode_s00000597_input_default + i1:u83:task_s00000714_input_s00000263 + i1:u83:task_s00000714_output_s00000264 + i1:u83:task_s00000714_inputCriterion_s00000257_used + i2:u22:task_s00000762_input_s00000263 + i2:u22:task_s00000762_output_s00000264 + i2:u22:task_s00000762_inputCriterion_s00000257_used + i2:u25:merge_s00000288_activated + i2:u25:task_s00000745_input_s00000263 + i2:u87:task_s00000724_input_s00000263 + i2:u87:task_s00000724_output_s00000264 + i2:u87:task_s00000724_inputCriterion_s00000257_used + i2:u102:task_s00000727_output_s00000264 + i2:u102:decision_s00000804_activated + i2:u102:task_s00000727_inputCriterion_s00000257_used + i3:u7:merge_s00000456_activated + i3:u7:merge_s00000319_input_s00000290 + i3:u9:merge_s00000458_activated + i3:u9:merge_s00000456_input_s00000290 + i3:u9:merge_s00000458_input_s00000285 + i3:u44:task_s00000731_output_s00000264 + i3:u44:task_s00000731_inputCriterion_s00000257_used + i3:u52:task_s00000737_output_s00000264 + i3:u52:task_s00000737_inputCriterion_s00000257_used + i3:u78:task_s00000730_input_s00000263 + i3:u78:task_s00000730_output_s00000264 + i3:u78:task_s00000730_inputCriterion_s00000257_used + i3:u11:merge_s00000456_input_s00000263 + i3:u11:decision_s00000788_activated + i3:u55:task_s00000759_output_s00000264 + i3:u55:task_s00000759_inputCriterion_s00000257_used + i3:u75:callToProcess_s00000808_output_s00000264 + i3:u75:callToProcess_s00000808_inputCriterion_s00000257_used + i3:u18:task_s00000760_input_s00000263 + i3:u18:task_s00000760_output_s00000264 + i3:u18:task_s00000760_inputCriterion_s00000257_used + i3:u57:decision_s00000802_activated + i3:u57:decision_s00000802_input_s00000263 + i3:u2:merge_s00000462_activated + i3:u2:merge_s00000458_input_s00000263 + i3:u38:merge_s00000462_input_s00000285 + i3:u38:decision_s00000803_activated + i3:u90:task_s00000761_input_s00000263 + i3:u90:task_s00000761_output_s00000264 + i3:u90:task_s00000761_inputCriterion_s00000257_used + i4:u13:merge_s00000319_activated + i4:u13:merge_s00000319_input_s00000263 + i4:u59:merge_s00000453_input_s00000263 + i4:u59:decision_s00000773_activated + i4:u101:task_s00000745_output_s00000264 + i4:u101:task_s00000745_inputCriterion_s00000257_used + i4:u33:merge_s00000453_activated + i4:u33:task_s00000757_input_s00000263 + i4:u35:merge_s00000453_input_s00000290 + i4:u35:decision_s00000780_activated + i4:u35:decision_s00000780_input_s00000263 + i4:u109:task_s00000757_output_s00000264 + i4:u109:task_s00000757_inputCriterion_s00000257_used + i4:u111:task_s00000758_output_s00000264 + i4:u111:task_s00000758_inputCriterion_s00000257_used + i4:u112:callToProcess_s00000348_output_s00000264 + i4:u112:callToProcess_s00000348_inputCriterion_s00000257_used + i5:u21:task_s00000716_input_s00000263 + i5:u21:task_s00000716_inputCriterion_s00000257_used + i5:u98:task_s00000716_output_s00000264 + i5:u98:task_s00000717_inputCriterion_s00000257_used + i5:u16:task_s00000704_input_s00000263 + i5:u16:task_s00000704_output_s00000264 + i5:u16:task_s00000704_inputCriterion_s00000257_used + i5:u70:merge_s00000320_activated + i5:u70:merge_s00000320_input_s00000290 + i5:u70:fork_s00000463_activated_s00000274 + i5:u34:merge_s00000320_input_s00000263 + i5:u34:decision_s00000775_activated + i5:u39:merge_s00000449_activated + i5:u39:merge_s00000449_input_s00000285 + i6:u14:task_s00000722_input_s00000263 + i6:u14:task_s00000722_output_s00000264 + i6:u14:task_s00000722_inputCriterion_s00000257_used + i6:u26:merge_s00000451_activated + i6:u26:task_s00000727_input_s00000263 + i6:u36:merge_s00000451_input_s00000285 + i6:u36:fork_s00000466_activated_s00000272 + i6:u17:task_s00000723_input_s00000263 + i6:u17:task_s00000723_output_s00000264 + i6:u17:task_s00000723_inputCriterion_s00000257_used + i6:u41:task_s00000720_output_s00000264 + i6:u41:decision_s00000778_activated + i6:u77:task_s00000720_input_s00000263 + i6:u77:task_s00000720_inputCriterion_s00000257_used + i7:u27:merge_s00000461_activated + i7:u27:callToProcess_s00000596_output_s00000264 + i7:u51:task_s00000755_input_s00000263 + i7:u51:task_s00000755_output_s00000264 + i7:u51:task_s00000755_inputCriterion_s00000257_used + i7:u63:merge_s00000461_input_s00000263 + i7:u63:task_s00000756_output_s00000264 + i7:u63:decision_s00000774_activated + i7:u74:callToProcess_s00000807_input_s00000263 + i7:u74:callToProcess_s00000807_output_s00000264 + i7:u74:callToProcess_s00000807_inputCriterion_s00000257_used + i7:u48:task_s00000726_output_s00000264 + i7:u48:callToProcess_s00000596_inputCriterion_s00000257_used + i7:u60:decision_s00000764_activated + i7:u60:decision_s00000787_input_s00000263 + i7:u97:task_s00000726_input_s00000263 + i7:u97:task_s00000726_inputCriterion_s00000257_used + i7:u32:task_s00000729_input_s00000263 + i7:u32:decision_s00000787_activated + i7:u108:task_s00000729_output_s00000264 + i7:u108:task_s00000729_inputCriterion_s00000257_used + i9:u30:merge_s00000452_activated + i9:u30:merge_s00000452_input_s00000285 + i9:u61:task_s00000728_output_s00000264 + i9:u61:decision_s00000792_activated + i9:u95:task_s00000744_input_s00000263 + i9:u95:task_s00000744_output_s00000264 + i9:u95:task_s00000744_inputCriterion_s00000257_used + i9:u29:task_s00000728_input_s00000263 + i9:u29:task_s00000728_inputCriterion_s00000257_used + i9:u62:merge_s00000446_input_s00000285 + i9:u62:decision_s00000783_activated + i9:u62:decision_s00000783_input_s00000263 + i10:u5:merge_s00000455_activated + i10:u5:task_s00000739_output_s00000264 + i10:u66:fork_s00000464_input_s00000263 + i10:u66:fork_s00000465_input_s00000263 + i10:u66:decision_s00000796_activated + i10:u68:merge_s00000455_input_s00000263 + i10:u68:fork_s00000464_activated_s00000272 + i10:u69:merge_s00000455_input_s00000290 + i10:u69:fork_s00000465_activated_s00000272 + i10:u4:merge_s00000283_activated + i10:u4:decision_s00000796_input_s00000263 + i10:u64:merge_s00000283_input_s00000263 + i10:u64:decision_s00000793_activated + i10:u107:task_s00000738_input_s00000263 + i10:u107:task_s00000738_output_s00000264 + i10:u107:task_s00000738_inputCriterion_s00000257_used + i10:u72:decision_s00000784_activated + i10:u72:decision_s00000793_input_s00000263 + i10:u110:task_s00000739_input_s00000263 + i10:u110:task_s00000739_inputCriterion_s00000257_used + i11:u8:merge_s00000457_activated + i11:u8:merge_s00000446_input_s00000447 + i11:u28:merge_s00000457_input_s00000285 + i11:u28:decision_s00000799_activated + i11:u82:task_s00000741_input_s00000263 + i11:u82:task_s00000741_output_s00000264 + i11:u82:task_s00000741_inputCriterion_s00000257_used + i11:u104:task_s00000746_input_s00000263 + i11:u104:task_s00000746_output_s00000264 + i11:u104:task_s00000746_inputCriterion_s00000257_used + i11:u6:merge_s00000446_activated + i11:u6:decision_s00000773_input_s00000263 + i11:u37:merge_s00000446_input_s00000263 + i11:u37:decision_s00000772_activated + i11:u65:merge_s00000446_input_s00000290 + i11:u65:decision_s00000777_activated + i11:u93:task_s00000707_input_s00000263 + i11:u93:task_s00000707_output_s00000264 + i11:u93:task_s00000707_inputCriterion_s00000257_used + i11:u105:task_s00000719_input_s00000263 + i11:u105:task_s00000719_output_s00000264 + i11:u105:task_s00000719_inputCriterion_s00000257_used + i12:u19:merge_s00000806_activated + i12:u19:task_s00000706_input_s00000263 + i12:u23:task_s00000763_input_s00000263 + i12:u23:task_s00000763_output_s00000264 + i12:u23:task_s00000763_inputCriterion_s00000257_used + i12:u89:task_s00000706_output_s00000264 + i12:u89:task_s00000706_inputCriterion_s00000257_used + i12:u58:task_s00000717_output_s00000264 + i12:u58:decision_s00000805_activated + i12:u103:task_s00000709_input_s00000263 + i12:u103:task_s00000709_output_s00000264 + i12:u103:task_s00000709_inputCriterion_s00000257_used + i14:u12:task_s00000721_input_s00000263 + i14:u12:decision_s00000776_activated + i14:u43:task_s00000740_input_s00000263 + i14:u43:task_s00000740_output_s00000264 + i14:u43:task_s00000740_inputCriterion_s00000257_used + i14:u20:task_s00000725_input_s00000263 + i14:u20:task_s00000725_inputCriterion_s00000257_used + i14:u86:task_s00000742_output_s00000264 + i14:u86:task_s00000725_output_s00000264 + i14:u86:task_s00000742_inputCriterion_s00000257_used + i14:u91:task_s00000743_output_s00000264 + i14:u91:task_s00000743_inputCriterion_s00000257_used + i14:u42:task_s00000721_output_s00000264 + i14:u42:task_s00000721_inputCriterion_s00000257_used + i14:u106:merge_s00000450_activated + i14:u106:task_s00000756_input_s00000263 + i14:u106:task_s00000756_inputCriterion_s00000257_used = 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.47337,33956,1,0,37239,167,2870,47450,107,391,93908
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("(i8.u31.task_s00000747_inputCriterion_s00000257_used>=1)")U("(i10.u64.decision_s00000793_activated>=1)")))
Formula 2 simplified : !("(i8.u31.task_s00000747_inputCriterion_s00000257_used>=1)" U "(i10.u64.decision_s00000793_activated>=1)")
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.474286,34208,1,0,37239,167,2885,47450,107,391,93942
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(F(X("(i14.u43.task_s00000740_inputCriterion_s00000257_used>=1)"))))U(F("(i7.u74.callToProcess_s00000807_inputCriterion_s00000257_used>=1)"))))
Formula 3 simplified : !(XFX"(i14.u43.task_s00000740_inputCriterion_s00000257_used>=1)" U F"(i7.u74.callToProcess_s00000807_inputCriterion_s00000257_used>=1)")
Computing Next relation with stutter on 9 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 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.578678,37632,1,0,46330,167,2919,55433,107,391,109172
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(X(("(i9.u62.merge_s00000446_input_s00000285>=1)")U("(i3.u9.merge_s00000456_input_s00000290>=1)"))))))
Formula 4 simplified : !FXX("(i9.u62.merge_s00000446_input_s00000285>=1)" U "(i3.u9.merge_s00000456_input_s00000290>=1)")
Computing Next relation with stutter on 9 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.620288,39212,1,0,49837,167,2962,59484,108,392,121644
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(F(X(G(F("(i8.u85.task_s00000751_inputCriterion_s00000257_used>=1)")))))))
Formula 5 simplified : !FXGF"(i8.u85.task_s00000751_inputCriterion_s00000257_used>=1)"
Computing Next relation with stutter on 9 deadlock states
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 items max in DFS search stack
34 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.971669,52124,1,0,78386,189,2988,124583,108,621,166291
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(i11.u82.task_s00000741_output_s00000264>=1)"))
Formula 6 simplified : !"(i11.u82.task_s00000741_output_s00000264>=1)"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.972187,52124,1,0,78386,189,2993,124583,108,621,166299
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(i3.u90.task_s00000761_output_s00000264>=1)"))
Formula 7 simplified : !"(i3.u90.task_s00000761_output_s00000264>=1)"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.972696,52388,1,0,78386,189,2998,124583,108,621,166322
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(i3.u78.task_s00000730_input_s00000263>=1)"))
Formula 8 simplified : !"(i3.u78.task_s00000730_input_s00000263>=1)"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.97299,52388,1,0,78386,189,3003,124583,108,621,166338
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F((G("(i10.u4.decision_s00000796_input_s00000263>=1)"))U("(i3.u78.task_s00000730_output_s00000264>=1)")))))
Formula 9 simplified : !GF(G"(i10.u4.decision_s00000796_input_s00000263>=1)" U "(i3.u78.task_s00000730_output_s00000264>=1)")
Computing Next relation with stutter on 9 deadlock states
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 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,1.01586,54232,1,0,83343,189,3019,128954,108,621,176073
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((("(i3.u18.task_s00000760_inputCriterion_s00000257_used>=1)")U("(i2.u102.decision_s00000804_activated>=1)"))U("(i3.u9.merge_s00000458_input_s00000285>=1)"))))
Formula 10 simplified : !X(("(i3.u18.task_s00000760_inputCriterion_s00000257_used>=1)" U "(i2.u102.decision_s00000804_activated>=1)") U "(i3.u9.merge_s00000458_input_s00000285>=1)")
Computing Next relation with stutter on 9 deadlock states
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,1.02272,54596,1,0,83598,189,3067,129249,108,621,176849
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("(i14.u86.task_s00000742_output_s00000264>=1)"))
Formula 11 simplified : !"(i14.u86.task_s00000742_output_s00000264>=1)"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.02303,54596,1,0,83598,189,3072,129249,108,621,176855
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(i7.u27.callToProcess_s00000596_output_s00000264>=1)"))
Formula 12 simplified : !"(i7.u27.callToProcess_s00000596_output_s00000264>=1)"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.02332,54596,1,0,83598,189,3077,129249,108,621,176872
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(("(i1.u79.task_s00000712_inputCriterion_s00000257_used>=1)")U("(i12.u19.merge_s00000806_activated>=1)"))))
Formula 13 simplified : !G("(i1.u79.task_s00000712_inputCriterion_s00000257_used>=1)" U "(i12.u19.merge_s00000806_activated>=1)")
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.0249,54856,1,0,83598,189,3106,129249,108,621,176945
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(G(G(G(F("(i10.u66.decision_s00000796_activated>=1)")))))))
Formula 14 simplified : !XGF"(i10.u66.decision_s00000796_activated>=1)"
Computing Next relation with stutter on 9 deadlock states
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 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,1.04127,55068,1,0,85032,189,3129,130858,108,621,180267
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((((F("(i3.u9.merge_s00000458_activated>=1)"))U("(i4.u35.decision_s00000780_activated>=1)"))U((G("(i9.u29.task_s00000728_input_s00000263>=1)"))U(G("(i8.u54.task_s00000748_output_s00000264>=1)")))))
Formula 15 simplified : !((F"(i3.u9.merge_s00000458_activated>=1)" U "(i4.u35.decision_s00000780_activated>=1)") U (G"(i9.u29.task_s00000728_input_s00000263>=1)" U G"(i8.u54.task_s00000748_output_s00000264>=1)"))
Computing Next relation with stutter on 9 deadlock states
108 unique states visited
108 strongly connected components in search stack
108 transitions explored
108 items max in DFS search stack
14 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,1.18408,60544,1,0,96016,189,3158,145295,108,621,200086
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-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 1527941486138

--------------------
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 02, 2018 12:11:22 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 02, 2018 12:11:22 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 12:11:22 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 90 ms
Jun 02, 2018 12:11:22 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 262 places.
Jun 02, 2018 12:11:22 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 284 transitions.
Jun 02, 2018 12:11:22 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 22 ms
Jun 02, 2018 12:11:22 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 12:11:22 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 106 ms
Jun 02, 2018 12:11:22 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
Begin: Sat Jun 2 12:11:23 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 12:11:23 2018
network size: 262 nodes, 576 links, 568 weight
quality increased from -0.00409145 to 0.515377
end computation: Sat Jun 2 12:11:23 2018
level 1:
start computation: Sat Jun 2 12:11:23 2018
network size: 113 nodes, 391 links, 568 weight
quality increased from 0.515377 to 0.760537
end computation: Sat Jun 2 12:11:23 2018
level 2:
start computation: Sat Jun 2 12:11:23 2018
network size: 45 nodes, 163 links, 568 weight
quality increased from 0.760537 to 0.843099
end computation: Sat Jun 2 12:11:23 2018
level 3:
start computation: Sat Jun 2 12:11:23 2018
network size: 16 nodes, 60 links, 568 weight
quality increased from 0.843099 to 0.850488
end computation: Sat Jun 2 12:11:23 2018
level 4:
start computation: Sat Jun 2 12:11:23 2018
network size: 15 nodes, 55 links, 568 weight
quality increased from 0.850488 to 0.850488
end computation: Sat Jun 2 12:11:23 2018
End: Sat Jun 2 12:11:23 2018
Total duration: 0 sec
0.850488
Jun 02, 2018 12:11:23 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 12:11:23 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 45 ms
Jun 02, 2018 12:11:23 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 12:11:23 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 29 redundant transitions.
Jun 02, 2018 12:11:23 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
Jun 02, 2018 12:11:23 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 12:11:23 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 284 transitions.
Jun 02, 2018 12:11:23 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 1 place invariants in 84 ms
Jun 02, 2018 12:11:24 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 262 variables to be positive in 682 ms
Jun 02, 2018 12:11:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 284 transitions.
Jun 02, 2018 12:11:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/284 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:11:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:11:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 284 transitions.
Jun 02, 2018 12:11:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 12:11:24 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 02, 2018 12:11:24 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error
Jun 02, 2018 12:11:24 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (not (>= (select s0 135) 1))) with error
Jun 02, 2018 12:11:24 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (>= (select s1 135) 1)) with error
Jun 02, 2018 12:11:24 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 146) 1) (= (store (store s0 135 (+ (select s0 135) 1)) 146 (- (select s0 146) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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 02, 2018 12:11:25 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1486ms 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="IBM703-PT-none"
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/IBM703-PT-none.tgz
mv IBM703-PT-none 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 IBM703-PT-none, 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-152732264200316"
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 ;