fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r157-smll-165277001700169
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
500.539 35806.00 51340.00 321.90 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r157-smll-165277001700169.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-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-165277001700169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 9.0K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.0K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K 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 1652865424004

Running Version 202205111006
[2022-05-18 09:17:05] [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:17:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 09:17:06] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2022-05-18 09:17:06] [INFO ] Transformed 231 places.
[2022-05-18 09:17:06] [INFO ] Transformed 202 transitions.
[2022-05-18 09:17:06] [INFO ] Found NUPN structural information;
[2022-05-18 09:17:06] [INFO ] Parsed PT model containing 231 places and 202 transitions in 359 ms.
Built sparse matrix representations for Structural reductions in 9 ms.13340KB 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 34 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 20 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:17:06] [INFO ] Computed 59 place invariants in 30 ms
[2022-05-18 09:17:06] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:17:06] [INFO ] Computed 59 place invariants in 15 ms
[2022-05-18 09:17:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:17:07] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2022-05-18 09:17:07] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:17:07] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-18 09:17:07] [INFO ] Dead Transitions using invariants and state equation in 295 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 2094 ms (no deadlock found). (steps per millisecond=596 )
Random directed walk for 1250000 steps, including 0 resets, run took 1565 ms (no deadlock found). (steps per millisecond=798 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:17:11] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-18 09:17:11] [INFO ] [Real]Absence check using 35 positive place invariants in 47 ms returned sat
[2022-05-18 09:17:11] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 160 ms returned sat
[2022-05-18 09:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:17:12] [INFO ] [Real]Absence check using state equation in 1095 ms returned sat
[2022-05-18 09:17:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:17:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2022-05-18 09:17:12] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 31 ms returned sat
[2022-05-18 09:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:17:13] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2022-05-18 09:17:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:17:13] [INFO ] [Nat]Added 68 Read/Feed constraints in 38 ms returned sat
[2022-05-18 09:17:13] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 3 ms to minimize.
[2022-05-18 09:17:13] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2022-05-18 09:17:13] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2022-05-18 09:17:14] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2022-05-18 09:17:14] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-05-18 09:17:14] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2022-05-18 09:17:14] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 0 ms to minimize.
[2022-05-18 09:17:14] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2022-05-18 09:17:14] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-05-18 09:17:14] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2022-05-18 09:17:14] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2022-05-18 09:17:15] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2022-05-18 09:17:15] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2022-05-18 09:17:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1665 ms
[2022-05-18 09:17:15] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 22 ms.
[2022-05-18 09:17:16] [INFO ] Added : 170 causal constraints over 34 iterations in 1171 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Parikh directed walk for 34700 steps, including 616 resets, run took 114 ms. (steps per millisecond=304 )
Random directed walk for 500000 steps, including 0 resets, run took 624 ms (no deadlock found). (steps per millisecond=801 )
Random walk for 500000 steps, including 0 resets, run took 798 ms (no deadlock found). (steps per millisecond=626 )
Random directed walk for 500002 steps, including 0 resets, run took 625 ms (no deadlock found). (steps per millisecond=800 )
Random walk for 500000 steps, including 0 resets, run took 781 ms (no deadlock found). (steps per millisecond=640 )
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 16 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:17:19] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-18 09:17:19] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:17:19] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-18 09:17:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:17:19] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-05-18 09:17:19] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:17:19] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-18 09:17:19] [INFO ] Dead Transitions using invariants and state equation in 269 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 1997 ms (no deadlock found). (steps per millisecond=625 )
Random directed walk for 1250002 steps, including 0 resets, run took 1559 ms (no deadlock found). (steps per millisecond=801 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:17:23] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-18 09:17:23] [INFO ] [Real]Absence check using 35 positive place invariants in 49 ms returned sat
[2022-05-18 09:17:23] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 163 ms returned sat
[2022-05-18 09:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:17:25] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2022-05-18 09:17:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:17:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2022-05-18 09:17:25] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 33 ms returned sat
[2022-05-18 09:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:17:26] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2022-05-18 09:17:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:17:26] [INFO ] [Nat]Added 68 Read/Feed constraints in 39 ms returned sat
[2022-05-18 09:17:26] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2022-05-18 09:17:26] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2022-05-18 09:17:26] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2022-05-18 09:17:26] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2022-05-18 09:17:26] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2022-05-18 09:17:26] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2022-05-18 09:17:26] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2022-05-18 09:17:26] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2022-05-18 09:17:27] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2022-05-18 09:17:27] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2022-05-18 09:17:27] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2022-05-18 09:17:27] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2022-05-18 09:17:27] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2022-05-18 09:17:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1458 ms
[2022-05-18 09:17:27] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 31 ms.
[2022-05-18 09:17:28] [INFO ] Added : 170 causal constraints over 34 iterations in 1352 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Parikh directed walk for 34700 steps, including 615 resets, run took 78 ms. (steps per millisecond=444 )
Random directed walk for 500000 steps, including 0 resets, run took 607 ms (no deadlock found). (steps per millisecond=823 )
Random walk for 500000 steps, including 0 resets, run took 908 ms (no deadlock found). (steps per millisecond=550 )
Random directed walk for 500000 steps, including 0 resets, run took 619 ms (no deadlock found). (steps per millisecond=807 )
Random walk for 500000 steps, including 0 resets, run took 777 ms (no deadlock found). (steps per millisecond=643 )
[2022-05-18 09:17:32] [INFO ] Flatten gal took : 82 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 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 63 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:17:32] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-18 09:17:32] [INFO ] Implicit Places using invariants in 316 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 321 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 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 25 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:17:32] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-18 09:17:32] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-18 09:17:32] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-18 09:17:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:17:33] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 341 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 521 steps, including 0 resets, run visited all 92 properties in 133 ms. (steps per millisecond=3 )
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 19 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:17:33] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-18 09:17:33] [INFO ] Implicit Places using invariants in 252 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 254 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 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 0 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
[2022-05-18 09:17:33] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 09:17:33] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-18 09:17:33] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 09:17:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:17:33] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 282 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:17:33] [INFO ] Flatten gal took : 16 ms
[2022-05-18 09:17:33] [INFO ] Flatten gal took : 14 ms
[2022-05-18 09:17:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8243960149609809538.gal : 11 ms
[2022-05-18 09:17:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16562067051649871387.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/CTLFireability8243960149609809538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16562067051649871387.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...275
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.152752,8400,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_in...1645
(forward)formula 0,1,1.37924,42660,1,0,227,172593,209,129,2644,113298,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.43128,43980,1,0,279,181980,210,162,2644,120599,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.49771,45564,1,0,331,193100,211,196,2644,130084,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.76756,51372,1,0,383,234670,212,230,2644,162955,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.95065,57848,1,0,437,271739,213,264,2644,191884,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.95949,58376,1,0,491,271949,214,298,2644,194074,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,2.12787,61280,1,0,545,292340,215,331,2644,209762,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,2.15651,62072,1,0,599,297138,216,365,2644,213355,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,2.17192,62600,1,0,653,299364,217,399,2644,216084,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.59811,75008,1,0,706,380135,218,433,2644,273411,1055
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-18 09:17:36] [INFO ] Flatten gal took : 12 ms
[2022-05-18 09:17:36] [INFO ] Applying decomposition
[2022-05-18 09:17:36] [INFO ] Flatten gal took : 11 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/graph8227838501027251161.txt' '-o' '/tmp/graph8227838501027251161.bin' '-w' '/tmp/graph8227838501027251161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8227838501027251161.bin' '-l' '-1' '-v' '-w' '/tmp/graph8227838501027251161.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:17:37] [INFO ] Decomposing Gal with order
[2022-05-18 09:17:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:17:37] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-18 09:17:37] [INFO ] Flatten gal took : 92 ms
[2022-05-18 09:17:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-18 09:17:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5911946752350840842.gal : 9 ms
[2022-05-18 09:17:37] [INFO ] Time to serialize properties into /tmp/CTLFireability13457884859926288123.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/CTLFireability5911946752350840842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13457884859926288123.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...254
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,8382,0.083112,5876,304,113,2200,357,345,2081,100,1079,0


Converting to forward existential form...Done !
original formula: AG(EF(((i0.u8.belt2_light_barrier_true>=1)&&(i0.u8.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u8.belt2_light_barrier_true>=1)&&(i0.u8.DB_deliver_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions FB_deliver_Cstop_FB_deliver_Pstop_feed_belt_unlock_input_area_feed_belt_unlock_output_area_ta...1745
(forward)formula 0,1,0.228962,9688,1,0,10367,941,1266,11320,474,2424,30293
Formula is TRUE !

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

original formula: AG(EF(((i2.i2.u9.belt1_light_barrier_false>=1)&&(i2.i2.u0.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i2.u9.belt1_light_barrier_false>=1)&&(i2.i2.u0.FB_trans_run>=1)))))] = FALSE
(forward)formula 1,1,0.308933,12064,1,0,16134,941,1276,16864,474,2433,46380
Formula is TRUE !

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

original formula: AG(EF(((i2.i2.u9.belt1_light_barrier_true>=1)&&(i2.i2.u9.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i2.u9.belt1_light_barrier_true>=1)&&(i2.i2.u9.FB_deliver_run>=1)))))] = FALS...156
(forward)formula 2,1,0.373751,13912,1,0,20465,941,1288,21096,475,2435,59823
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u11.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u11.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 3,1,0.440622,16024,1,0,25218,953,1291,25677,475,2481,73422
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u11.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u11.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 4,1,0.502091,17080,1,0,27892,965,1294,28479,475,2507,82129
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u11.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u11.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 5,1,0.529262,17872,1,0,28973,966,1298,29900,475,2509,86088
Formula is TRUE !

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

original formula: AG(EF(((i0.u10.arm2_retract_ext>=1)&&(u11.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u10.arm2_retract_ext>=1)&&(u11.A2U_ext_run>=1)))))] = FALSE
(forward)formula 6,1,0.551801,18400,1,0,29977,966,1302,31393,475,2509,89307
Formula is TRUE !

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

original formula: AG(EF(((i0.u10.arm2_release_ext>=1)&&(i0.u10.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u10.arm2_release_ext>=1)&&(i0.u10.A2U_ret_run>=1)))))] = FALSE
(forward)formula 7,1,0.573164,18928,1,0,30785,966,1312,32546,477,2509,92188
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 8,1,0.611759,19984,1,0,32819,966,1315,34856,477,2509,99327
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u12.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u12.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 9,1,0.637516,20512,1,0,33967,966,1318,36405,477,2512,102990
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u12.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u12.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 10,1,0.670839,21304,1,0,34467,966,1321,37196,477,2513,105042
Formula is TRUE !

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

original formula: AG(EF(((i0.u10.arm2_retract_ext>=1)&&(u12.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u10.arm2_retract_ext>=1)&&(u12.A2L_ext_run>=1)))))] = FALSE
(forward)formula 11,1,0.690196,21568,1,0,35338,966,1323,38479,477,2513,107853
Formula is TRUE !

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

original formula: AG(EF(((i0.u10.arm2_pick_up_ext>=1)&&(i0.u10.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u10.arm2_pick_up_ext>=1)&&(i0.u10.A2L_ret_run>=1)))))] = FALSE
(forward)formula 12,1,0.710284,21832,1,0,36169,966,1332,39696,479,2513,110778
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u14.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u14.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 13,1,0.730217,22360,1,0,37243,966,1335,40913,479,2513,114745
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 14,1,0.738415,22624,1,0,37523,966,1338,41284,479,2513,115965
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u14.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u14.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 15,1,0.759544,23152,1,0,38759,966,1341,42689,479,2515,119903
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u14.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u14.A1L_ext_run>=1)))))] = FALSE
(forward)formula 16,1,0.778367,23680,1,0,39552,968,1344,43850,479,2521,122793
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_pick_up_ext>=1)&&(u13.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_pick_up_ext>=1)&&(u13.A1L_ret_run>=1)))))] = FALSE
(forward)formula 17,1,0.792737,23944,1,0,40081,972,1348,44538,479,2522,125160
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u15.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u15.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 18,1,0.808607,24472,1,0,40882,972,1351,45619,479,2524,128021
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 19,1,0.821382,25000,1,0,41539,972,1354,46461,479,2533,130566
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 20,1,0.839883,25528,1,0,42534,972,1357,47835,479,2535,133997
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u15.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u15.A1U_ext_run>=1)))))] = FALSE
(forward)formula 21,1,0.857558,26056,1,0,43374,989,1359,49093,479,2556,136685
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_ext>=1)&&(u13.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_ext>=1)&&(u13.A1U_ret_run>=1)))))] = FALSE
(forward)formula 22,1,0.867291,26320,1,0,43856,992,1365,49694,481,2557,138658
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_release_height>=1)&&(i8.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_release_height>=1)&&(i8.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 23,1,0.938434,28168,1,0,48736,992,1376,54380,482,2558,152202
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_above_feed_belt>=1)&&(i8.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_above_feed_belt>=1)&&(i8.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 24,1,1.01811,30280,1,0,53642,995,1381,59062,482,2563,166101
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_transport_height>=1)&&(i8.u18.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_transport_height>=1)&&(i8.u18.CU_lower_run>=1)))))] = FALSE
(forward)formula 25,1,1.06757,32392,1,0,58572,997,1387,63802,482,2563,179587
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_transport_height>=1)&&(i8.u19.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_transport_height>=1)&&(i8.u19.CL_lower_run>=1)))))] = FALSE
(forward)formula 26,1,1.1083,33976,1,0,62268,997,1392,67699,482,2563,189866
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_above_deposit_belt>=1)&&(i8.u16.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_above_deposit_belt>=1)&&(i8.u16.CL_trans_run>=1)))))] = FALSE
(forward)formula 27,1,1.15057,35560,1,0,66081,1003,1397,71648,482,2576,200912
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_pick_up_height>=1)&&(i8.u16.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_pick_up_height>=1)&&(i8.u16.CL_lift_run>=1)))))] = FALSE
(forward)formula 28,1,1.2175,37672,1,0,69686,1006,1404,75535,484,2580,211302
Formula is TRUE !

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

original formula: AG(EF(((i0.u1.ch_DC_free>=1)&&(i0.u1.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u1.ch_DC_free>=1)&&(i0.u1.ch_A2D_full>=1)))))] = FALSE
(forward)formula 29,1,1.24314,38200,1,0,71791,1006,1412,77967,485,2580,217854
Formula is TRUE !

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

original formula: AG(EF(((i2.i2.u0.ch_CF_full>=1)&&(i2.i2.u0.ch_FT_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i2.u0.ch_CF_full>=1)&&(i2.i2.u0.ch_FT_free>=1)))))] = FALSE
(forward)formula 30,1,1.28507,40048,1,0,76198,1006,1422,82000,485,2580,230195
Formula is TRUE !

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

original formula: AG(EF((((i0.u8.ch_A2D_free>=1)&&(u13.swivel>=1))&&(i0.u10.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u8.ch_A2D_free>=1)&&(u13.swivel>=1))&&(i0.u10.arm2_storing>=1)))))] = FALSE
(forward)formula 31,1,1.29595,40312,1,0,76719,1006,1432,82734,485,2580,232440
Formula is TRUE !

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

original formula: AG(EF((((i1.u3.ch_A1P_free>=1)&&(u13.swivel>=1))&&(u13.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i1.u3.ch_A1P_free>=1)&&(u13.swivel>=1))&&(u13.arm1_storing>=1)))))] = FALSE
(forward)formula 32,1,1.30173,40576,1,0,76957,1006,1442,83072,487,2580,233588
Formula is TRUE !

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

original formula: AG(EF(((i8.u18.ch_CF_free>=1)&&(i8.u18.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u18.ch_CF_free>=1)&&(i8.u18.crane_storing>=1)))))] = FALSE
(forward)formula 33,1,1.34561,42424,1,0,81392,1006,1448,87294,487,2580,245674
Formula is TRUE !

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

original formula: AG(EF(((i8.u19.ch_DC_full>=1)&&(i8.u19.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u19.ch_DC_full>=1)&&(i8.u19.crane_store_free>=1)))))] = FALSE
(forward)formula 34,1,1.38239,43744,1,0,84531,1006,1456,90643,487,2580,254542
Formula is TRUE !

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

original formula: AG(EF((((u13.swivel>=1)&&(i2.i1.u7.TU_lift_rs>=1))&&(u13.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u13.swivel>=1)&&(i2.i1.u7.TU_lift_rs>=1))&&(u13.arm1_store_free>=1)))))] = FAL...157
(forward)formula 35,1,1.39164,44008,1,0,85014,1006,1464,91254,487,2580,256578
Formula is TRUE !

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

original formula: AG(EF((((u13.swivel>=1)&&(i1.u2.PU_lower_rs>=1))&&(i0.u10.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u13.swivel>=1)&&(i1.u2.PU_lower_rs>=1))&&(i0.u10.arm2_store_free>=1)))))] = FA...158
(forward)formula 36,1,1.39979,44272,1,0,85387,1006,1472,91739,487,2580,258298
Formula is TRUE !

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

original formula: AG(EF(((i1.u2.press_at_upper_pos>=1)&&(i1.u2.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.press_at_upper_pos>=1)&&(i1.u2.forge_run>=1)))))] = FALSE
(forward)formula 37,1,1.42528,45328,1,0,87256,1007,1480,93813,487,2590,263675
Formula is TRUE !

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

original formula: AG(EF(((i1.u3.press_at_middle_pos>=1)&&(i1.u3.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u3.press_at_middle_pos>=1)&&(i1.u3.PL_lower_run>=1)))))] = FALSE
(forward)formula 38,1,1.4513,46120,1,0,89166,1007,1484,95954,487,2590,269062
Formula is TRUE !

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

original formula: AG(EF(((i2.i0.u5.table_load_angle>=1)&&(i2.i0.u4.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u5.table_load_angle>=1)&&(i2.i0.u4.TL_rot_run>=1)))))] = FALSE
(forward)formula 39,1,1.50637,48232,1,0,94005,1007,1492,100579,487,2592,282781
Formula is TRUE !

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

original formula: AG(EF(((i2.i1.u6.table_bottom_pos>=1)&&(i2.i0.u4.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i1.u6.table_bottom_pos>=1)&&(i2.i0.u4.TL_lower_run>=1)))))] = FALSE
(forward)formula 40,1,1.60378,50608,1,0,99672,1007,1498,105719,487,2592,298320
Formula is TRUE !

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

original formula: AG(EF(((i2.i0.u5.table_unload_angle>=1)&&(i2.i1.u7.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u5.table_unload_angle>=1)&&(i2.i1.u7.TU_rot_run>=1)))))] = FALSE
(forward)formula 41,1,1.65211,52456,1,0,104203,1007,1504,109768,487,2592,311778
Formula is TRUE !

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

original formula: AG(EF(((i0.u8.belt2_light_barrier_true>=1)&&(i0.u1.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u8.belt2_light_barrier_true>=1)&&(i0.u1.DB_trans_run>=1)))))] = FALSE
(forward)formula 42,1,1.73538,53776,1,0,106731,1007,1509,112775,487,2592,319803
Formula is TRUE !

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

original formula: AG(EF(((i0.u8.belt2_light_barrier_false>=1)&&(i0.u8.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u8.belt2_light_barrier_false>=1)&&(i0.u8.DB_deliver_run>=1)))))] = FALSE
(forward)formula 43,1,1.76719,54832,1,0,109139,1007,1515,115493,489,2592,327570
Formula is TRUE !

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

original formula: AG(EF(((i2.i2.u9.belt1_light_barrier_true>=1)&&(i2.i2.u0.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i2.u9.belt1_light_barrier_true>=1)&&(i2.i2.u0.FB_trans_run>=1)))))] = FALSE
(forward)formula 44,1,1.81681,56680,1,0,113071,1007,1521,119270,489,2592,341106
Formula is TRUE !

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

original formula: AG(EF(((i2.i2.u9.belt1_light_barrier_false>=1)&&(i2.i2.u9.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i2.u9.belt1_light_barrier_false>=1)&&(i2.i2.u9.FB_deliver_run>=1)))))] = FAL...157
(forward)formula 45,1,1.86262,58264,1,0,116757,1007,1529,122750,491,2592,353989
Formula is TRUE !

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

original formula: AG(EF(((u11.A2U_in>=1)&&(u14.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.A2U_in>=1)&&(u14.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 46,1,1.87032,58528,1,0,117125,1007,1532,123174,491,2592,355603
Formula is TRUE !

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

original formula: AG(EF(((u11.A2U_in>=1)&&(u15.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.A2U_in>=1)&&(u15.arm1_release_angle>=1)))))] = FALSE
(forward)formula 47,1,1.87791,58792,1,0,117522,1007,1534,123617,491,2592,357146
Formula is TRUE !

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

original formula: AG(EF(((u11.A2U_in>=1)&&(u12.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.A2U_in>=1)&&(u12.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 48,1,1.8896,59056,1,0,118068,1007,1536,124405,491,2592,359306
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u11.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u11.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 49,1,1.90018,59320,1,0,118610,1007,1540,125111,492,2592,361415
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u11.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u11.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 50,1,1.91168,59584,1,0,119130,1007,1544,125842,493,2592,363414
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u11.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u11.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 51,1,1.9243,60112,1,0,119738,1007,1548,126754,494,2592,365596
Formula is TRUE !

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

original formula: AG(EF(((i0.u10.arm2_release_ext>=1)&&(u11.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u10.arm2_release_ext>=1)&&(u11.A2U_ext_run>=1)))))] = FALSE
(forward)formula 52,1,1.9372,60376,1,0,120290,1007,1550,127633,494,2592,367774
Formula is TRUE !

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

original formula: AG(EF(((i0.u10.arm2_retract_ext>=1)&&(i0.u10.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u10.arm2_retract_ext>=1)&&(i0.u10.A2U_ret_run>=1)))))] = FALSE
(forward)formula 53,1,1.95107,60904,1,0,120911,1007,1554,128582,494,2592,370136
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 54,1,1.96031,61168,1,0,121340,1007,1557,129119,494,2592,371932
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 55,1,1.96654,61432,1,0,121630,1007,1559,129462,494,2592,373121
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 56,1,1.97714,61432,1,0,122079,1008,1561,130102,494,2599,374941
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 57,1,1.98656,61960,1,0,122537,1008,1563,130686,494,2599,376830
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 58,1,1.99855,62224,1,0,123069,1009,1565,131534,494,2610,378677
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 59,1,2.00945,62488,1,0,123510,1009,1567,132180,494,2612,380487
Formula is TRUE !

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

original formula: AG(EF(((i0.u10.arm2_pick_up_ext>=1)&&(u12.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u10.arm2_pick_up_ext>=1)&&(u12.A2L_ext_run>=1)))))] = FALSE
(forward)formula 60,1,2.02172,62752,1,0,123987,1009,1569,132979,494,2612,382494
Formula is TRUE !

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

original formula: AG(EF(((i0.u10.arm2_retract_ext>=1)&&(i0.u10.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u10.arm2_retract_ext>=1)&&(i0.u10.A2L_ret_run>=1)))))] = FALSE
(forward)formula 61,1,2.03583,63280,1,0,124632,1009,1573,133950,494,2612,384894
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u14.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u14.A1L_in>=1)))))] = FALSE
(forward)formula 62,1,2.04083,63544,1,0,124764,1009,1576,134144,494,2612,385757
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u14.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u14.A1L_in>=1)))))] = FALSE
(forward)formula 63,1,2.04693,63544,1,0,124968,1009,1578,134450,494,2612,386958
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u14.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u14.A1L_in>=1)))))] = FALSE
(forward)formula 64,1,2.0546,63808,1,0,125287,1009,1580,134889,494,2612,388399
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 65,1,2.06147,64072,1,0,125469,1009,1584,135252,495,2612,389542
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 66,1,2.06754,64336,1,0,125648,1009,1586,135565,495,2612,390653
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 67,1,2.07554,64336,1,0,126002,1009,1590,136095,497,2612,392100
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_pick_up_ext>=1)&&(u14.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_pick_up_ext>=1)&&(u14.A1L_ext_run>=1)))))] = FALSE
(forward)formula 68,1,2.08373,64600,1,0,126275,1009,1592,136570,497,2612,393338
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u13.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u13.A1L_ret_run>=1)))))] = FALSE
(forward)formula 69,1,2.09437,64864,1,0,126760,1009,1596,137214,499,2612,395462
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 70,1,2.09863,65128,1,0,126902,1009,1599,137424,499,2612,396032
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 71,1,2.10316,65128,1,0,127054,1009,1601,137638,499,2612,396638
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 72,1,2.10686,65128,1,0,127171,1009,1603,137793,499,2612,397134
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 73,1,2.1118,65392,1,0,127390,1009,1605,138159,499,2618,397712
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 74,1,2.11735,65392,1,0,127595,1009,1607,138533,499,2619,398346
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 75,1,2.12185,65392,1,0,127789,1009,1609,138823,499,2619,398892
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_ext>=1)&&(u15.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_ext>=1)&&(u15.A1U_ext_run>=1)))))] = FALSE
(forward)formula 76,1,2.12689,65656,1,0,127905,1009,1611,139102,499,2619,399428
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u13.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u13.A1U_ret_run>=1)))))] = FALSE
(forward)formula 77,1,2.13566,65656,1,0,128342,1009,1613,139639,499,2619,401107
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_transport_height>=1)&&(i8.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_transport_height>=1)&&(i8.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 78,1,2.1868,67768,1,0,132681,1009,1617,143732,499,2619,413631
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_above_deposit_belt>=1)&&(i8.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_above_deposit_belt>=1)&&(i8.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 79,1,2.28396,70408,1,0,137053,1009,1621,147655,499,2619,426558
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_release_height>=1)&&(i8.u18.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_release_height>=1)&&(i8.u18.CU_lower_run>=1)))))] = FALSE
(forward)formula 80,1,2.33289,71728,1,0,141848,1009,1625,152162,499,2619,440199
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_pick_up_height>=1)&&(i8.u19.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_pick_up_height>=1)&&(i8.u19.CL_lower_run>=1)))))] = FALSE
(forward)formula 81,1,2.37357,73048,1,0,145464,1010,1629,155935,499,2619,450638
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_above_feed_belt>=1)&&(i8.u16.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_above_feed_belt>=1)&&(i8.u16.CL_trans_run>=1)))))] = FALSE
(forward)formula 82,1,2.41274,74632,1,0,149019,1010,1633,159595,499,2619,461502
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_transport_height>=1)&&(i8.u16.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_transport_height>=1)&&(i8.u16.CL_lift_run>=1)))))] = FALSE
(forward)formula 83,1,2.45063,75952,1,0,152206,1010,1637,162967,499,2619,471139
Formula is TRUE !

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

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

BK_STOP 1652865459810

--------------------
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-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 r157-smll-165277001700169"
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 ;