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

About the Execution of ITS-Tools for IBM703-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15749.350 13769.00 28988.00 478.60 FFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......................
/home/mcc/execution
total 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 itstools
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 r212-smll-152732263100316
=====================================================================


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

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/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.201805151631/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 : !((("(merge_s00000320_input_s00000290>=1)")U((F("(task_s00000704_inputCriterion_s00000257_used>=1)"))U(G("(task_s00000753_inputCriterion_s00000257_used>=1)")))))
Formula 0 simplified : !("(merge_s00000320_input_s00000290>=1)" U (F"(task_s00000704_inputCriterion_s00000257_used>=1)" U G"(task_s00000753_inputCriterion_s00000257_used>=1)"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 284 rows 262 cols
invariant :alpha + merge_s00000320_activated + merge_s00000341_activated + merge_s00000450_activated + merge_s00000451_activated + merge_s00000461_activated + merge_s00000452_activated + merge_s00000462_activated + merge_s00000453_activated + merge_s00000454_activated + merge_s00000445_activated + merge_s00000319_activated + merge_s00000283_activated + merge_s00000806_activated + merge_s00000455_activated + merge_s00000446_activated + merge_s00000456_activated + merge_s00000457_activated + merge_s00000458_activated + merge_s00000449_activated + merge_s00000288_activated + task_s00000710_input_s00000263 + task_s00000720_input_s00000263 + task_s00000711_input_s00000263 + task_s00000730_input_s00000263 + task_s00000721_input_s00000263 + task_s00000740_input_s00000263 + task_s00000722_input_s00000263 + task_s00000704_input_s00000263 + task_s00000741_input_s00000263 + task_s00000723_input_s00000263 + task_s00000714_input_s00000263 + task_s00000705_input_s00000263 + task_s00000760_input_s00000263 + task_s00000724_input_s00000263 + task_s00000715_input_s00000263 + task_s00000706_input_s00000263 + fork_s00000464_input_s00000263 + task_s00000761_input_s00000263 + task_s00000725_input_s00000263 + task_s00000716_input_s00000263 + task_s00000707_input_s00000263 + fork_s00000465_input_s00000263 + task_s00000762_input_s00000263 + task_s00000753_input_s00000263 + task_s00000744_input_s00000263 + task_s00000726_input_s00000263 + task_s00000763_input_s00000263 + task_s00000745_input_s00000263 + task_s00000727_input_s00000263 + task_s00000709_input_s00000263 + task_s00000755_input_s00000263 + task_s00000746_input_s00000263 + task_s00000728_input_s00000263 + task_s00000719_input_s00000263 + task_s00000756_input_s00000263 + task_s00000738_input_s00000263 + task_s00000729_input_s00000263 + task_s00000757_input_s00000263 + task_s00000739_input_s00000263 + merge_s00000320_input_s00000290 + merge_s00000320_input_s00000263 + merge_s00000341_input_s00000263 + merge_s00000461_input_s00000263 + merge_s00000453_input_s00000290 + merge_s00000453_input_s00000263 + merge_s00000341_input_s00000285 + merge_s00000319_input_s00000290 + merge_s00000319_input_s00000263 + merge_s00000283_input_s00000263 + merge_s00000455_input_s00000290 + merge_s00000455_input_s00000263 + merge_s00000451_input_s00000285 + merge_s00000446_input_s00000290 + merge_s00000446_input_s00000263 + merge_s00000456_input_s00000290 + merge_s00000456_input_s00000263 + merge_s00000452_input_s00000285 + merge_s00000462_input_s00000285 + merge_s00000458_input_s00000263 + merge_s00000446_input_s00000447 + merge_s00000446_input_s00000285 + merge_s00000457_input_s00000285 + merge_s00000458_input_s00000285 + merge_s00000449_input_s00000285 + task_s00000710_output_s00000264 + task_s00000720_output_s00000264 + task_s00000711_output_s00000264 + task_s00000730_output_s00000264 + task_s00000721_output_s00000264 + task_s00000712_output_s00000264 + task_s00000740_output_s00000264 + task_s00000731_output_s00000264 + task_s00000722_output_s00000264 + task_s00000704_output_s00000264 + task_s00000741_output_s00000264 + task_s00000723_output_s00000264 + task_s00000714_output_s00000264 + task_s00000705_output_s00000264 + task_s00000760_output_s00000264 + task_s00000742_output_s00000264 + task_s00000724_output_s00000264 + task_s00000715_output_s00000264 + task_s00000706_output_s00000264 + task_s00000761_output_s00000264 + task_s00000752_output_s00000264 + task_s00000743_output_s00000264 + task_s00000725_output_s00000264 + task_s00000716_output_s00000264 + task_s00000707_output_s00000264 + task_s00000762_output_s00000264 + task_s00000753_output_s00000264 + task_s00000744_output_s00000264 + task_s00000726_output_s00000264 + task_s00000717_output_s00000264 + task_s00000708_output_s00000264 + task_s00000763_output_s00000264 + task_s00000745_output_s00000264 + task_s00000727_output_s00000264 + task_s00000718_output_s00000264 + task_s00000709_output_s00000264 + task_s00000755_output_s00000264 + task_s00000746_output_s00000264 + task_s00000737_output_s00000264 + task_s00000728_output_s00000264 + task_s00000719_output_s00000264 + task_s00000756_output_s00000264 + task_s00000738_output_s00000264 + task_s00000729_output_s00000264 + task_s00000757_output_s00000264 + task_s00000739_output_s00000264 + task_s00000758_output_s00000264 + task_s00000759_output_s00000264 + decision_s00000801_activated + decision_s00000802_activated + decision_s00000803_activated + decision_s00000804_activated + decision_s00000805_activated + decision_s00000780_activated + decision_s00000772_activated + decision_s00000773_activated + decision_s00000764_activated + decision_s00000792_activated + decision_s00000783_activated + decision_s00000774_activated + decision_s00000793_activated + decision_s00000784_activated + decision_s00000775_activated + decision_s00000776_activated + decision_s00000777_activated + decision_s00000768_activated + decision_s00000796_activated + decision_s00000787_activated + decision_s00000778_activated + decision_s00000788_activated + decision_s00000789_activated + decision_s00000799_activated + fork_s00000464_activated_s00000272 + fork_s00000465_activated_s00000272 + fork_s00000463_activated_s00000274 + fork_s00000466_activated_s00000272 + decision_s00000802_input_s00000263 + decision_s00000780_input_s00000263 + decision_s00000773_input_s00000263 + decision_s00000764_input_s00000263 + decision_s00000783_input_s00000263 + decision_s00000793_input_s00000263 + decision_s00000784_input_s00000263 + decision_s00000775_input_s00000263 + decision_s00000796_input_s00000263 + decision_s00000787_input_s00000263 + stopNode_s00000597_input_default + process_s00000030__s00000703_input_s00000263 + callToProcess_s00000807_input_s00000263 + callToProcess_s00000807_output_s00000264 + callToProcess_s00000348_output_s00000264 + callToProcess_s00000808_output_s00000264 + callToProcess_s00000596_output_s00000264 + task_s00000710_inputCriterion_s00000257_used + task_s00000720_inputCriterion_s00000257_used + task_s00000711_inputCriterion_s00000257_used + task_s00000730_inputCriterion_s00000257_used + task_s00000721_inputCriterion_s00000257_used + task_s00000712_inputCriterion_s00000257_used + task_s00000740_inputCriterion_s00000257_used + task_s00000731_inputCriterion_s00000257_used + task_s00000722_inputCriterion_s00000257_used + task_s00000704_inputCriterion_s00000257_used + task_s00000741_inputCriterion_s00000257_used + task_s00000723_inputCriterion_s00000257_used + task_s00000714_inputCriterion_s00000257_used + task_s00000705_inputCriterion_s00000257_used + task_s00000760_inputCriterion_s00000257_used + task_s00000742_inputCriterion_s00000257_used + task_s00000724_inputCriterion_s00000257_used + task_s00000715_inputCriterion_s00000257_used + task_s00000706_inputCriterion_s00000257_used + task_s00000761_inputCriterion_s00000257_used + task_s00000752_inputCriterion_s00000257_used + task_s00000743_inputCriterion_s00000257_used + task_s00000725_inputCriterion_s00000257_used + task_s00000716_inputCriterion_s00000257_used + task_s00000707_inputCriterion_s00000257_used + task_s00000762_inputCriterion_s00000257_used + task_s00000753_inputCriterion_s00000257_used + task_s00000744_inputCriterion_s00000257_used + task_s00000726_inputCriterion_s00000257_used + task_s00000717_inputCriterion_s00000257_used + task_s00000708_inputCriterion_s00000257_used + task_s00000763_inputCriterion_s00000257_used + task_s00000745_inputCriterion_s00000257_used + task_s00000727_inputCriterion_s00000257_used + task_s00000718_inputCriterion_s00000257_used + task_s00000709_inputCriterion_s00000257_used + task_s00000755_inputCriterion_s00000257_used + task_s00000746_inputCriterion_s00000257_used + task_s00000737_inputCriterion_s00000257_used + task_s00000728_inputCriterion_s00000257_used + task_s00000719_inputCriterion_s00000257_used + task_s00000756_inputCriterion_s00000257_used + task_s00000738_inputCriterion_s00000257_used + task_s00000729_inputCriterion_s00000257_used + task_s00000757_inputCriterion_s00000257_used + task_s00000739_inputCriterion_s00000257_used + task_s00000758_inputCriterion_s00000257_used + task_s00000759_inputCriterion_s00000257_used + callToProcess_s00000807_inputCriterion_s00000257_used + callToProcess_s00000348_inputCriterion_s00000257_used + callToProcess_s00000808_inputCriterion_s00000257_used + callToProcess_s00000596_inputCriterion_s00000257_used = 1
Reverse transition relation is NOT exact ! Due to transitions merge_s00000320_activate_s00000284, merge_s00000320_activate_s00000286, merge_s00000451_activate_s00000284, merge_s00000341_activate_s00000286, merge_s00000451_activate_s00000286, merge_s00000319_activate_s00000284, merge_s00000455_activate_s00000284, merge_s00000453_activate_s00000286, merge_s00000446_activate_s00000284, merge_s00000454_activate_s00000286, merge_s00000319_activate_s00000448, merge_s00000319_activate_s00000286, merge_s00000461_activate_s00000289, merge_s00000455_activate_s00000286, merge_s00000446_activate_s00000286, merge_s00000319_activate_s00000289, merge_s00000455_activate_s00000289, merge_s00000449_activate_s00000286, merge_s00000446_activate_s00000289, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/265/19/284
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
262 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,2.68652,88056,1,0,748,291573,614,676,6751,403590,1460
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
Checking formula 1 : !((G("(decision_s00000768_activated>=1)")))
Formula 1 simplified : !G"(decision_s00000768_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
78 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,3.46106,112072,1,0,956,416317,626,889,7249,574567,1796
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
Checking formula 2 : !((("(task_s00000747_inputCriterion_s00000257_used>=1)")U("(decision_s00000793_activated>=1)")))
Formula 2 simplified : !("(task_s00000747_inputCriterion_s00000257_used>=1)" U "(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,3.46202,112324,1,0,956,416317,636,889,7255,574569,1801
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
Checking formula 3 : !(((X(F(X("(task_s00000740_inputCriterion_s00000257_used>=1)"))))U(F("(callToProcess_s00000807_inputCriterion_s00000257_used>=1)"))))
Formula 3 simplified : !(XFX"(task_s00000740_inputCriterion_s00000257_used>=1)" U F"(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
209 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,5.54962,171252,1,0,1505,734495,645,1385,7256,1.04972e+06,2817
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
Checking formula 4 : !((F(X(X(("(merge_s00000446_input_s00000285>=1)")U("(merge_s00000456_input_s00000290>=1)"))))))
Formula 4 simplified : !FXX("(merge_s00000446_input_s00000285>=1)" U "(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
106 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,6.61,200552,1,0,1815,860680,654,1731,7257,1.28888e+06,3691
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
Checking formula 5 : !((F(F(X(G(F("(task_s00000751_inputCriterion_s00000257_used>=1)")))))))
Formula 5 simplified : !FXGF"(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
27 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,6.88178,207392,1,0,2023,861090,663,1990,7258,1.3771e+06,4536
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
Checking formula 6 : !(("(task_s00000741_output_s00000264>=1)"))
Formula 6 simplified : !"(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,6.88246,207392,1,0,2023,861090,666,1990,7259,1.3771e+06,4538
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
Checking formula 7 : !(("(task_s00000761_output_s00000264>=1)"))
Formula 7 simplified : !"(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,6.8829,207656,1,0,2023,861090,669,1990,7260,1.3771e+06,4540
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
Checking formula 8 : !(("(task_s00000730_input_s00000263>=1)"))
Formula 8 simplified : !"(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,6.88329,207656,1,0,2023,861090,672,1990,7261,1.3771e+06,4542
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
Checking formula 9 : !((G(F((G("(decision_s00000796_input_s00000263>=1)"))U("(task_s00000730_output_s00000264>=1)")))))
Formula 9 simplified : !GF(G"(decision_s00000796_input_s00000263>=1)" U "(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
19 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,7.06386,214252,1,0,2177,899692,681,2099,7262,1.42288e+06,4934
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
Checking formula 10 : !((X((("(task_s00000760_inputCriterion_s00000257_used>=1)")U("(decision_s00000804_activated>=1)"))U("(merge_s00000458_input_s00000285>=1)"))))
Formula 10 simplified : !X(("(task_s00000760_inputCriterion_s00000257_used>=1)" U "(decision_s00000804_activated>=1)") U "(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
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,7.07772,214616,1,0,2177,900601,705,2099,7278,1.42442e+06,4944
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
Checking formula 11 : !(("(task_s00000742_output_s00000264>=1)"))
Formula 11 simplified : !"(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,7.07837,214880,1,0,2177,900601,708,2099,7279,1.42442e+06,4946
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
Checking formula 12 : !(("(callToProcess_s00000596_output_s00000264>=1)"))
Formula 12 simplified : !"(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,7.0789,214880,1,0,2177,900601,711,2099,7280,1.42442e+06,4948
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
Checking formula 13 : !((G(("(task_s00000712_inputCriterion_s00000257_used>=1)")U("(merge_s00000806_activated>=1)"))))
Formula 13 simplified : !G("(task_s00000712_inputCriterion_s00000257_used>=1)" U "(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,7.08082,215100,1,0,2177,900601,727,2099,7289,1.42442e+06,4955
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
Checking formula 14 : !((X(G(G(G(F("(decision_s00000796_activated>=1)")))))))
Formula 14 simplified : !XGF"(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
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,7.10335,215352,1,0,2302,904548,736,2186,7290,1.42896e+06,5308
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
Checking formula 15 : !((((F("(merge_s00000458_activated>=1)"))U("(decision_s00000780_activated>=1)"))U((G("(task_s00000728_input_s00000263>=1)"))U(G("(task_s00000748_output_s00000264>=1)")))))
Formula 15 simplified : !((F"(merge_s00000458_activated>=1)" U "(decision_s00000780_activated>=1)") U (G"(task_s00000728_input_s00000263>=1)" U G"(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
9 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,7.19678,218452,1,0,2705,914505,755,2600,7302,1.45774e+06,6688
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
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 1527959595183

--------------------
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/ -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/ -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 5:13:04 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/, -smt]
Jun 02, 2018 5:13:04 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 5:13:04 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 117 ms
Jun 02, 2018 5:13:04 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 262 places.
Jun 02, 2018 5:13:04 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 284 transitions.
Jun 02, 2018 5:13:04 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 26 ms
Jun 02, 2018 5:13:05 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 134 ms
Jun 02, 2018 5:13:05 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
Jun 02, 2018 5:13:05 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 5:13:05 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 284 transitions.
Jun 02, 2018 5:13:05 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 1 place invariants in 138 ms
Jun 02, 2018 5:13:06 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 262 variables to be positive in 866 ms
Jun 02, 2018 5:13:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 284 transitions.
Jun 02, 2018 5:13:06 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 5:13:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:13:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 284 transitions.
Jun 02, 2018 5:13:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:13:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 284 transitions.
Jun 02, 2018 5:13:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(14/284) took 2156 ms. Total solver calls (SAT/UNSAT): 2750(0/2750)
Jun 02, 2018 5:13:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(35/284) took 5223 ms. Total solver calls (SAT/UNSAT): 7664(5/7659)
Jun 02, 2018 5:13:13 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (>= (select s0 205) 1)) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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 5:13:14 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 8743ms 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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/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 itstools"
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 r212-smll-152732263100316"
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 ;