Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257700476.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257700476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-00
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-01
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-02
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-03
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-04
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-05
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-06
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-07
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-08
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-09
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-10
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-11
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-12
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-13
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-14
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590000551805

[2020-05-20 18:49:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 18:49:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:49:14] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2020-05-20 18:49:14] [INFO ] Transformed 231 places.
[2020-05-20 18:49:14] [INFO ] Transformed 202 transitions.
[2020-05-20 18:49:14] [INFO ] Found NUPN structural information;
[2020-05-20 18:49:14] [INFO ] Parsed PT model containing 231 places and 202 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 328 ms. (steps per millisecond=304 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 202 rows 231 cols
[2020-05-20 18:49:15] [INFO ] Computed 59 place invariants in 16 ms
[2020-05-20 18:49:15] [INFO ] [Real]Absence check using 35 positive place invariants in 59 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned unsat
[2020-05-20 18:49:15] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned unsat
[2020-05-20 18:49:15] [INFO ] [Real]Absence check using 35 positive place invariants in 130 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 142 ms returned sat
[2020-05-20 18:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:16] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2020-05-20 18:49:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2020-05-20 18:49:16] [INFO ] [Real]Added 68 Read/Feed constraints in 56 ms returned sat
[2020-05-20 18:49:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-05-20 18:49:16] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:16] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-05-20 18:49:16] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 5 places in 188 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 8 places in 88 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 7 places in 83 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 7 places in 84 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 10 places in 143 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 14 places in 103 ms
[2020-05-20 18:49:17] [INFO ] Deduced a trap composed of 50 places in 58 ms
[2020-05-20 18:49:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 963 ms
[2020-05-20 18:49:17] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned unsat
[2020-05-20 18:49:18] [INFO ] [Real]Absence check using 35 positive place invariants in 64 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned unsat
[2020-05-20 18:49:18] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:18] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Real]Added 68 Read/Feed constraints in 24 ms returned sat
[2020-05-20 18:49:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:18] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2020-05-20 18:49:18] [INFO ] [Nat]Added 68 Read/Feed constraints in 51 ms returned sat
[2020-05-20 18:49:18] [INFO ] Deduced a trap composed of 5 places in 149 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 10 places in 105 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 7 places in 121 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 7 places in 116 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 7 places in 113 ms
[2020-05-20 18:49:19] [INFO ] Deduced a trap composed of 49 places in 98 ms
[2020-05-20 18:49:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 834 ms
[2020-05-20 18:49:19] [INFO ] [Real]Absence check using 35 positive place invariants in 26 ms returned sat
[2020-05-20 18:49:19] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-05-20 18:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:19] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2020-05-20 18:49:20] [INFO ] [Real]Added 68 Read/Feed constraints in 43 ms returned sat
[2020-05-20 18:49:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-05-20 18:49:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-20 18:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:20] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2020-05-20 18:49:20] [INFO ] [Nat]Added 68 Read/Feed constraints in 29 ms returned sat
[2020-05-20 18:49:20] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-05-20 18:49:20] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-05-20 18:49:20] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-05-20 18:49:20] [INFO ] Deduced a trap composed of 10 places in 162 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 5 places in 109 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 7 places in 74 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-05-20 18:49:21] [INFO ] Deduced a trap composed of 40 places in 65 ms
[2020-05-20 18:49:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 905 ms
[2020-05-20 18:49:21] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2020-05-20 18:49:21] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2020-05-20 18:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:21] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-05-20 18:49:21] [INFO ] [Real]Added 68 Read/Feed constraints in 44 ms returned sat
[2020-05-20 18:49:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-05-20 18:49:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2020-05-20 18:49:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:22] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-05-20 18:49:22] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 5 places in 194 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 8 places in 208 ms
[2020-05-20 18:49:22] [INFO ] Deduced a trap composed of 18 places in 224 ms
[2020-05-20 18:49:23] [INFO ] Deduced a trap composed of 8 places in 809 ms
[2020-05-20 18:49:24] [INFO ] Deduced a trap composed of 29 places in 705 ms
[2020-05-20 18:49:24] [INFO ] Deduced a trap composed of 7 places in 422 ms
[2020-05-20 18:49:24] [INFO ] Deduced a trap composed of 10 places in 144 ms
[2020-05-20 18:49:25] [INFO ] Deduced a trap composed of 5 places in 135 ms
[2020-05-20 18:49:25] [INFO ] Deduced a trap composed of 41 places in 175 ms
[2020-05-20 18:49:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 3218 ms
[2020-05-20 18:49:25] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-05-20 18:49:25] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned unsat
[2020-05-20 18:49:25] [INFO ] [Real]Absence check using 35 positive place invariants in 77 ms returned sat
[2020-05-20 18:49:25] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 24 ms returned sat
[2020-05-20 18:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:25] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-05-20 18:49:25] [INFO ] [Real]Added 68 Read/Feed constraints in 43 ms returned sat
[2020-05-20 18:49:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:49:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 26 ms returned sat
[2020-05-20 18:49:25] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2020-05-20 18:49:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:49:26] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-05-20 18:49:26] [INFO ] [Nat]Added 68 Read/Feed constraints in 16 ms returned sat
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 5 places in 108 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 5 places in 102 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 5 places in 120 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 8 places in 95 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 28 places in 118 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 7 places in 97 ms
[2020-05-20 18:49:26] [INFO ] Deduced a trap composed of 23 places in 98 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 24 places in 96 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 35 places in 72 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 11 places in 76 ms
[2020-05-20 18:49:27] [INFO ] Deduced a trap composed of 17 places in 41 ms
[2020-05-20 18:49:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1207 ms
[2020-05-20 18:49:27] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned unsat
[2020-05-20 18:49:27] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-05-20 18:49:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2020-05-20 18:49:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-20 18:49:27] [INFO ] Flatten gal took : 173 ms
[2020-05-20 18:49:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-20 18:49:27] [INFO ] Flatten gal took : 41 ms
FORMULA ParamProductionCell-PT-1-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:49:27] [INFO ] Applying decomposition
[2020-05-20 18:49:27] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph17145281963799859880.txt, -o, /tmp/graph17145281963799859880.bin, -w, /tmp/graph17145281963799859880.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph17145281963799859880.bin, -l, -1, -v, -w, /tmp/graph17145281963799859880.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:49:28] [INFO ] Decomposing Gal with order
[2020-05-20 18:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:49:28] [INFO ] Removed a total of 87 redundant transitions.
[2020-05-20 18:49:28] [INFO ] Flatten gal took : 152 ms
[2020-05-20 18:49:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-20 18:49:28] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 21 ms
[2020-05-20 18:49:28] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 65 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 17 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25632,0.238687,8408,995,57,7552,312,667,5699,63,491,0


Converting to forward existential form...Done !
original formula: !(EF(AG(((i8.u55.arm1_pick_up_angle==1)&&(i8.u64.A1U_in==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i8.u55.arm1_pick_up_angle==1)&&(i8.u64.A1U_in==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions forge_Pstart, PL_lower_Pstart, TL_rot_Pstart, TU_rot_Pstart, DB_trans_Pstart, arm2_unlock_swivel_2, A2U_ext_Pstart, A2L_ext_Pstart, arm1_unlock_swivel_2, A1L_ext_Pstart, A1U_ext_Pstart, CU_lower_Pstart, CL_lower_Pstart, CL_trans_Pstart, i0.PU_lower_Pstart, i2.TL_lower_Pstart, i2.i1.TU_lift_Pstart, i3.i0.DB_deliver_Pstart, i4.FB_trans_Pstart, i4.i2.FB_deliver_Pstart, i5.A2L_ret_Pstart, i5.A2U_ret_Pstart, i7.A1U_ret_Pstart, i7.A1L_ret_Pstart, i8.A1U_rot1_Pstart, i8.A1L_rot3_Pstart, i8.A2L_rot2_Pstart, i8.A2U_rot3_Pstart, i9.i0.CU_trans_Pstart, i10.CL_lift_Pstart, i10.CU_lift_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/131/31/202
(forward)formula 0,1,0.40604,15656,1,0,19057,404,3240,21539,290,847,95567
FORMULA ParamProductionCell-PT-1-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AX(EG(((i5.u39.arm2_backward!=1)||(i5.u43.A2U_ret_rs!=1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((i5.u39.arm2_backward!=1)||(i5.u43.A2U_ret_rs!=1)))))] = FALSE
(forward)formula 1,0,1.39796,57368,1,0,125700,417,3689,105949,301,877,339408
FORMULA ParamProductionCell-PT-1-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG((((i0.u10.press_stop!=1)||(i1.i2.u14.PL_in!=1))||(((i1.i0.u25.deposit_belt_empty==1)&&(i7.u69.arm1_release_ext==1))&&(i7.u69.A1U_ext_run==1))))
=> equivalent forward existential formula: [FwdG(Init,(((i0.u10.press_stop!=1)||(i1.i2.u14.PL_in!=1))||(((i1.i0.u25.deposit_belt_empty==1)&&(i7.u69.arm1_release_ext==1))&&(i7.u69.A1U_ext_run==1))))] != FALSE
(forward)formula 2,0,1.68869,70304,1,0,154943,438,4132,125775,314,969,421530
FORMULA ParamProductionCell-PT-1-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF((AG((((i3.i0.u26.belt2_start==1)&&(i3.i0.u27.DB_trans_rs==1))||((i10.u72.crane_mag_off==1)&&(i10.u71.CL_ready_to_grasp==1)))) * (((i10.u77.crane_transport_height==1)&&(i10.u77.CU_lift_run==1))||(((i5.u43.arm2_retract_ext==1)&&(i5.u39.arm2_forward==1))&&(i5.u50.A2L_ext_run==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((i10.u77.crane_transport_height==1)&&(i10.u77.CU_lift_run==1))||(((i5.u43.arm2_retract_ext==1)&&(i5.u39.arm2_forward==1))&&(i5.u50.A2L_ext_run==1)))) * !(E(TRUE U !((((i3.i0.u26.belt2_start==1)&&(i3.i0.u27.DB_trans_rs==1))||((i10.u72.crane_mag_off==1)&&(i10.u71.CL_ready_to_grasp==1)))))))] != FALSE
(forward)formula 3,0,1.69149,70568,1,0,154992,438,4153,125825,314,969,421999
FORMULA ParamProductionCell-PT-1-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(((i10.u73.crane_lift==1)&&(i10.u83.CL_lift_rs==1)) U EG(((i2.i1.u20.table_bottom_pos!=1)||(i2.i1.u20.TL_lower_run!=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((i10.u73.crane_lift==1)&&(i10.u83.CL_lift_rs==1))),((i2.i1.u20.table_bottom_pos!=1)||(i2.i1.u20.TL_lower_run!=1)))] != FALSE
(forward)formula 4,0,1.92644,79808,1,0,182485,451,4337,144421,315,1016,495099
FORMULA ParamProductionCell-PT-1-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AF((AG((((i2.i0.u19.table_load_angle==1)&&(i2.i0.u17.table_right==1))&&(i2.i0.u24.TU_rot_run==1))) * EG(((i8.u35.robot_left==1)&&(i8.u57.A1L_rot3_rs==1))))) + EF(AX(((i3.i0.u27.belt2_light_barrier_true==1)&&(i3.i0.u27.DB_trans_run==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U !(EX(!(((i3.i0.u27.belt2_light_barrier_true==1)&&(i3.i0.u27.DB_trans_run==1)))))))),!((!(E(TRUE U !((((i2.i0.u19.table_load_angle==1)&&(i2.i0.u17.table_right==1))&&(i2.i0.u24.TU_rot_run==1))))) * EG(((i8.u35.robot_left==1)&&(i8.u57.A1L_rot3_rs==1))))))] = FALSE
(forward)formula 5,1,2.02924,83768,1,0,192123,451,4395,153047,319,1016,520877
FORMULA ParamProductionCell-PT-1-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
(forward)formula 6,0,2.06226,84296,1,0,193588,452,4409,154691,319,1020,527452
FORMULA ParamProductionCell-PT-1-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !(AF(((i5.u39.arm2_backward==1)&&(i5.u43.A2U_ret_rs==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((i5.u39.arm2_backward==1)&&(i5.u43.A2U_ret_rs==1))))] != FALSE
(forward)formula 7,0,2.14067,87464,1,0,200729,452,4440,159849,319,1020,550737
FORMULA ParamProductionCell-PT-1-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(((i1.i1.u7.ch_A2D_free==1)&&(i1.i1.u7.arm2_storing==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((i1.i1.u7.ch_A2D_free==1)&&(i1.i1.u7.arm2_storing==1))))] = FALSE
(forward)formula 8,1,2.17457,88784,1,0,203603,452,4489,161816,321,1020,561583
FORMULA ParamProductionCell-PT-1-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(AF(((i7.u58.arm1_forward==1)&&(i7.u69.A1U_ext_rs==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((i7.u58.arm1_forward==1)&&(i7.u69.A1U_ext_rs==1))))))] != FALSE
(forward)formula 9,1,2.40846,94592,1,0,215593,452,4511,170905,321,1020,583779
FORMULA ParamProductionCell-PT-1-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(EF((((i2.i0.u24.table_unload_angle==1)&&(i2.i0.u17.table_right==1))&&(i2.i0.u19.TL_rot_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i2.i0.u24.table_unload_angle==1)&&(i2.i0.u17.table_right==1))&&(i2.i0.u19.TL_rot_run==1)))))] = FALSE
(forward)formula 10,1,2.49816,98288,1,0,223950,452,4528,178129,321,1020,602936
FORMULA ParamProductionCell-PT-1-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG((EF((((i5.u42.arm2_release_ext!=1)||(i5.u39.arm2_backward!=1))||(i5.u43.A2U_ret_run!=1))) + ((i3.i0.u26.belt2_stop==1)&&(i3.i0.u26.DB_at_end==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((i3.i0.u26.belt2_stop==1)&&(i3.i0.u26.DB_at_end==1)))) * !(E(TRUE U (((i5.u42.arm2_release_ext!=1)||(i5.u39.arm2_backward!=1))||(i5.u43.A2U_ret_run!=1)))))] = FALSE
(forward)formula 11,1,2.50014,98552,1,0,223977,452,4535,178146,321,1020,603239
FORMULA ParamProductionCell-PT-1-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(((i2.i1.u20.table_bottom_pos!=1)||(i2.i1.u20.TL_lower_run!=1)))
=> equivalent forward existential formula: [FwdG(Init,((i2.i1.u20.table_bottom_pos!=1)||(i2.i1.u20.TL_lower_run!=1)))] != FALSE
(forward)formula 12,0,2.50055,98552,1,0,223977,452,4535,178146,321,1020,603239
FORMULA ParamProductionCell-PT-1-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1590000571481

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ParamProductionCell-PT-1"
export BK_EXAMINATION="CTLFireability"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-1, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961257700476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;