Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 9.3K Apr 29 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K May 10 09:34 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 1652865538032

Running Version 202205111006
[2022-05-18 09:18:59] [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]
[2022-05-18 09:18:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 09:19:00] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2022-05-18 09:19:00] [INFO ] Transformed 231 places.
[2022-05-18 09:19:00] [INFO ] Transformed 202 transitions.
[2022-05-18 09:19:00] [INFO ] Found NUPN structural information;
[2022-05-18 09:19:00] [INFO ] Parsed PT model containing 231 places and 202 transitions in 366 ms.
Built sparse matrix representations for Structural reductions in 9 ms.13957KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 32 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 in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 19 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:19:00] [INFO ] Computed 59 place invariants in 24 ms
[2022-05-18 09:19:00] [INFO ] Implicit Places using invariants in 470 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:19:00] [INFO ] Computed 59 place invariants in 11 ms
[2022-05-18 09:19:01] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:19:01] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2022-05-18 09:19:01] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:19:01] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-18 09:19:01] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2344 ms (no deadlock found). (steps per millisecond=533 )
Random directed walk for 1250000 steps, including 0 resets, run took 1695 ms (no deadlock found). (steps per millisecond=737 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:19:05] [INFO ] Computed 59 place invariants in 14 ms
[2022-05-18 09:19:05] [INFO ] [Real]Absence check using 35 positive place invariants in 49 ms returned sat
[2022-05-18 09:19:06] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 106 ms returned sat
[2022-05-18 09:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:19:07] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2022-05-18 09:19:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:19:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2022-05-18 09:19:07] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 52 ms returned sat
[2022-05-18 09:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:19:08] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2022-05-18 09:19:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:19:08] [INFO ] [Nat]Added 68 Read/Feed constraints in 146 ms returned sat
[2022-05-18 09:19:08] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 4 ms to minimize.
[2022-05-18 09:19:09] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2022-05-18 09:19:09] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2022-05-18 09:19:09] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2022-05-18 09:19:09] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2022-05-18 09:19:09] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2022-05-18 09:19:09] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 0 ms to minimize.
[2022-05-18 09:19:09] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 10 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2022-05-18 09:19:10] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2022-05-18 09:19:11] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2022-05-18 09:19:11] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2022-05-18 09:19:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2390 ms
[2022-05-18 09:19:11] [INFO ] Computed and/alt/rep : 194/512/194 causal constraints (skipped 5 transitions) in 18 ms.
[2022-05-18 09:19:12] [INFO ] Added : 166 causal constraints over 34 iterations in 1142 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Parikh directed walk for 47500 steps, including 281 resets, run took 131 ms. (steps per millisecond=362 )
Random directed walk for 500002 steps, including 0 resets, run took 653 ms (no deadlock found). (steps per millisecond=765 )
Random walk for 500000 steps, including 0 resets, run took 794 ms (no deadlock found). (steps per millisecond=629 )
Random directed walk for 500001 steps, including 0 resets, run took 614 ms (no deadlock found). (steps per millisecond=814 )
Random walk for 500000 steps, including 0 resets, run took 784 ms (no deadlock found). (steps per millisecond=637 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable 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
[2022-05-18 09:19:15] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-18 09:19:15] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:19:15] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-18 09:19:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:19:15] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2022-05-18 09:19:15] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:19:15] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-18 09:19:16] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1990 ms (no deadlock found). (steps per millisecond=628 )
Random directed walk for 1250003 steps, including 0 resets, run took 1555 ms (no deadlock found). (steps per millisecond=803 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:19:19] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-18 09:19:19] [INFO ] [Real]Absence check using 35 positive place invariants in 48 ms returned sat
[2022-05-18 09:19:19] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 102 ms returned sat
[2022-05-18 09:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:19:21] [INFO ] [Real]Absence check using state equation in 1444 ms returned sat
[2022-05-18 09:19:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:19:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-05-18 09:19:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2022-05-18 09:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:19:22] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2022-05-18 09:19:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:19:22] [INFO ] [Nat]Added 68 Read/Feed constraints in 148 ms returned sat
[2022-05-18 09:19:22] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2022-05-18 09:19:22] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2022-05-18 09:19:22] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2022-05-18 09:19:23] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2022-05-18 09:19:24] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-18 09:19:24] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-05-18 09:19:24] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2022-05-18 09:19:24] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-05-18 09:19:24] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2022-05-18 09:19:24] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2022-05-18 09:19:24] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2043 ms
[2022-05-18 09:19:24] [INFO ] Computed and/alt/rep : 194/512/194 causal constraints (skipped 5 transitions) in 18 ms.
[2022-05-18 09:19:25] [INFO ] Added : 166 causal constraints over 34 iterations in 1128 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Parikh directed walk for 47500 steps, including 281 resets, run took 128 ms. (steps per millisecond=371 )
Random directed walk for 500002 steps, including 0 resets, run took 687 ms (no deadlock found). (steps per millisecond=727 )
Random walk for 500000 steps, including 0 resets, run took 800 ms (no deadlock found). (steps per millisecond=625 )
Random directed walk for 500000 steps, including 0 resets, run took 626 ms (no deadlock found). (steps per millisecond=798 )
Random walk for 500000 steps, including 0 resets, run took 789 ms (no deadlock found). (steps per millisecond=633 )
[2022-05-18 09:19:29] [INFO ] Flatten gal took : 92 ms
Starting structural reductions in LIVENESS mode, 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 58 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2022-05-18 09:19:29] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-18 09:19:29] [INFO ] Implicit Places using invariants in 290 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 293 ms to find 39 implicit places.
Starting structural reductions in LIVENESS mode, 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 42 place count 133 transition count 138
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 128 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 126 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 126 transition count 136
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 138 place count 85 transition count 95
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 140 place count 84 transition count 94
Applied a total of 140 rules in 23 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2022-05-18 09:19:29] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 09:19:29] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-18 09:19:29] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-18 09:19:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-18 09:19:29] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 84/231 places, 94/202 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
Initial state reduction rules removed 2 formulas.
Finished random walk after 1251 steps, including 0 resets, run visited all 92 properties in 164 ms. (steps per millisecond=7 )
Able to resolve query QuasiLiveness after proving 94 properties.
Starting structural reductions in LIVENESS mode, 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 23 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2022-05-18 09:19:30] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-18 09:19:30] [INFO ] Implicit Places using invariants in 241 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 245 ms to find 39 implicit places.
Starting structural reductions in LIVENESS mode, 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 42 place count 133 transition count 138
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 128 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 126 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 126 transition count 136
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 138 place count 85 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 18 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2022-05-18 09:19:30] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 09:19:30] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-18 09:19:30] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-18 09:19:30] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-18 09:19:30] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 84/231 places, 94/202 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2022-05-18 09:19:30] [INFO ] Flatten gal took : 16 ms
[2022-05-18 09:19:30] [INFO ] Flatten gal took : 14 ms
[2022-05-18 09:19:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8664604499265858802.gal : 10 ms
[2022-05-18 09:19:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2141226005120311170.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8664604499265858802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2141226005120311170.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,36112,0.086958,6924,2,1815,5,9797,6,0,433,8324,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, crane_lock_output...1684
(forward)formula 0,1,1.09244,38024,1,0,227,208613,209,129,2654,132147,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.47223,50924,1,0,279,283879,210,162,2654,187806,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.93107,60956,1,0,331,361550,211,196,2654,246464,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,2.42361,73628,1,0,383,455807,212,230,2654,314132,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,2.58137,78908,1,0,437,492637,213,264,2654,342658,625
Formula is TRUE !

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

original formula: AG(EF(((table_bottom_pos>=1)&&(TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_bottom_pos>=1)&&(TL_lower_run>=1)))))] = FALSE
(forward)formula 5,1,2.59453,79172,1,0,491,494089,214,297,2654,345708,711
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 6,1,2.59839,79436,1,0,545,494181,215,331,2654,346054,797
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 7,1,2.6374,80492,1,0,599,502319,216,364,2654,353116,883
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 8,1,2.65928,81020,1,0,653,506091,217,398,2654,356252,969
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 9,1,2.67767,81548,1,0,707,509008,218,432,2654,359204,1055
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-18 09:19:33] [INFO ] Flatten gal took : 11 ms
[2022-05-18 09:19:33] [INFO ] Applying decomposition
[2022-05-18 09:19:33] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5515712700611980832.txt' '-o' '/tmp/graph5515712700611980832.bin' '-w' '/tmp/graph5515712700611980832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5515712700611980832.bin' '-l' '-1' '-v' '-w' '/tmp/graph5515712700611980832.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:19:34] [INFO ] Decomposing Gal with order
[2022-05-18 09:19:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:19:34] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-18 09:19:34] [INFO ] Flatten gal took : 66 ms
[2022-05-18 09:19:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-18 09:19:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9935161002998680174.gal : 8 ms
[2022-05-18 09:19:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9050571213538354674.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9935161002998680174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9050571213538354674.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 84 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,36112,0.091441,6300,331,114,3109,401,329,2845,104,1152,0


Converting to forward existential form...Done !
original formula: AG(EF(((i0.u7.belt2_light_barrier_false>=1)&&(i0.u0.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u7.belt2_light_barrier_false>=1)&&(i0.u0.DB_trans_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, A2L_ret_Cstop_A2L_r...1772
(forward)formula 0,1,0.322862,12488,1,0,18614,983,1210,17858,494,2436,43404
Formula is TRUE !

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

original formula: AG(EF(((i0.u7.belt2_light_barrier_true>=1)&&(i0.u7.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u7.belt2_light_barrier_true>=1)&&(i0.u7.DB_deliver_run>=1)))))] = FALSE
(forward)formula 1,1,0.426081,15128,1,0,25413,984,1219,24660,495,2441,61898
Formula is TRUE !

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

original formula: AG(EF(((i2.u8.belt1_light_barrier_false>=1)&&(i2.u8.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.belt1_light_barrier_false>=1)&&(i2.u8.FB_trans_run>=1)))))] = FALSE
(forward)formula 2,1,0.545537,19616,1,0,36938,993,1229,34491,497,2494,90311
Formula is TRUE !

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

original formula: AG(EF(((i2.u8.belt1_light_barrier_true>=1)&&(i2.u8.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.belt1_light_barrier_true>=1)&&(i2.u8.FB_deliver_run>=1)))))] = FALSE
(forward)formula 3,1,0.636101,23312,1,0,45898,999,1239,41949,499,2498,114350
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_pick_up_angle>=1)&&(u9.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_pick_up_angle>=1)&&(u9.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 4,1,0.739798,26744,1,0,54619,1027,1242,49674,499,2572,136616
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_release_angle>=1)&&(u9.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_release_angle>=1)&&(u9.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 5,1,0.805106,28856,1,0,59342,1038,1245,54127,499,2594,149583
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u9.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u9.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 6,1,0.83662,30176,1,0,62078,1044,1249,57076,499,2622,157441
Formula is TRUE !

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

original formula: AG(EF(((i0.u11.arm2_retract_ext>=1)&&(u9.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u11.arm2_retract_ext>=1)&&(u9.A2U_ext_run>=1)))))] = FALSE
(forward)formula 7,1,0.857706,30704,1,0,63457,1044,1252,58980,499,2622,161497
Formula is TRUE !

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

original formula: AG(EF(((i0.u11.arm2_release_ext>=1)&&(i0.u11.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u11.arm2_release_ext>=1)&&(i0.u11.A2U_ret_run>=1)))))] = FALSE
(forward)formula 8,1,0.874946,31496,1,0,64369,1044,1261,60239,501,2622,164511
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 9,1,0.928933,33608,1,0,69772,1044,1264,65383,501,2623,178780
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_release_angle>=1)&&(u10.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_release_angle>=1)&&(u10.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 10,1,0.966284,35192,1,0,73017,1044,1267,68884,501,2629,187738
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u10.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u10.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 11,1,0.982351,35720,1,0,73866,1044,1270,70081,501,2629,190869
Formula is TRUE !

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

original formula: AG(EF(((i0.u11.arm2_retract_ext>=1)&&(u10.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u11.arm2_retract_ext>=1)&&(u10.A2L_ext_run>=1)))))] = FALSE
(forward)formula 12,1,1.00258,36248,1,0,75137,1051,1272,71870,501,2644,194545
Formula is TRUE !

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

original formula: AG(EF(((i0.u11.arm2_pick_up_ext>=1)&&(i0.u11.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u11.arm2_pick_up_ext>=1)&&(i0.u11.A2L_ret_run>=1)))))] = FALSE
(forward)formula 13,1,1.02377,36776,1,0,76007,1051,1280,73154,503,2644,197528
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_release_angle>=1)&&(u13.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_release_angle>=1)&&(u13.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 14,1,1.06851,38624,1,0,79874,1051,1283,76866,503,2644,208788
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u13.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u13.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 15,1,1.12452,40208,1,0,83055,1051,1286,80028,503,2648,218258
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u13.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u13.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 16,1,1.15796,41528,1,0,86594,1051,1289,83411,503,2648,227874
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u13.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u13.A1L_ext_run>=1)))))] = FALSE
(forward)formula 17,1,1.17999,42320,1,0,88038,1053,1291,85288,503,2649,232125
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_pick_up_ext>=1)&&(u12.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_ext>=1)&&(u12.A1L_ret_run>=1)))))] = FALSE
(forward)formula 18,1,1.19204,42584,1,0,88625,1057,1293,86127,503,2650,234539
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_pick_up_angle>=1)&&(u14.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_pick_up_angle>=1)&&(u14.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 19,1,1.21335,43376,1,0,90157,1057,1296,88065,503,2659,239179
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u14.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u14.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 20,1,1.23713,44432,1,0,91974,1057,1299,90270,503,2663,244690
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_angle>=1)&&(u14.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_angle>=1)&&(u14.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 21,1,1.26833,45488,1,0,94504,1057,1302,93212,503,2665,252330
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u14.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u14.A1U_ext_run>=1)))))] = FALSE
(forward)formula 22,1,1.28519,46280,1,0,95589,1076,1304,94702,503,2683,255571
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_release_ext>=1)&&(u12.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_ext>=1)&&(u12.A1U_ret_run>=1)))))] = FALSE
(forward)formula 23,1,1.2939,46544,1,0,96061,1079,1309,95308,505,2684,257383
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_release_height>=1)&&(i8.u17.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_release_height>=1)&&(i8.u17.CU_lift_run>=1)))))] = FALSE
(forward)formula 24,1,1.46817,51032,1,0,107258,1081,1320,104863,506,2697,285749
Formula is TRUE !

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

original formula: AG(EF(((i8.u15.crane_above_feed_belt>=1)&&(i8.u17.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_above_feed_belt>=1)&&(i8.u17.CU_trans_run>=1)))))] = FALSE
(forward)formula 25,1,1.55816,54992,1,0,117919,1091,1325,114014,506,2714,312560
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_transport_height>=1)&&(i8.u16.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_transport_height>=1)&&(i8.u16.CU_lower_run>=1)))))] = FALSE
(forward)formula 26,1,1.65861,59480,1,0,129421,1091,1331,123809,506,2715,341020
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_transport_height>=1)&&(i8.u18.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_transport_height>=1)&&(i8.u18.CL_lower_run>=1)))))] = FALSE
(forward)formula 27,1,1.76648,63704,1,0,140232,1092,1336,133137,506,2715,367549
Formula is TRUE !

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

original formula: AG(EF(((i8.u15.crane_above_deposit_belt>=1)&&(i8.u17.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_above_deposit_belt>=1)&&(i8.u17.CL_trans_run>=1)))))] = FALSE
(forward)formula 28,1,1.86106,67664,1,0,150168,1102,1341,141844,506,2732,392359
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_pick_up_height>=1)&&(i8.u17.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_pick_up_height>=1)&&(i8.u17.CL_lift_run>=1)))))] = FALSE
(forward)formula 29,1,1.96538,71888,1,0,160371,1105,1347,150888,506,2736,418798
Formula is TRUE !

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

original formula: AG(EF(((i0.u0.ch_DC_free>=1)&&(i0.u0.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.ch_DC_free>=1)&&(i0.u0.ch_A2D_full>=1)))))] = FALSE
(forward)formula 30,1,2.06907,74792,1,0,166249,1105,1356,156446,507,2736,434703
Formula is TRUE !

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

original formula: AG(EF((((i0.u7.ch_A2D_free>=1)&&(u12.swivel>=1))&&(i0.u11.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u7.ch_A2D_free>=1)&&(u12.swivel>=1))&&(i0.u11.arm2_storing>=1)))))] = FALSE
(forward)formula 31,1,2.08367,75056,1,0,167072,1105,1367,157436,507,2736,437723
Formula is TRUE !

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

original formula: AG(EF((((i1.u2.ch_A1P_free>=1)&&(u12.swivel>=1))&&(u12.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i1.u2.ch_A1P_free>=1)&&(u12.swivel>=1))&&(u12.arm1_storing>=1)))))] = FALSE
(forward)formula 32,1,2.09205,75320,1,0,167440,1105,1377,157982,509,2736,439210
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.ch_CF_free>=1)&&(i8.u16.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.ch_CF_free>=1)&&(i8.u16.crane_storing>=1)))))] = FALSE
(forward)formula 33,1,2.1848,79280,1,0,178006,1105,1385,166809,510,2736,465267
Formula is TRUE !

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

original formula: AG(EF(((i8.u18.ch_DC_full>=1)&&(i8.u18.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u18.ch_DC_full>=1)&&(i8.u18.crane_store_free>=1)))))] = FALSE
(forward)formula 34,1,2.28504,82976,1,0,187761,1105,1391,175090,510,2736,489318
Formula is TRUE !

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

original formula: AG(EF((((u12.swivel>=1)&&(i2.u6.TU_lift_rs>=1))&&(u12.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u12.swivel>=1)&&(i2.u6.TU_lift_rs>=1))&&(u12.arm1_store_free>=1)))))] = FALSE
(forward)formula 35,1,2.29854,83504,1,0,188529,1105,1398,176005,510,2736,491942
Formula is TRUE !

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

original formula: AG(EF(((i2.u8.ch_CF_full>=1)&&(i2.u5.TL_lower_rs>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.ch_CF_full>=1)&&(i2.u5.TL_lower_rs>=1)))))] = FALSE
(forward)formula 36,1,2.38292,86936,1,0,197405,1105,1404,183241,510,2736,514401
Formula is TRUE !

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

original formula: AG(EF((((u12.swivel>=1)&&(i1.u1.PU_lower_rs>=1))&&(i0.u11.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u12.swivel>=1)&&(i1.u1.PU_lower_rs>=1))&&(i0.u11.arm2_store_free>=1)))))] = FA...158
(forward)formula 37,1,2.39506,87464,1,0,198052,1105,1411,184093,510,2736,516936
Formula is TRUE !

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

original formula: AG(EF(((i1.u1.press_at_upper_pos>=1)&&(i1.u1.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u1.press_at_upper_pos>=1)&&(i1.u1.forge_run>=1)))))] = FALSE
(forward)formula 38,1,2.42414,88520,1,0,200395,1106,1419,186534,510,2742,523108
Formula is TRUE !

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

original formula: AG(EF(((i1.u2.press_at_middle_pos>=1)&&(i1.u2.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.press_at_middle_pos>=1)&&(i1.u2.PL_lower_run>=1)))))] = FALSE
(forward)formula 39,1,2.45074,89312,1,0,202398,1106,1425,188809,510,2742,528635
Formula is TRUE !

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

original formula: AG(EF(((i2.u3.table_load_angle>=1)&&(i2.u5.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u3.table_load_angle>=1)&&(i2.u5.TL_rot_run>=1)))))] = FALSE
(forward)formula 40,1,2.52199,92216,1,0,209199,1106,1431,194644,510,2742,546018
Formula is TRUE !

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

original formula: AG(EF(((i2.u3.table_unload_angle>=1)&&(i2.u6.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u3.table_unload_angle>=1)&&(i2.u6.TU_rot_run>=1)))))] = FALSE
(forward)formula 41,1,2.68205,95648,1,0,217490,1106,1437,201328,510,2742,567819
Formula is TRUE !

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

original formula: AG(EF(((i0.u7.belt2_light_barrier_true>=1)&&(i0.u0.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u7.belt2_light_barrier_true>=1)&&(i0.u0.DB_trans_run>=1)))))] = FALSE
(forward)formula 42,1,2.75598,98288,1,0,224279,1106,1441,208068,510,2742,586319
Formula is TRUE !

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

original formula: AG(EF(((i0.u7.belt2_light_barrier_false>=1)&&(i0.u7.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u7.belt2_light_barrier_false>=1)&&(i0.u7.DB_deliver_run>=1)))))] = FALSE
(forward)formula 43,1,2.87775,101192,1,0,230826,1106,1445,214231,510,2742,604396
Formula is TRUE !

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

original formula: AG(EF(((i2.u8.belt1_light_barrier_true>=1)&&(i2.u8.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.belt1_light_barrier_true>=1)&&(i2.u8.FB_trans_run>=1)))))] = FALSE
(forward)formula 44,1,2.96193,104624,1,0,239555,1112,1451,221353,511,2786,628704
Formula is TRUE !

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

original formula: AG(EF(((u9.A2U_in>=1)&&(u13.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.A2U_in>=1)&&(u13.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 45,1,2.97276,105152,1,0,240091,1112,1454,222055,511,2786,630778
Formula is TRUE !

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

original formula: AG(EF(((u9.A2U_in>=1)&&(u14.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.A2U_in>=1)&&(u14.arm1_release_angle>=1)))))] = FALSE
(forward)formula 46,1,2.98001,105416,1,0,240495,1112,1456,222505,511,2789,632296
Formula is TRUE !

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

original formula: AG(EF(((u9.A2U_in>=1)&&(u10.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.A2U_in>=1)&&(u10.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 47,1,2.99168,105680,1,0,241048,1112,1458,223310,511,2789,634511
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-18 09:19:37] [INFO ] Flatten gal took : 12 ms
[2022-05-18 09:19:37] [INFO ] Flatten gal took : 9 ms
[2022-05-18 09:19:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11718155138879116844.gal : 3 ms
[2022-05-18 09:19:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12758203218352971294.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11718155138879116844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12758203218352971294.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 36 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,36112,0.085036,6912,2,1815,5,9797,6,0,433,8324,0


Converting to forward existential form...Done !
original formula: AG(EF(((arm2_release_angle>=1)&&(A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2U_rot1_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, crane_lock_output...1684
(forward)formula 0,1,1.34162,42828,1,0,263,237972,209,145,2653,155863,321
Formula is TRUE !

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

original formula: AG(EF(((arm2_release_angle>=1)&&(A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2U_rot2_run>=1)))))] = FALSE
(forward)formula 1,1,1.78855,55012,1,0,326,307565,210,182,2653,206917,417
Formula is TRUE !

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

original formula: AG(EF(((arm2_release_angle>=1)&&(A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2U_rot3_run>=1)))))] = FALSE
(forward)formula 2,1,2.24498,66100,1,0,381,393330,211,214,2653,274133,498
Formula is TRUE !

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

original formula: AG(EF(((arm2_release_ext>=1)&&(A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_ext>=1)&&(A2U_ext_run>=1)))))] = FALSE
(forward)formula 3,1,2.79426,78508,1,0,438,480393,212,247,2653,340601,584
Formula is TRUE !

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

original formula: AG(EF(((arm2_retract_ext>=1)&&(A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext>=1)&&(A2U_ret_run>=1)))))] = FALSE
(forward)formula 4,1,3.15898,90132,1,0,492,544342,213,278,2653,394326,665
Formula is TRUE !

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

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A2L_in>=1)))))] = FALSE
(forward)formula 5,1,3.90926,107292,1,0,578,657482,214,331,2653,479445,801
Formula is TRUE !

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

original formula: AG(EF(((arm1_release_angle>=1)&&(A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A2L_in>=1)))))] = FALSE
(forward)formula 6,1,4.78992,124120,1,0,649,773648,215,374,2653,567499,912
Formula is TRUE !

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

original formula: AG(EF(((arm2_release_angle>=1)&&(A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2L_in>=1)))))] = FALSE
(forward)formula 7,1,5.55069,135736,1,0,709,856411,216,410,2653,631109,1003
Formula is TRUE !

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

original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2L_rot1_run>=1)))))] = FALSE
(forward)formula 8,1,5.75403,141544,1,0,765,896287,217,443,2653,663590,1089
Formula is TRUE !

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

original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2L_rot2_run>=1)))))] = FALSE
(forward)formula 9,1,6.17467,153424,1,0,821,979549,218,476,2653,728923,1175
Formula is TRUE !

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

original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2L_rot3_run>=1)))))] = FALSE
(forward)formula 10,1,6.54752,163720,1,0,877,1.04799e+06,219,509,2653,782908,1261
Formula is TRUE !

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

original formula: AG(EF(((arm2_pick_up_ext>=1)&&(A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_ext>=1)&&(A2L_ext_run>=1)))))] = FALSE
(forward)formula 11,1,7.29224,179172,1,0,933,1.14069e+06,220,542,2653,852777,1347
Formula is TRUE !

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

original formula: AG(EF(((arm2_retract_ext>=1)&&(A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext>=1)&&(A2L_ret_run>=1)))))] = FALSE
(forward)formula 12,1,7.63103,188676,1,0,987,1.20609e+06,221,574,2653,908024,1428
Formula is TRUE !

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

original formula: AG(EF(((arm1_release_angle>=1)&&(A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A1L_in>=1)))))] = FALSE
(forward)formula 13,1,8.13734,204976,1,0,1076,1.301e+06,222,623,2653,980775,1554
Formula is TRUE !

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

original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A1L_in>=1)))))] = FALSE
(forward)formula 14,1,8.47478,213952,1,0,1148,1.36042e+06,223,664,2653,1.02647e+06,1660
Formula is TRUE !

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

original formula: AG(EF(((arm2_release_angle>=1)&&(A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A1L_in>=1)))))] = FALSE
(forward)formula 15,1,9.33388,228404,1,0,1214,1.44781e+06,224,701,2653,1.09279e+06,1756
Formula is TRUE !

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

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A1L_rot1_run>=1)))))] = FALSE
(forward)formula 16,1,9.43618,230516,1,0,1273,1.46499e+06,225,732,2653,1.10747e+06,1840
Formula is TRUE !

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

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A1L_rot2_run>=1)))))] = FALSE
(forward)formula 17,1,9.53865,232892,1,0,1333,1.48337e+06,226,765,2653,1.12237e+06,1926
Formula is TRUE !

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

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A1L_rot3_run>=1)))))] = FALSE
(forward)formula 18,1,9.70578,237116,1,0,1393,1.51417e+06,227,798,2653,1.14726e+06,2012
Formula is TRUE !

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

original formula: AG(EF(((arm1_pick_up_ext>=1)&&(A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_ext>=1)&&(A1L_ext_run>=1)))))] = FALSE
(forward)formula 19,1,9.97103,245496,1,0,1458,1.56472e+06,228,831,2653,1.18617e+06,2098
Formula is TRUE !

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

original formula: AG(EF(((arm1_retract_ext>=1)&&(A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_retract_ext>=1)&&(A1L_ret_run>=1)))))] = FALSE
(forward)formula 20,1,10.0769,247872,1,0,1516,1.58308e+06,229,861,2653,1.20154e+06,2178
Formula is TRUE !

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

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A1U_in>=1)))))] = FALSE
(forward)formula 21,1,10.5369,258168,1,0,1584,1.66725e+06,230,902,2653,1.26693e+06,2284
Formula is TRUE !

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

original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A1U_in>=1)))))] = FALSE
(forward)formula 22,1,11.338,266616,1,0,1658,1.71966e+06,231,947,2653,1.30734e+06,2400
Formula is TRUE !

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

original formula: AG(EF(((arm2_release_angle>=1)&&(A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A1U_in>=1)))))] = FALSE
(forward)formula 23,1,11.7242,280012,1,0,1723,1.80319e+06,232,986,2653,1.37142e+06,2501
Formula is TRUE !

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

original formula: AG(EF(((arm1_release_angle>=1)&&(A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A1U_rot1_run>=1)))))] = FALSE
(forward)formula 24,1,12.0593,289516,1,0,1779,1.87074e+06,233,1019,2653,1.42634e+06,2587
Formula is TRUE !

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

original formula: AG(EF(((arm1_release_angle>=1)&&(A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A1U_rot2_run>=1)))))] = FALSE
(forward)formula 25,1,12.2641,295324,1,0,1835,1.91045e+06,234,1052,2653,1.45859e+06,2673
Formula is TRUE !

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

original formula: AG(EF(((arm1_release_angle>=1)&&(A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A1U_rot3_run>=1)))))] = FALSE
(forward)formula 26,1,12.6253,305620,1,0,1891,1.98092e+06,235,1085,2653,1.5143e+06,2759
Formula is TRUE !

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

original formula: AG(EF(((arm1_release_ext>=1)&&(A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_ext>=1)&&(A1U_ext_run>=1)))))] = FALSE
(forward)formula 27,1,13.0591,317500,1,0,1947,2.06548e+06,236,1118,2653,1.57916e+06,2845
Formula is TRUE !

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

original formula: AG(EF(((arm1_retract_ext>=1)&&(A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_retract_ext>=1)&&(A1U_ret_run>=1)))))] = FALSE
(forward)formula 28,1,13.4054,328304,1,0,2001,2.12647e+06,237,1150,2653,1.63099e+06,2926
Formula is TRUE !

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

original formula: AG(EF(((crane_transport_height>=1)&&(CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_transport_height>=1)&&(CU_lift_run>=1)))))] = FALSE
(forward)formula 29,1,13.5353,331472,1,0,2054,2.15089e+06,238,1182,2653,1.65024e+06,3008
Formula is TRUE !

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

original formula: AG(EF(((crane_above_deposit_belt>=1)&&(CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_above_deposit_belt>=1)&&(CU_trans_run>=1)))))] = FALSE
(forward)formula 30,1,13.5666,332264,1,0,2108,2.15513e+06,239,1215,2653,1.65538e+06,3094
Formula is TRUE !

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

original formula: AG(EF(((crane_release_height>=1)&&(CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_release_height>=1)&&(CU_lower_run>=1)))))] = FALSE
(forward)formula 31,1,13.6187,333320,1,0,2162,2.16288e+06,240,1248,2653,1.66283e+06,3180
Formula is TRUE !

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

original formula: AG(EF(((crane_pick_up_height>=1)&&(CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_pick_up_height>=1)&&(CL_lower_run>=1)))))] = FALSE
(forward)formula 32,1,14.3209,340448,1,0,2215,2.20593e+06,241,1281,2653,1.69602e+06,3266
Formula is TRUE !

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

original formula: AG(EF(((crane_above_feed_belt>=1)&&(CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_above_feed_belt>=1)&&(CL_trans_run>=1)))))] = FALSE
(forward)formula 33,1,14.3762,341768,1,0,2268,2.21599e+06,242,1314,2653,1.70579e+06,3352
Formula is TRUE !

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

original formula: AG(EF(((crane_transport_height>=1)&&(CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_transport_height>=1)&&(CL_lift_run>=1)))))] = FALSE
(forward)formula 34,1,14.4272,342824,1,0,2320,2.22534e+06,243,1346,2653,1.71426e+06,3434
Formula is TRUE !

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

original formula: AG(EF(((belt1_light_barrier_false>=1)&&(FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_false>=1)&&(FB_deliver_run>=1)))))] = FALSE
(forward)formula 35,1,14.5024,344936,1,0,2375,2.24063e+06,244,1378,2653,1.72659e+06,3516
Formula is TRUE !

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

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

BK_STOP 1652865591950

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-3"
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-3, 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 r157-smll-165277001700174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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