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-162089138000239.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-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089138000239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K 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 3.8K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 174K 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 1620947962062

Running Version 0
[2021-05-13 23:19:23] [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:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:19:23] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-13 23:19:23] [INFO ] Transformed 231 places.
[2021-05-13 23:19:23] [INFO ] Transformed 202 transitions.
[2021-05-13 23:19:23] [INFO ] Found NUPN structural information;
[2021-05-13 23:19:23] [INFO ] Parsed PT model containing 231 places and 202 transitions in 116 ms.
Built sparse matrix representations for Structural reductions in 5 ms.19118KB memory used
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 23 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 11 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:19:23] [INFO ] Computed 59 place invariants in 17 ms
[2021-05-13 23:19:24] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:19:24] [INFO ] Computed 59 place invariants in 8 ms
[2021-05-13 23:19:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:19:24] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2021-05-13 23:19:24] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:19:24] [INFO ] Computed 59 place invariants in 6 ms
[2021-05-13 23:19:24] [INFO ] Dead Transitions using invariants and state equation in 153 ms returned []
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3108 ms (no deadlock found). (steps per millisecond=402 )
Random directed walk for 1250000 steps, including 0 resets, run took 2143 ms (no deadlock found). (steps per millisecond=583 )
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:19:29] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-13 23:19:29] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2021-05-13 23:19:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 113 ms returned sat
[2021-05-13 23:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:19:30] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2021-05-13 23:19:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:19:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2021-05-13 23:19:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-13 23:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:19:31] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2021-05-13 23:19:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:19:31] [INFO ] [Nat]Added 68 Read/Feed constraints in 18 ms returned sat
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:19:31] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:19:32] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2021-05-13 23:19:33] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2021-05-13 23:19:34] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 5 ms to minimize.
[2021-05-13 23:19:34] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2021-05-13 23:19:34] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 2903 ms
[2021-05-13 23:19:34] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 13 ms.
[2021-05-13 23:19:35] [INFO ] Added : 195 causal constraints over 39 iterations in 1152 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
Parikh directed walk for 40300 steps, including 436 resets, run took 163 ms. (steps per millisecond=247 )
Random directed walk for 500002 steps, including 0 resets, run took 830 ms (no deadlock found). (steps per millisecond=602 )
Random walk for 500000 steps, including 0 resets, run took 1136 ms (no deadlock found). (steps per millisecond=440 )
Random directed walk for 500000 steps, including 0 resets, run took 829 ms (no deadlock found). (steps per millisecond=603 )
Random walk for 500000 steps, including 0 resets, run took 1201 ms (no deadlock found). (steps per millisecond=416 )
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:19:39] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-13 23:19:39] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:19:39] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-13 23:19:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:19:39] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2021-05-13 23:19:39] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:19:39] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-13 23:19:39] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2962 ms (no deadlock found). (steps per millisecond=422 )
Random directed walk for 1250001 steps, including 0 resets, run took 2039 ms (no deadlock found). (steps per millisecond=613 )
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:19:45] [INFO ] Computed 59 place invariants in 9 ms
[2021-05-13 23:19:45] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2021-05-13 23:19:45] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 154 ms returned sat
[2021-05-13 23:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:19:46] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2021-05-13 23:19:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:19:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2021-05-13 23:19:46] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-13 23:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:19:46] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2021-05-13 23:19:46] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:19:46] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2021-05-13 23:19:46] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:19:46] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2021-05-13 23:19:46] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:19:46] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:19:47] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 8 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:19:48] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2021-05-13 23:19:49] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:19:49] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2021-05-13 23:19:49] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:19:49] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:19:49] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2021-05-13 23:19:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:19:49] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 2736 ms
[2021-05-13 23:19:49] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 12 ms.
[2021-05-13 23:19:50] [INFO ] Added : 195 causal constraints over 39 iterations in 1076 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
Parikh directed walk for 40300 steps, including 437 resets, run took 117 ms. (steps per millisecond=344 )
Random directed walk for 500001 steps, including 0 resets, run took 807 ms (no deadlock found). (steps per millisecond=619 )
Random walk for 500000 steps, including 0 resets, run took 1179 ms (no deadlock found). (steps per millisecond=424 )
Random directed walk for 500002 steps, including 0 resets, run took 815 ms (no deadlock found). (steps per millisecond=613 )
Random walk for 500000 steps, including 0 resets, run took 1209 ms (no deadlock found). (steps per millisecond=413 )
[2021-05-13 23:19:54] [INFO ] Flatten gal took : 60 ms
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
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 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Applied a total of 76 rules in 38 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2021-05-13 23:19:54] [INFO ] Computed 59 place invariants in 4 ms
[2021-05-13 23:19:55] [INFO ] Implicit Places using invariants in 169 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 172 ms to find 39 implicit places.
// Phase 1: matrix 164 rows 154 cols
[2021-05-13 23:19:55] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:19:55] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 154/231 places, 164/202 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 154 transition count 143
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 133 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 133 transition count 139
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 50 place count 129 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 127 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 127 transition count 137
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 12 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:19:55] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-13 23:19:55] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:19:55] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:19:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:19:55] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2021-05-13 23:19:55] [INFO ] Initial state test concluded for 2 properties.
Finished random walk after 4676 steps, including 1 resets, run visited all 92 properties in 23 ms. (steps per millisecond=203 )
Able to resolve query QuasiLiveness after proving 94 properties.
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
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 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Applied a total of 76 rules in 16 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2021-05-13 23:19:55] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-13 23:19:55] [INFO ] Implicit Places using invariants in 156 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 158 ms to find 39 implicit places.
// Phase 1: matrix 164 rows 154 cols
[2021-05-13 23:19:55] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:19:55] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 154/231 places, 164/202 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 154 transition count 143
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 133 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 133 transition count 139
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 50 place count 129 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 127 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 127 transition count 137
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 14 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:19:55] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-13 23:19:55] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:19:55] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:19:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:19:55] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2021-05-13 23:19:55] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:19:55] [INFO ] Flatten gal took : 9 ms
[2021-05-13 23:19:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8217071913655572532.gal : 7 ms
[2021-05-13 23:19:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17709409392724302876.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/CTLFireability8217071913655572532.gal, -t, CGAL, -ctl, /tmp/CTLFireability17709409392724302876.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/CTLFireability8217071913655572532.gal -t CGAL -ctl /tmp/CTLFireability17709409392724302876.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 94 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,8382,0.099991,8232,2,2656,5,16101,6,0,433,13479,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 deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, crane_lock_output_area.CU_lower_Pstart, crane_lock_input_area.CL_lower_Pstart, 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, 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, CU_lift_Cstop.CU_lift_Pstop.CU_trans_Pstart, CL_lift_Cstop.CL_lift_Pstop.CL_trans_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/25/94
(forward)formula 0,1,1.08471,42460,1,0,227,172593,209,129,2645,113310,281
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,1.12448,43780,1,0,279,181980,210,162,2645,120601,367
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,1.17404,45364,1,0,331,193100,211,196,2645,130099,453
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,1.37628,51172,1,0,383,234670,212,230,2645,162973,539
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,1.52105,58312,1,0,437,271739,213,264,2645,191902,625
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,1.5277,58576,1,0,491,271949,214,298,2645,194081,711
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,1.66415,61744,1,0,545,292340,215,331,2645,209775,797
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,1.68544,62536,1,0,599,297138,216,365,2645,213391,883
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,1.69678,63064,1,0,653,299364,217,399,2645,216120,969
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,2.022,75472,1,0,706,380135,218,433,2645,273436,1055
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,2.41774,85240,1,0,759,441451,219,466,2645,318157,1141
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,2.47565,87088,1,0,815,454105,220,500,2645,328152,1227
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,2.53547,89200,1,0,871,466074,221,533,2645,336893,1313
Formula is TRUE !
Detected timeout of ITS tools.
[2021-05-13 23:19:58] [INFO ] Flatten gal took : 7 ms
[2021-05-13 23:19:58] [INFO ] Applying decomposition
[2021-05-13 23:19:58] [INFO ] Flatten gal took : 8 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/graph8194776443541355332.txt, -o, /tmp/graph8194776443541355332.bin, -w, /tmp/graph8194776443541355332.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/graph8194776443541355332.bin, -l, -1, -v, -w, /tmp/graph8194776443541355332.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:19:58] [INFO ] Decomposing Gal with order
[2021-05-13 23:19:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:19:58] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-13 23:19:59] [INFO ] Flatten gal took : 37 ms
[2021-05-13 23:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 23:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15162654940484689655.gal : 4 ms
[2021-05-13 23:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11425061384291745466.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/CTLFireability15162654940484689655.gal, -t, CGAL, -ctl, /tmp/CTLFireability11425061384291745466.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/CTLFireability15162654940484689655.gal -t CGAL -ctl /tmp/CTLFireability11425061384291745466.ctl
No direction supplied, using forward translation only.
Parsed 81 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,8382,0.040792,5808,274,110,1985,376,350,2007,103,1242,0


Converting to forward existential form...Done !
original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u13.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u13.A2U_rot1_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions crane_lock_input_area_CL_lower_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_ret_Cstop_A2U_ret_Pstop_arm2_unlock_output_area_arm2_unlock_swivel_2, 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, 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.A2L_rot1_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u11.A2L_rot2_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u11.A2L_rot3_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u13.A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u13.A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u13.A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u15.A1U_rot1_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u15.A1U_rot2_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u15.A1U_rot3_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, i1.TU_rot_Cstop_TU_rot_Pstop_TU_lift_Pstart, i1.i0.TL_rot_Cstop_TL_rot_Pstop_TL_lower_Pstart, i1.i2.u9.feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, i2.u7.deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, i9.CL_lift_Cstop_CL_lift_Pstop_CL_trans_Pstart, i9.u16.CU_lift_Cstop.CU_lift_Pstop.CU_trans_Pstart, i9.u18.crane_lock_output_area.CU_lower_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/25/94
(forward)formula 0,1,0.13737,10416,1,0,12656,940,1267,12043,477,2471,36448
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u13.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u13.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 1,1,0.168672,11736,1,0,15662,958,1270,15069,477,2516,45778
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u13.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u13.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 2,1,0.181351,12264,1,0,16810,958,1274,16638,477,2519,49586
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_retract_ext>=1)&&(u13.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext>=1)&&(u13.A2U_ext_run>=1)))))] = FALSE
(forward)formula 3,1,0.191194,12792,1,0,17515,958,1277,17729,477,2521,51944
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_release_ext>=1)&&(u12.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_ext>=1)&&(u12.A2U_ret_run>=1)))))] = FALSE
(forward)formula 4,1,0.20443,13056,1,0,18115,958,1283,18602,479,2521,54319
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 5,1,0.223505,14112,1,0,19912,958,1286,20714,479,2521,61087
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u11.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u11.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 6,1,0.23712,14640,1,0,21166,958,1289,22373,479,2523,65166
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u11.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u11.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 7,1,0.244152,15168,1,0,21625,958,1292,22995,479,2523,66947
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_retract_ext>=1)&&(u11.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext>=1)&&(u11.A2L_ext_run>=1)))))] = FALSE
(forward)formula 8,1,0.254335,15432,1,0,22253,958,1294,23968,479,2523,69272
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_ext>=1)&&(u12.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_ext>=1)&&(u12.A2L_ret_run>=1)))))] = FALSE
(forward)formula 9,1,0.266195,15696,1,0,22878,958,1300,24933,481,2523,71730
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u10.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u10.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 10,1,0.279857,16488,1,0,24027,958,1303,26197,481,2523,76167
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u10.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u10.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 11,1,0.293184,16752,1,0,24441,958,1306,26734,481,2523,78061
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u10.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u10.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 12,1,0.318898,17544,1,0,26281,958,1309,28646,481,2528,84407
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 13,1,0.330877,18072,1,0,27341,961,1312,30085,481,2533,88133
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 14,1,0.340483,18600,1,0,28108,965,1316,31080,481,2537,91088
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u15.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u15.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 15,1,0.351181,19128,1,0,29125,967,1319,32381,481,2563,94598
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 16,1,0.35868,19392,1,0,29680,967,1322,33098,481,2573,96891
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 17,1,0.369762,19920,1,0,30642,968,1325,34396,481,2584,100329
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_retract_ext>=1)&&(u15.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_retract_ext>=1)&&(u15.A1U_ext_run>=1)))))] = FALSE
(forward)formula 18,1,0.379858,20448,1,0,31517,987,1327,35683,481,2612,103005
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 19,1,0.39588,20976,1,0,32076,990,1333,36349,483,2613,105121
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_release_height>=1)&&(i9.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_release_height>=1)&&(i9.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 20,1,0.429284,22824,1,0,37204,990,1340,41069,484,2614,119517
Formula is TRUE !

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

original formula: AG(EF(((i9.u17.crane_above_feed_belt>=1)&&(i9.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_above_feed_belt>=1)&&(i9.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 21,1,0.464119,24672,1,0,42208,990,1345,45645,484,2621,133413
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u18.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u18.CU_lower_run>=1)))))] = FALSE
(forward)formula 22,1,0.503111,26784,1,0,47443,993,1351,50427,484,2622,147716
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u19.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u19.CL_lower_run>=1)))))] = FALSE
(forward)formula 23,1,0.548579,28368,1,0,51310,993,1356,54258,484,2622,158311
Formula is TRUE !

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

original formula: AG(EF(((i9.u17.crane_above_deposit_belt>=1)&&(i9.u17.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_above_deposit_belt>=1)&&(i9.u17.CL_trans_run>=1)))))] = FALSE
(forward)formula 24,1,0.594416,29952,1,0,54899,993,1361,57736,484,2622,168471
Formula is TRUE !

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

original formula: AG(EF(((i9.u19.crane_pick_up_height>=1)&&(i9.u19.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u19.crane_pick_up_height>=1)&&(i9.u19.CL_lift_run>=1)))))] = FALSE
(forward)formula 25,1,0.622547,31536,1,0,58558,993,1369,61359,485,2626,178922
Formula is TRUE !

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

original formula: AG(EF(((i2.u7.ch_DC_free>=1)&&(i2.u7.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u7.ch_DC_free>=1)&&(i2.u7.ch_A2D_full>=1)))))] = FALSE
(forward)formula 26,1,0.641634,32592,1,0,60813,993,1373,63758,485,2626,185288
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u9.ch_CF_full>=1)&&(i1.i2.u9.ch_FT_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u9.ch_CF_full>=1)&&(i1.i2.u9.ch_FT_free>=1)))))] = FALSE
(forward)formula 27,1,0.678214,34704,1,0,65884,993,1384,68232,486,2626,199262
Formula is TRUE !

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

original formula: AG(EF((((i2.u6.ch_A2D_free>=1)&&(u14.swivel>=1))&&(u12.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i2.u6.ch_A2D_free>=1)&&(u14.swivel>=1))&&(u12.arm2_storing>=1)))))] = FALSE
(forward)formula 28,1,0.683442,34968,1,0,66152,993,1393,68634,486,2626,200536
Formula is TRUE !

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

original formula: AG(EF((((i0.u1.ch_A1P_free>=1)&&(u14.swivel>=1))&&(u14.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u1.ch_A1P_free>=1)&&(u14.swivel>=1))&&(u14.arm1_storing>=1)))))] = FALSE
(forward)formula 29,1,0.68649,34968,1,0,66289,993,1403,68864,488,2626,201292
Formula is TRUE !

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

original formula: AG(EF(((i9.u18.ch_CF_free>=1)&&(i9.u18.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u18.ch_CF_free>=1)&&(i9.u18.crane_storing>=1)))))] = FALSE
(forward)formula 30,1,0.741112,37080,1,0,71095,993,1411,73179,488,2626,214325
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.ch_DC_full>=1)&&(i9.u19.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.ch_DC_full>=1)&&(i9.u19.crane_store_free>=1)))))] = FALSE
(forward)formula 31,1,0.764864,38136,1,0,74361,993,1416,76354,488,2626,223409
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 32,1,0.77472,38664,1,0,75220,993,1426,77379,490,2626,226849
Formula is TRUE !

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

original formula: AG(EF((((u14.swivel>=1)&&(i0.u0.PU_lower_rs>=1))&&(u12.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u14.swivel>=1)&&(i0.u0.PU_lower_rs>=1))&&(u12.arm2_store_free>=1)))))] = FALSE
(forward)formula 33,1,0.780282,39192,1,0,75583,993,1432,77846,490,2626,228593
Formula is TRUE !

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

original formula: AG(EF(((i0.u0.press_at_upper_pos>=1)&&(i0.u0.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.press_at_upper_pos>=1)&&(i0.u0.forge_run>=1)))))] = FALSE
(forward)formula 34,1,0.797619,39720,1,0,77533,993,1438,80066,490,2636,234228
Formula is TRUE !

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

original formula: AG(EF(((i0.u1.press_at_middle_pos>=1)&&(i0.u1.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u1.press_at_middle_pos>=1)&&(i0.u1.PL_lower_run>=1)))))] = FALSE
(forward)formula 35,1,0.818643,40776,1,0,79793,993,1446,82565,492,2636,241120
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 36,1,0.859723,43152,1,0,85183,993,1454,87619,492,2637,257181
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 37,1,0.908858,45528,1,0,91605,993,1460,93387,492,2637,275452
Formula is TRUE !

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

original formula: AG(EF(((i1.i0.u2.table_unload_angle>=1)&&(i1.i1.u5.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i0.u2.table_unload_angle>=1)&&(i1.i1.u5.TU_rot_run>=1)))))] = FALSE
(forward)formula 38,1,0.94668,47640,1,0,96524,993,1466,97650,492,2637,289942
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 39,1,0.970339,48696,1,0,98904,993,1469,100179,492,2637,296910
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.belt2_light_barrier_false>=1)&&(i2.u6.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_false>=1)&&(i2.u6.DB_deliver_run>=1)))))] = FALSE
(forward)formula 40,1,0.993582,49488,1,0,101162,993,1475,102633,492,2637,303790
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u8.belt1_light_barrier_true>=1)&&(i1.i2.u9.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.belt1_light_barrier_true>=1)&&(i1.i2.u9.FB_trans_run>=1)))))] = FALSE
(forward)formula 41,1,1.10352,51864,1,0,106380,993,1483,107292,492,2637,319091
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u8.belt1_light_barrier_false>=1)&&(i1.i2.u8.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.belt1_light_barrier_false>=1)&&(i1.i2.u8.FB_deliver_run>=1)))))] = FALSE
(forward)formula 42,1,1.13661,53712,1,0,110493,993,1493,111079,494,2637,333128
Formula is TRUE !

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

original formula: AG(EF(((u13.A2U_in>=1)&&(u10.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.A2U_in>=1)&&(u10.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 43,1,1.14072,53976,1,0,110764,993,1496,111417,494,2637,334330
Formula is TRUE !

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

original formula: AG(EF(((u13.A2U_in>=1)&&(u15.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.A2U_in>=1)&&(u15.arm1_release_angle>=1)))))] = FALSE
(forward)formula 44,1,1.14471,54240,1,0,110993,993,1498,111730,494,2637,335226
Formula is TRUE !

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

original formula: AG(EF(((u13.A2U_in>=1)&&(u11.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.A2U_in>=1)&&(u11.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 45,1,1.15016,54240,1,0,111296,993,1500,112227,494,2637,336470
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u13.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u13.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 46,1,1.15471,54504,1,0,111584,993,1504,112656,495,2639,337706
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u13.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u13.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 47,1,1.16056,54504,1,0,111858,993,1508,113025,496,2639,338812
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u13.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u13.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 48,1,1.1673,54768,1,0,112245,993,1512,113674,498,2639,340022
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_release_ext>=1)&&(u13.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_ext>=1)&&(u13.A2U_ext_run>=1)))))] = FALSE
(forward)formula 49,1,1.17382,55032,1,0,112515,993,1514,114205,498,2639,341186
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_retract_ext>=1)&&(u12.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext>=1)&&(u12.A2U_ret_run>=1)))))] = FALSE
(forward)formula 50,1,1.18312,55296,1,0,113083,993,1516,115032,498,2639,343351
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u11.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u11.A2L_in>=1)))))] = FALSE
(forward)formula 51,1,1.18988,55560,1,0,113498,993,1519,115533,498,2639,345163
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u11.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u11.A2L_in>=1)))))] = FALSE
(forward)formula 52,1,1.19416,55824,1,0,113776,993,1521,115851,498,2644,346329
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u11.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u11.A2L_in>=1)))))] = FALSE
(forward)formula 53,1,1.20032,56088,1,0,114163,993,1523,116320,498,2644,347849
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 54,1,1.20663,56352,1,0,114551,993,1525,116805,498,2644,349529
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 55,1,1.21557,56616,1,0,115076,993,1527,117655,498,2648,351280
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 56,1,1.22295,56880,1,0,115497,993,1529,118242,498,2650,352974
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_ext>=1)&&(u11.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_ext>=1)&&(u11.A2L_ext_run>=1)))))] = FALSE
(forward)formula 57,1,1.23196,57144,1,0,115943,993,1531,119003,498,2650,354902
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_retract_ext>=1)&&(u12.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext>=1)&&(u12.A2L_ret_run>=1)))))] = FALSE
(forward)formula 58,1,1.24241,57672,1,0,116573,993,1533,119959,498,2650,357203
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 59,1,1.2467,57936,1,0,116775,993,1536,120165,498,2650,358610
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 60,1,1.25377,58200,1,0,117145,993,1538,120664,498,2650,360791
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 61,1,1.26218,58464,1,0,117719,993,1540,121371,498,2650,363092
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 62,1,1.2693,58728,1,0,118057,993,1544,121900,500,2650,365136
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 63,1,1.27586,58992,1,0,118384,993,1546,122360,500,2650,367126
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 64,1,1.28468,59256,1,0,118941,993,1550,123137,502,2650,369264
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 65,1,1.29405,59520,1,0,119475,993,1552,123930,502,2650,371587
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 66,1,1.3044,60048,1,0,120169,993,1556,124823,504,2650,374307
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 67,1,1.30742,60312,1,0,120299,993,1559,125024,504,2650,374838
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 68,1,1.31043,60312,1,0,120433,993,1561,125219,504,2650,375382
Formula is TRUE !

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

original formula: AG(EF(((u13.arm2_release_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 69,1,1.31313,60312,1,0,120550,993,1563,125385,504,2650,375878
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u15.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u15.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 70,1,1.31653,60576,1,0,120767,993,1565,125740,504,2659,376402
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u15.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u15.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 71,1,1.32007,60576,1,0,120931,993,1567,126042,504,2663,376926
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u15.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u15.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 72,1,1.3233,60576,1,0,121121,993,1569,126316,504,2666,377448
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_release_ext>=1)&&(u15.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_release_ext>=1)&&(u15.A1U_ext_run>=1)))))] = FALSE
(forward)formula 73,1,1.32708,60840,1,0,121237,993,1571,126605,504,2666,378040
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 74,1,1.33376,60840,1,0,121720,993,1573,127182,504,2666,379817
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 75,1,1.37314,62688,1,0,126274,993,1577,131255,504,2666,392442
Formula is TRUE !

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

original formula: AG(EF(((i9.u17.crane_above_deposit_belt>=1)&&(i9.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_above_deposit_belt>=1)&&(i9.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 76,1,1.41582,64800,1,0,131127,993,1581,135508,504,2666,406301
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_release_height>=1)&&(i9.u18.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_release_height>=1)&&(i9.u18.CU_lower_run>=1)))))] = FALSE
(forward)formula 77,1,1.50265,67968,1,0,136268,993,1585,140091,504,2666,420726
Formula is TRUE !

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

original formula: AG(EF(((i9.u19.crane_pick_up_height>=1)&&(i9.u19.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u19.crane_pick_up_height>=1)&&(i9.u19.CL_lower_run>=1)))))] = FALSE
(forward)formula 78,1,1.53552,69024,1,0,140081,999,1589,143714,504,2682,431366
Formula is TRUE !

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

original formula: AG(EF(((i9.u17.crane_above_feed_belt>=1)&&(i9.u17.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_above_feed_belt>=1)&&(i9.u17.CL_trans_run>=1)))))] = FALSE
(forward)formula 79,1,1.56413,70080,1,0,143463,999,1593,147009,504,2682,441271
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u19.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u19.CL_lift_run>=1)))))] = FALSE
(forward)formula 80,1,1.59102,71136,1,0,146568,999,1597,150033,504,2683,450128
Formula is TRUE !

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

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

BK_STOP 1620948001741

--------------------
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-2"
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-2, 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-162089138000239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 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 ;