fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r147-tall-162089137900229
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ParamProductionCell-PT-0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
709.487 15624.00 25372.00 142.00 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r147-tall-162089137900229.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-0, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089137900229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 149K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1620947894092

Running Version 0
[2021-05-13 23:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-13 23:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:18:15] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-13 23:18:15] [INFO ] Transformed 198 places.
[2021-05-13 23:18:15] [INFO ] Transformed 176 transitions.
[2021-05-13 23:18:15] [INFO ] Found NUPN structural information;
[2021-05-13 23:18:15] [INFO ] Parsed PT model containing 198 places and 176 transitions in 105 ms.
Built sparse matrix representations for Structural reductions in 6 ms.18906KB memory used
Starting structural reductions, iteration 0 : 198/198 places, 176/176 transitions.
Applied a total of 0 rules in 25 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 176/176 transitions.
Starting structural reductions, iteration 0 : 198/198 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 198 cols
[2021-05-13 23:18:15] [INFO ] Computed 49 place invariants in 18 ms
[2021-05-13 23:18:16] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 176 rows 198 cols
[2021-05-13 23:18:16] [INFO ] Computed 49 place invariants in 5 ms
[2021-05-13 23:18:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2021-05-13 23:18:16] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2021-05-13 23:18:16] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 176 rows 198 cols
[2021-05-13 23:18:16] [INFO ] Computed 49 place invariants in 7 ms
[2021-05-13 23:18:16] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 176/176 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2876 ms (no deadlock found). (steps per millisecond=434 )
Random directed walk for 1250002 steps, including 0 resets, run took 1676 ms (no deadlock found). (steps per millisecond=745 )
// Phase 1: matrix 176 rows 198 cols
[2021-05-13 23:18:20] [INFO ] Computed 49 place invariants in 3 ms
[2021-05-13 23:18:20] [INFO ] [Real]Absence check using 32 positive place invariants in 32 ms returned sat
[2021-05-13 23:18:21] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 34 ms returned sat
[2021-05-13 23:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:21] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2021-05-13 23:18:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 15 ms returned sat
[2021-05-13 23:18:21] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 19 ms returned sat
[2021-05-13 23:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:21] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2021-05-13 23:18:21] [INFO ] State equation strengthened by 59 read => feed constraints.
[2021-05-13 23:18:22] [INFO ] [Nat]Added 59 Read/Feed constraints in 18 ms returned sat
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 18 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 0 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2021-05-13 23:18:22] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 12 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 3 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 1 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:18:23] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2021-05-13 23:18:24] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2021-05-13 23:18:24] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2021-05-13 23:18:24] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2021-05-13 23:18:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 2205 ms
Starting structural reductions, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 180 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 180 transition count 158
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 74 place count 160 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 74 place count 160 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 158 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 156 transition count 138
Applied a total of 80 rules in 40 ms. Remains 156 /198 variables (removed 42) and now considering 138/176 (removed 38) transitions.
// Phase 1: matrix 138 rows 156 cols
[2021-05-13 23:18:24] [INFO ] Computed 45 place invariants in 3 ms
[2021-05-13 23:18:24] [INFO ] Implicit Places using invariants in 132 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 88, 89, 91, 93, 94, 128, 129, 131, 133, 134]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 135 ms to find 31 implicit places.
// Phase 1: matrix 138 rows 125 cols
[2021-05-13 23:18:24] [INFO ] Computed 14 place invariants in 14 ms
[2021-05-13 23:18:24] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Starting structural reductions, iteration 1 : 125/198 places, 138/176 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 125 transition count 122
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 109 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 109 transition count 118
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 103 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 103 transition count 116
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 118 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 65 transition count 78
Applied a total of 120 rules in 12 ms. Remains 65 /125 variables (removed 60) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 65 cols
[2021-05-13 23:18:24] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-13 23:18:24] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2021-05-13 23:18:24] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-13 23:18:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-13 23:18:24] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 65/198 places, 78/176 transitions.
[2021-05-13 23:18:24] [INFO ] Initial state test concluded for 1 properties.
Finished random walk after 1286 steps, including 0 resets, run visited all 77 properties in 8 ms. (steps per millisecond=160 )
Able to resolve query QuasiLiveness after proving 78 properties.
Starting structural reductions, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 180 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 180 transition count 158
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 74 place count 160 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 74 place count 160 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 158 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 156 transition count 138
Applied a total of 80 rules in 19 ms. Remains 156 /198 variables (removed 42) and now considering 138/176 (removed 38) transitions.
// Phase 1: matrix 138 rows 156 cols
[2021-05-13 23:18:24] [INFO ] Computed 45 place invariants in 2 ms
[2021-05-13 23:18:24] [INFO ] Implicit Places using invariants in 110 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 88, 89, 91, 93, 94, 128, 129, 131, 133, 134]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 111 ms to find 31 implicit places.
// Phase 1: matrix 138 rows 125 cols
[2021-05-13 23:18:24] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-13 23:18:24] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Starting structural reductions, iteration 1 : 125/198 places, 138/176 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 125 transition count 122
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 109 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 109 transition count 118
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 103 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 103 transition count 116
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 118 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 65 transition count 78
Applied a total of 120 rules in 10 ms. Remains 65 /125 variables (removed 60) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 65 cols
[2021-05-13 23:18:24] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-13 23:18:24] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2021-05-13 23:18:24] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-13 23:18:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-13 23:18:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 65/198 places, 78/176 transitions.
[2021-05-13 23:18:25] [INFO ] Flatten gal took : 31 ms
[2021-05-13 23:18:25] [INFO ] Flatten gal took : 12 ms
[2021-05-13 23:18:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3320930762392551254.gal : 6 ms
[2021-05-13 23:18:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17602153852953352869.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3320930762392551254.gal, -t, CGAL, -ctl, /tmp/CTLFireability17602153852953352869.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3320930762392551254.gal -t CGAL -ctl /tmp/CTLFireability17602153852953352869.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 78 CTL formulae.
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,7928,0.06838,6948,2,1117,5,11534,6,0,341,11266,0


Converting to forward existential form...Done !
original formula: AG(EF(((press_at_lower_pos>=1)&&(PU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_lower_pos>=1)&&(PU_lower_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions TL_rot_Cstop.TL_rot_Pstop.TL_lower_Pstart, TU_rot_Cstop.TU_rot_Pstop.TU_lift_Pstart, FB_deliver_Cstop.FB_deliver_Pstop.feed_belt_unlock_input_area.feed_belt_unlock_output_area.table_lock_input_area.TU_rot_Pstart, A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_ret_Cstop.A2U_ret_Pstop.arm2_unlock_output_area.arm2_unlock_swivel_2.deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, A2L_rot1_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, A2L_rot2_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, A2L_rot3_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, A2L_ret_Cstop.A2L_ret_Pstop.arm2_unlock_input_area.arm2_unlock_swivel_1.press_lock_output_area.PL_lower_Pstart, A1L_rot1_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, A1L_rot2_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, A1L_rot3_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, A1L_ret_Cstop.A1L_ret_Pstop.arm1_unlock_input_area.arm1_unlock_swivel_1.table_lock_output_area.TL_rot_Pstart, A1U_rot1_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, A1U_rot2_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, A1U_rot3_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, A1U_ret_Cstop.A1U_ret_Pstop.arm1_unlock_output_area.arm1_unlock_swivel_2.press_lock_input_area.forge_Pstart, TL_lower_Cstop.TL_lower_Pstop.table_unlock_input_area.p_t2.p_t1.feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/58/20/78
(forward)formula 0,1,0.411449,19040,1,0,186,76558,177,103,2099,52023,224
Formula is TRUE !

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

original formula: AG(EF(((press_at_upper_pos>=1)&&(PU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_upper_pos>=1)&&(PU_lower_run>=1)))))] = FALSE
(forward)formula 1,1,0.453393,20360,1,0,223,84410,178,126,2099,57943,285
Formula is TRUE !

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

original formula: AG(EF(((press_at_middle_pos>=1)&&(forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_middle_pos>=1)&&(forge_run>=1)))))] = FALSE
(forward)formula 2,1,0.498463,22208,1,0,260,94965,179,150,2099,66869,346
Formula is TRUE !

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

original formula: AG(EF(((press_at_lower_pos>=1)&&(PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_lower_pos>=1)&&(PL_lower_run>=1)))))] = FALSE
(forward)formula 3,1,0.632052,26432,1,0,297,119942,180,174,2099,87187,407
Formula is TRUE !

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

original formula: AG(EF(((table_unload_angle>=1)&&(TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_unload_angle>=1)&&(TL_rot_run>=1)))))] = FALSE
(forward)formula 4,1,0.815746,30512,1,0,336,148223,181,198,2099,110618,468
Formula is TRUE !

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

original formula: AG(EF(((table_top_pos>=1)&&(TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TL_lower_run>=1)))))] = FALSE
(forward)formula 5,1,0.819913,30776,1,0,375,148441,182,222,2099,111529,529
Formula is TRUE !

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

original formula: AG(EF(((table_top_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 6,1,0.824946,31040,1,0,414,148861,183,245,2099,112134,590
Formula is TRUE !

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

original formula: AG(EF(((table_bottom_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_bottom_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 7,1,0.828409,31304,1,0,453,149068,184,269,2099,112708,651
Formula is TRUE !

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

original formula: AG(EF(((table_load_angle>=1)&&(TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_load_angle>=1)&&(TU_rot_run>=1)))))] = FALSE
(forward)formula 8,1,0.830038,31304,1,0,492,149138,185,293,2099,112935,712
Formula is TRUE !

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

original formula: AG(EF(((belt2_light_barrier_false>=1)&&(DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_false>=1)&&(DB_trans_run>=1)))))] = FALSE
(forward)formula 9,1,0.956291,35264,1,0,527,178252,186,317,2099,134546,773
Formula is TRUE !

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

original formula: AG(EF(((belt2_light_barrier_true>=1)&&(DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_true>=1)&&(DB_deliver_run>=1)))))] = FALSE
(forward)formula 10,1,1.0066,36848,1,0,562,187880,187,340,2099,143367,834
Formula is TRUE !

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

original formula: AG(EF(((belt1_light_barrier_false>=1)&&(FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_false>=1)&&(FB_trans_run>=1)))))] = FALSE
(forward)formula 11,1,1.0698,38696,1,0,601,199807,188,364,2099,152805,895
Formula is TRUE !

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

original formula: AG(EF(((belt1_light_barrier_true>=1)&&(FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_true>=1)&&(FB_deliver_run>=1)))))] = FALSE
(forward)formula 12,1,1.23151,41072,1,0,640,212483,189,387,2099,161905,956
Formula is TRUE !

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

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A2U_rot1_run>=1)))))] = FALSE
(forward)formula 13,1,1.44524,48200,1,0,699,255167,190,422,2099,197060,1047
Formula is TRUE !

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

original formula: AG(EF(((arm1_release_angle>=1)&&(A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A2U_rot2_run>=1)))))] = FALSE
(forward)formula 14,1,1.72094,55816,1,0,746,293955,191,449,2099,229595,1118
Formula is TRUE !

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

original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2U_rot3_run>=1)))))] = FALSE
(forward)formula 15,1,1.88934,58720,1,0,787,315889,192,472,2099,248475,1179
Formula is TRUE !

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

original formula: AG(EF(((arm2_retract_ext>=1)&&(A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext>=1)&&(A2U_ext_run>=1)))))] = FALSE
(forward)formula 16,1,1.9911,61624,1,0,828,338852,193,496,2099,267018,1240
Formula is TRUE !

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

original formula: AG(EF(((arm2_release_ext>=1)&&(A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_ext>=1)&&(A2U_ret_run>=1)))))] = FALSE
(forward)formula 17,1,2.06541,64000,1,0,869,354246,194,519,2099,280950,1301
Formula is TRUE !

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

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A2L_rot1_run>=1)))))] = FALSE
(forward)formula 18,1,2.27229,70336,1,0,928,396784,195,554,2099,315435,1392
Formula is TRUE !

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

original formula: AG(EF(((arm1_release_angle>=1)&&(A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A2L_rot2_run>=1)))))] = FALSE
(forward)formula 19,1,2.63898,78520,1,0,981,444971,196,585,2099,355143,1473
Formula is TRUE !

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

original formula: AG(EF(((arm2_release_angle>=1)&&(A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2L_rot3_run>=1)))))] = FALSE
(forward)formula 20,1,2.8071,84328,1,0,1028,480474,197,612,2099,385773,1544
Formula is TRUE !

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

original formula: AG(EF(((arm2_retract_ext>=1)&&(A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext>=1)&&(A2L_ext_run>=1)))))] = FALSE
(forward)formula 21,1,2.88123,86968,1,0,1069,496035,198,636,2099,397657,1605
Formula is TRUE !

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

original formula: AG(EF(((arm2_pick_up_ext>=1)&&(A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_ext>=1)&&(A2L_ret_run>=1)))))] = FALSE
(forward)formula 22,1,2.9357,88816,1,0,1110,506330,199,659,2099,406851,1666
Formula is TRUE !
Detected timeout of ITS tools.
[2021-05-13 23:18:28] [INFO ] Flatten gal took : 7 ms
[2021-05-13 23:18:28] [INFO ] Applying decomposition
[2021-05-13 23:18:28] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5762854277438519760.txt, -o, /tmp/graph5762854277438519760.bin, -w, /tmp/graph5762854277438519760.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5762854277438519760.bin, -l, -1, -v, -w, /tmp/graph5762854277438519760.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:18:28] [INFO ] Decomposing Gal with order
[2021-05-13 23:18:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:18:28] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-13 23:18:28] [INFO ] Flatten gal took : 30 ms
[2021-05-13 23:18:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 23:18:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6429173566569207904.gal : 3 ms
[2021-05-13 23:18:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10556023698823265021.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6429173566569207904.gal, -t, CGAL, -ctl, /tmp/CTLFireability10556023698823265021.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6429173566569207904.gal -t CGAL -ctl /tmp/CTLFireability10556023698823265021.ctl
No direction supplied, using forward translation only.
Parsed 55 CTL formulae.
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,7928,0.026043,5120,192,109,1033,426,257,1084,87,930,0


Converting to forward existential form...Done !
original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u10.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u10.A1L_rot1_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions A2U_ret_Cstop_A2U_ret_Pstop_arm2_unlock_output_area_arm2_unlock_swivel_2_deposit_belt_lock_input_area_deposit_belt_lock_output_area_DB_trans_Pstart, A2L_ret_Cstop_A2L_ret_Pstop_arm2_unlock_input_area_arm2_unlock_swivel_1_press_lock_output_area_PL_lower_Pstart, A1L_ret_Cstop_A1L_ret_Pstop_arm1_unlock_input_area_arm1_unlock_swivel_1_table_lock_output_area_TL_rot_Pstart, A1U_ret_Cstop_A1U_ret_Pstop_arm1_unlock_output_area_arm1_unlock_swivel_2_press_lock_input_area_forge_Pstart, u9.A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u9.A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u9.A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u10.A1L_rot1_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u10.A1L_rot2_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u10.A1L_rot3_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u11.A1U_rot1_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u11.A1U_rot2_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u11.A1U_rot3_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u12.A2L_rot1_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u12.A2L_rot2_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u12.A2L_rot3_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, i1.TL_lower_Cstop_TL_lower_Pstop_table_unlock_input_area_p_t2_p_t1_feed_belt_lock_input_area_feed_belt_lock_output_area_FB_trans_Pstart, i1.TU_rot_Cstop_TU_rot_Pstop_TU_lift_Pstart, i1.i0.TL_rot_Cstop_TL_rot_Pstop_TL_lower_Pstart, i1.i1.u8.FB_deliver_Cstop.FB_deliver_Pstop.feed_belt_unlock_input_area.feed_belt_unlock_output_area.table_lock_input_area.TU_rot_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/58/20/78
(forward)formula 0,1,0.091698,8524,1,0,8180,954,1000,6889,417,2128,27068
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u10.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u10.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 1,1,0.106982,9316,1,0,10520,969,1003,8525,417,2149,34069
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u10.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u10.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 2,1,0.117831,9844,1,0,11921,969,1007,9618,417,2149,38480
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_retract_ext>=1)&&(u10.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_retract_ext>=1)&&(u10.A1L_ext_run>=1)))))] = FALSE
(forward)formula 3,1,0.132306,10636,1,0,13381,969,1010,10764,417,2149,42925
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_ext>=1)&&(u14.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_ext>=1)&&(u14.A1L_ret_run>=1)))))] = FALSE
(forward)formula 4,1,0.140173,10900,1,0,14082,977,1016,11468,419,2174,45729
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u11.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u11.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 5,1,0.152453,11428,1,0,15750,977,1019,12765,419,2176,49850
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u11.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u11.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 6,1,0.168988,12220,1,0,17067,977,1022,13815,419,2176,52826
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u11.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u11.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 7,1,0.176526,12484,1,0,18177,978,1025,14741,419,2180,55670
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_retract_ext>=1)&&(u11.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_retract_ext>=1)&&(u11.A1U_ext_run>=1)))))] = FALSE
(forward)formula 8,1,0.181527,13012,1,0,18797,978,1027,15270,419,2180,57249
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_release_ext>=1)&&(u14.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_release_ext>=1)&&(u14.A1U_ret_run>=1)))))] = FALSE
(forward)formula 9,1,0.185874,13012,1,0,19331,989,1033,15735,421,2209,58713
Formula is TRUE !

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

original formula: AG(EF((((i2.u7.ch_A2D_free>=1)&&(u14.swivel>=1))&&(u13.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i2.u7.ch_A2D_free>=1)&&(u14.swivel>=1))&&(u13.arm2_storing>=1)))))] = FALSE
(forward)formula 10,1,0.188596,13276,1,0,19582,989,1042,15956,421,2209,59399
Formula is TRUE !

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

original formula: AG(EF((((i0.u0.ch_A1P_free>=1)&&(u14.swivel>=1))&&(u14.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u0.ch_A1P_free>=1)&&(u14.swivel>=1))&&(u14.arm1_storing>=1)))))] = FALSE
(forward)formula 11,1,0.19158,13540,1,0,19857,989,1052,16219,423,2209,60083
Formula is TRUE !

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

original formula: AG(EF((((u14.swivel>=1)&&(i1.i1.u5.TU_lift_rs>=1))&&(u14.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u14.swivel>=1)&&(i1.i1.u5.TU_lift_rs>=1))&&(u14.arm1_store_free>=1)))))] = FALSE
(forward)formula 12,1,0.195464,13540,1,0,20216,989,1062,16541,425,2209,61452
Formula is TRUE !

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

original formula: AG(EF((((u14.swivel>=1)&&(i0.u1.PU_lower_rs>=1))&&(u13.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u14.swivel>=1)&&(i0.u1.PU_lower_rs>=1))&&(u13.arm2_store_free>=1)))))] = FALSE
(forward)formula 13,1,0.197694,13540,1,0,20409,989,1068,16715,425,2209,61994
Formula is TRUE !

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

original formula: AG(EF(((i0.u1.press_at_upper_pos>=1)&&(i0.u1.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u1.press_at_upper_pos>=1)&&(i0.u1.forge_run>=1)))))] = FALSE
(forward)formula 14,1,0.204528,13804,1,0,21322,994,1076,17515,427,2239,63723
Formula is TRUE !

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

original formula: AG(EF(((i0.u0.press_at_middle_pos>=1)&&(i0.u0.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.press_at_middle_pos>=1)&&(i0.u0.PL_lower_run>=1)))))] = FALSE
(forward)formula 15,1,0.210402,14332,1,0,22066,996,1085,18133,429,2239,65209
Formula is TRUE !

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

original formula: AG(EF(((i1.i0.u2.table_load_angle>=1)&&(i1.i0.u4.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i0.u2.table_load_angle>=1)&&(i1.i0.u4.TL_rot_run>=1)))))] = FALSE
(forward)formula 16,1,0.237551,15388,1,0,25469,996,1095,20827,429,2242,77205
Formula is TRUE !

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

original formula: AG(EF(((i1.i0.u2.table_unload_angle>=1)&&(i1.i1.u8.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i0.u2.table_unload_angle>=1)&&(i1.i1.u8.TU_rot_run>=1)))))] = FALSE
(forward)formula 17,1,0.26818,16708,1,0,28585,996,1101,23162,429,2248,87476
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.belt2_light_barrier_true>=1)&&(i2.u7.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_true>=1)&&(i2.u7.DB_trans_run>=1)))))] = FALSE
(forward)formula 18,1,0.270587,16972,1,0,28690,996,1107,23475,429,2249,87790
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.belt2_light_barrier_false>=1)&&(i2.u7.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_false>=1)&&(i2.u7.DB_deliver_run>=1)))))] = FALSE
(forward)formula 19,1,0.271768,16972,1,0,28754,996,1111,23559,429,2249,87972
Formula is TRUE !

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

original formula: AG(EF(((i1.i1.u8.belt1_light_barrier_true>=1)&&(i1.i1.u8.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i1.u8.belt1_light_barrier_true>=1)&&(i1.i1.u8.FB_trans_run>=1)))))] = FALSE
(forward)formula 20,1,0.309724,18820,1,0,32801,1004,1124,26635,430,2304,101422
Formula is TRUE !

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

original formula: AG(EF(((i1.i1.u8.belt1_light_barrier_false>=1)&&(i1.i1.u8.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i1.u8.belt1_light_barrier_false>=1)&&(i1.i1.u8.FB_deliver_run>=1)))))] = FALSE
(forward)formula 21,1,0.341758,19876,1,0,35884,1005,1138,29026,432,2307,112417
Formula is TRUE !

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

original formula: AG(EF(((u9.A2U_in>=1)&&(u10.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.A2U_in>=1)&&(u10.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 22,1,0.349193,20140,1,0,36853,1005,1140,29768,432,2307,115292
Formula is TRUE !

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

original formula: AG(EF(((u9.A2U_in>=1)&&(u11.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.A2U_in>=1)&&(u11.arm1_release_angle>=1)))))] = FALSE
(forward)formula 23,1,0.354404,20404,1,0,37440,1005,1142,30264,432,2307,117086
Formula is TRUE !

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

original formula: AG(EF(((u9.A2U_in>=1)&&(u12.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.A2U_in>=1)&&(u12.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 24,1,0.359024,20668,1,0,37971,1005,1144,30723,432,2307,118672
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u9.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u9.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 25,1,0.363714,20668,1,0,38497,1005,1148,31175,433,2310,120446
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u9.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u9.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 26,1,0.367263,20932,1,0,38859,1005,1152,31470,434,2310,121704
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u9.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u9.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 27,1,0.370888,21196,1,0,39248,1005,1157,31806,435,2313,122972
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_ext>=1)&&(u9.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_ext>=1)&&(u9.A2U_ext_run>=1)))))] = FALSE
(forward)formula 28,1,0.372688,21196,1,0,39406,1005,1160,31966,435,2313,123345
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_retract_ext>=1)&&(u13.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_retract_ext>=1)&&(u13.A2U_ret_run>=1)))))] = FALSE
(forward)formula 29,1,0.373974,21460,1,0,39531,1005,1164,32130,435,2313,123501
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 30,1,0.380266,21724,1,0,40236,1005,1167,32753,435,2313,125319
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 31,1,0.387515,21988,1,0,41112,1005,1169,33481,435,2313,127529
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 32,1,0.393357,21988,1,0,41754,1005,1171,34078,435,2314,129197
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 33,1,0.396566,22252,1,0,42036,1011,1174,34337,435,2318,129986
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 34,1,0.400271,22516,1,0,42347,1011,1177,34652,435,2332,130896
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 35,1,0.405015,22516,1,0,42673,1012,1180,34998,435,2342,131831
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_pick_up_ext>=1)&&(u12.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_pick_up_ext>=1)&&(u12.A2L_ext_run>=1)))))] = FALSE
(forward)formula 36,1,0.407858,22780,1,0,42870,1012,1183,35189,435,2342,132317
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_retract_ext>=1)&&(u13.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_retract_ext>=1)&&(u13.A2L_ret_run>=1)))))] = FALSE
(forward)formula 37,1,0.410348,22780,1,0,43055,1012,1186,35375,435,2342,132746
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 38,1,0.416507,23044,1,0,43474,1012,1188,35728,435,2342,134661
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 39,1,0.420554,23044,1,0,43746,1012,1190,35960,435,2342,135942
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 40,1,0.425509,23308,1,0,44094,1012,1192,36265,435,2342,137810
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u10.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u10.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 41,1,0.43079,23572,1,0,44481,1013,1196,36601,436,2346,139645
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u10.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u10.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 42,1,0.434711,23836,1,0,44731,1015,1196,36825,436,2346,140892
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u10.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u10.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 43,1,0.439483,23836,1,0,45052,1016,1200,37116,438,2350,142659
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_ext>=1)&&(u10.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_ext>=1)&&(u10.A1L_ext_run>=1)))))] = FALSE
(forward)formula 44,1,0.447177,24100,1,0,45631,1016,1202,37641,438,2352,145494
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_retract_ext>=1)&&(u14.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_retract_ext>=1)&&(u14.A1L_ret_run>=1)))))] = FALSE
(forward)formula 45,1,0.454473,24364,1,0,46141,1016,1206,38132,440,2352,148020
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u11.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u11.A1U_in>=1)))))] = FALSE
(forward)formula 46,1,0.460802,24628,1,0,46773,1016,1209,38658,440,2352,149834
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u11.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u11.A1U_in>=1)))))] = FALSE
(forward)formula 47,1,0.464602,24892,1,0,47106,1016,1211,38939,440,2352,150809
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u11.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u11.A1U_in>=1)))))] = FALSE
(forward)formula 48,1,0.469155,25156,1,0,47515,1016,1213,39300,440,2352,151988
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u11.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u11.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 49,1,0.475589,25156,1,0,48138,1023,1215,39850,440,2379,153769
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u11.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u11.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 50,1,0.479768,25420,1,0,48505,1028,1217,40171,440,2383,154852
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u11.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u11.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 51,1,0.484374,25420,1,0,48907,1031,1219,40531,440,2386,156035
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_release_ext>=1)&&(u11.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_release_ext>=1)&&(u11.A1U_ext_run>=1)))))] = FALSE
(forward)formula 52,1,0.489724,25684,1,0,49453,1031,1221,40987,440,2386,157548
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_retract_ext>=1)&&(u14.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_retract_ext>=1)&&(u14.A1U_ret_run>=1)))))] = FALSE
(forward)formula 53,1,0.493626,25948,1,0,49861,1031,1223,41363,440,2386,158382
Formula is TRUE !

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

original formula: AG(EF(((i1.i1.u3.table_bottom_pos>=1)&&(i1.i0.u4.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i1.u3.table_bottom_pos>=1)&&(i1.i0.u4.TL_lower_run>=1)))))] = FALSE
(forward)formula 54,1,0.541243,27268,1,0,53484,1031,1229,44137,440,2386,169949
Formula is TRUE !

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

Able to resolve query Liveness after proving 78 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1620947909716

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-0"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-0, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r147-tall-162089137900229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;