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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1045.724 58104.00 75829.00 399.20 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-165277001700184.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-5, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-165277001700184
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 7.8K Apr 29 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 17:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 17:37 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 22K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 1652865764947

Running Version 202205111006
[2022-05-18 09:22:47] [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:22:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 09:22:47] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2022-05-18 09:22:47] [INFO ] Transformed 231 places.
[2022-05-18 09:22:47] [INFO ] Transformed 202 transitions.
[2022-05-18 09:22:47] [INFO ] Found NUPN structural information;
[2022-05-18 09:22:47] [INFO ] Parsed PT model containing 231 places and 202 transitions in 502 ms.
Built sparse matrix representations for Structural reductions in 18 ms.12897KB 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 160 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 27 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:22:48] [INFO ] Computed 59 place invariants in 21 ms
[2022-05-18 09:22:48] [INFO ] Implicit Places using invariants in 425 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:22:48] [INFO ] Computed 59 place invariants in 9 ms
[2022-05-18 09:22:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:22:49] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2022-05-18 09:22:49] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:22:49] [INFO ] Computed 59 place invariants in 32 ms
[2022-05-18 09:22:49] [INFO ] Dead Transitions using invariants and state equation in 465 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 2232 ms (no deadlock found). (steps per millisecond=560 )
Random directed walk for 1250003 steps, including 0 resets, run took 2202 ms (no deadlock found). (steps per millisecond=567 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:22:54] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-18 09:22:54] [INFO ] [Real]Absence check using 35 positive place invariants in 48 ms returned sat
[2022-05-18 09:22:54] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 99 ms returned sat
[2022-05-18 09:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:22:55] [INFO ] [Real]Absence check using state equation in 1291 ms returned sat
[2022-05-18 09:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:22:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 25 ms returned sat
[2022-05-18 09:22:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 76 ms returned sat
[2022-05-18 09:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:22:57] [INFO ] [Nat]Absence check using state equation in 1570 ms returned sat
[2022-05-18 09:22:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:22:57] [INFO ] [Nat]Added 68 Read/Feed constraints in 64 ms returned sat
[2022-05-18 09:22:58] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 5 ms to minimize.
[2022-05-18 09:22:58] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2022-05-18 09:22:58] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2022-05-18 09:22:58] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2022-05-18 09:22:58] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2022-05-18 09:22:58] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2022-05-18 09:22:59] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2022-05-18 09:23:00] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2022-05-18 09:23:00] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2022-05-18 09:23:00] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2022-05-18 09:23:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-05-18 09:23:00] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2022-05-18 09:23:00] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2022-05-18 09:23:00] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2022-05-18 09:23:00] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2022-05-18 09:23:01] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2022-05-18 09:23:01] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2022-05-18 09:23:01] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2022-05-18 09:23:01] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2022-05-18 09:23:01] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2022-05-18 09:23:01] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2022-05-18 09:23:01] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2022-05-18 09:23:02] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2022-05-18 09:23:02] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2022-05-18 09:23:02] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2022-05-18 09:23:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2022-05-18 09:23:02] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 6 ms to minimize.
[2022-05-18 09:23:02] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2022-05-18 09:23:02] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2022-05-18 09:23:03] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2022-05-18 09:23:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 38 trap constraints in 5212 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 10 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 108 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:23:03] [INFO ] Computed 59 place invariants in 10 ms
[2022-05-18 09:23:03] [INFO ] Implicit Places using invariants in 362 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 368 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 133 transition count 137
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 127 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 125 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 125 transition count 135
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 136 place count 86 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 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:23:03] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 09:23:03] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-18 09:23:03] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 09:23:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-18 09:23:03] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 290 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 3 formulas.
Finished random walk after 991 steps, including 0 resets, run visited all 91 properties in 211 ms. (steps per millisecond=4 )
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 31 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:23:04] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-18 09:23:04] [INFO ] Implicit Places using invariants in 380 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 387 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 133 transition count 137
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 127 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 125 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 125 transition count 135
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 136 place count 86 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 20 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:23:04] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-18 09:23:04] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-18 09:23:04] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 09:23:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-18 09:23:04] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 405 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:23:05] [INFO ] Flatten gal took : 76 ms
[2022-05-18 09:23:05] [INFO ] Flatten gal took : 33 ms
[2022-05-18 09:23:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10491549921891533161.gal : 16 ms
[2022-05-18 09:23:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7456783862137892679.ctl : 6 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/CTLFireability10491549921891533161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7456783862137892679.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,41064,0.294483,10372,2,3514,5,25668,6,0,433,22913,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,2.33936,62808,1,0,227,317043,209,129,2646,205313,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,2.58938,69672,1,0,279,358338,210,162,2646,234007,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,2.8086,76008,1,0,331,399341,211,196,2646,265255,453
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-18 09:23:08] [INFO ] Flatten gal took : 15 ms
[2022-05-18 09:23:08] [INFO ] Applying decomposition
[2022-05-18 09:23:08] [INFO ] Flatten gal took : 13 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/graph254447798965635808.txt' '-o' '/tmp/graph254447798965635808.bin' '-w' '/tmp/graph254447798965635808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph254447798965635808.bin' '-l' '-1' '-v' '-w' '/tmp/graph254447798965635808.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:23:08] [INFO ] Decomposing Gal with order
[2022-05-18 09:23:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:23:08] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-18 09:23:08] [INFO ] Flatten gal took : 66 ms
[2022-05-18 09:23:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-18 09:23:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15616696563716946423.gal : 6 ms
[2022-05-18 09:23:08] [INFO ] Time to serialize properties into /tmp/CTLFireability7415819508341043003.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/CTLFireability15616696563716946423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7415819508341043003.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 91 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,41064,0.055439,6260,283,114,2220,389,325,2095,104,1081,0


Converting to forward existential form...Done !
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
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...1774
(forward)formula 0,1,0.200247,10484,1,0,13206,962,1194,12054,500,2407,32043
Formula is TRUE !

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

original formula: AG(EF(((i1.u1.press_at_lower_pos>=1)&&(i1.u2.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u1.press_at_lower_pos>=1)&&(i1.u2.PL_lower_run>=1)))))] = FALSE
(forward)formula 1,1,0.243356,11540,1,0,15442,962,1199,14483,500,2407,38349
Formula is TRUE !

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

original formula: AG(EF(((i2.u3.table_unload_angle>=1)&&(i2.u5.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u3.table_unload_angle>=1)&&(i2.u5.TL_rot_run>=1)))))] = FALSE
(forward)formula 2,1,0.31061,13388,1,0,20171,973,1205,19261,500,2440,51281
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.table_bottom_pos>=1)&&(i2.u5.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.table_bottom_pos>=1)&&(i2.u5.TL_lower_run>=1)))))] = FALSE
(forward)formula 3,1,0.386712,15236,1,0,24752,973,1211,23818,500,2441,64075
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.table_top_pos>=1)&&(i2.u5.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.table_top_pos>=1)&&(i2.u5.TL_lower_run>=1)))))] = FALSE
(forward)formula 4,1,0.470414,17348,1,0,29325,974,1216,28473,500,2443,76801
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.table_top_pos>=1)&&(i2.u6.TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.table_top_pos>=1)&&(i2.u6.TU_lift_run>=1)))))] = FALSE
(forward)formula 5,1,0.551538,19988,1,0,36011,974,1221,34267,500,2443,94685
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.table_bottom_pos>=1)&&(i2.u6.TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.table_bottom_pos>=1)&&(i2.u6.TU_lift_run>=1)))))] = FALSE
(forward)formula 6,1,0.640706,22364,1,0,42295,974,1225,39819,500,2443,111333
Formula is TRUE !

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

original formula: AG(EF(((i2.u3.table_load_angle>=1)&&(i2.u6.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u3.table_load_angle>=1)&&(i2.u6.TU_rot_run>=1)))))] = FALSE
(forward)formula 7,1,0.688091,24740,1,0,48600,974,1231,45538,500,2443,128044
Formula is TRUE !

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

original formula: AG(EF(((i3.u7.belt2_light_barrier_false>=1)&&(i3.u8.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i3.u7.belt2_light_barrier_false>=1)&&(i3.u8.DB_trans_run>=1)))))] = FALSE
(forward)formula 8,1,0.792796,28700,1,0,58494,977,1237,53587,500,2448,153888
Formula is TRUE !

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

original formula: AG(EF(((i3.u7.belt2_light_barrier_true>=1)&&(i3.u7.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i3.u7.belt2_light_barrier_true>=1)&&(i3.u7.DB_deliver_run>=1)))))] = FALSE
(forward)formula 9,1,0.856072,31868,1,0,67079,977,1246,60528,501,2448,177370
Formula is TRUE !

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

original formula: AG(EF(((i2.u9.belt1_light_barrier_false>=1)&&(i2.u9.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u9.belt1_light_barrier_false>=1)&&(i2.u9.FB_trans_run>=1)))))] = FALSE
(forward)formula 10,1,0.913231,34244,1,0,73469,981,1256,66349,502,2489,194313
Formula is TRUE !

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

original formula: AG(EF(((i2.u9.belt1_light_barrier_true>=1)&&(i2.u9.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u9.belt1_light_barrier_true>=1)&&(i2.u9.FB_deliver_run>=1)))))] = FALSE
(forward)formula 11,1,0.993182,37412,1,0,79506,987,1264,71747,502,2494,211148
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u12.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u12.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 12,1,1.04426,39260,1,0,86106,1018,1267,77136,502,2556,229464
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u12.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u12.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 13,1,1.08103,40844,1,0,89825,1021,1270,80790,502,2560,239382
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u12.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u12.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 14,1,1.1411,42956,1,0,95528,1022,1274,85913,502,2565,254899
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_retract_ext>=1)&&(u12.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_retract_ext>=1)&&(u12.A2U_ext_run>=1)))))] = FALSE
(forward)formula 15,1,1.17887,44012,1,0,97570,1024,1277,88325,502,2566,260411
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_release_ext>=1)&&(u11.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_ext>=1)&&(u11.A2U_ret_run>=1)))))] = FALSE
(forward)formula 16,1,1.20443,44540,1,0,98471,1027,1282,89474,504,2567,263435
Formula is TRUE !

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

original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 17,1,1.26769,46124,1,0,102503,1027,1285,93684,504,2567,274340
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u10.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u10.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 18,1,1.37754,47972,1,0,106490,1027,1288,97718,504,2567,285708
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_release_angle>=1)&&(u10.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_angle>=1)&&(u10.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 19,1,1.40161,48500,1,0,107636,1027,1291,99182,504,2572,289466
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_retract_ext>=1)&&(u10.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_retract_ext>=1)&&(u10.A2L_ext_run>=1)))))] = FALSE
(forward)formula 20,1,1.42737,49292,1,0,108776,1033,1293,100713,504,2579,292968
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_ext>=1)&&(u11.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_ext>=1)&&(u11.A2L_ret_run>=1)))))] = FALSE
(forward)formula 21,1,1.44847,49556,1,0,109566,1036,1297,101791,506,2580,295736
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 22,1,1.48543,50612,1,0,111955,1036,1300,104150,506,2580,302766
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 23,1,1.55797,51668,1,0,114099,1036,1303,106535,506,2582,309184
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_release_angle>=1)&&(u14.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_angle>=1)&&(u14.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 24,1,1.59046,52724,1,0,116481,1036,1306,108902,506,2584,315819
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 25,1,1.61269,53252,1,0,117552,1036,1309,110336,506,2584,319018
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 26,1,1.62967,53780,1,0,118126,1037,1313,111135,506,2584,321215
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 27,1,1.65516,54308,1,0,119253,1037,1316,112634,506,2608,324863
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 28,1,1.69206,55364,1,0,121026,1037,1319,114839,506,2608,330417
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 29,1,1.7315,56420,1,0,123286,1037,1322,117361,506,2608,337056
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 30,1,1.75458,56948,1,0,124406,1052,1324,118898,506,2626,340230
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 31,1,1.76764,57212,1,0,124901,1052,1330,119541,508,2626,342148
Formula is TRUE !

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

original formula: AG(EF(((i0.u16.crane_release_height>=1)&&(i0.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u16.crane_release_height>=1)&&(i0.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 32,1,1.88488,60644,1,0,133932,1060,1341,127194,509,2653,365906
Formula is TRUE !

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

original formula: AG(EF(((i0.u17.crane_above_feed_belt>=1)&&(i0.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u17.crane_above_feed_belt>=1)&&(i0.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 33,1,2.00088,63812,1,0,142636,1060,1346,134463,509,2653,388228
Formula is TRUE !

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

original formula: AG(EF(((i0.u16.crane_transport_height>=1)&&(i0.u0.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u16.crane_transport_height>=1)&&(i0.u0.CU_lower_run>=1)))))] = FALSE
(forward)formula 34,1,2.12288,67508,1,0,151910,1060,1353,142297,509,2655,412067
Formula is TRUE !

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

original formula: AG(EF(((i0.u16.crane_transport_height>=1)&&(i0.u18.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u16.crane_transport_height>=1)&&(i0.u18.CL_lower_run>=1)))))] = FALSE
(forward)formula 35,1,2.24865,71468,1,0,161834,1061,1358,150527,509,2655,436897
Formula is TRUE !

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

original formula: AG(EF(((i0.u17.crane_above_deposit_belt>=1)&&(i0.u16.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u17.crane_above_deposit_belt>=1)&&(i0.u16.CL_trans_run>=1)))))] = FALSE
(forward)formula 36,1,2.32246,74900,1,0,171377,1061,1363,158415,509,2655,461141
Formula is TRUE !

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

original formula: AG(EF(((i0.u16.crane_pick_up_height>=1)&&(i0.u16.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u16.crane_pick_up_height>=1)&&(i0.u16.CL_lift_run>=1)))))] = FALSE
(forward)formula 37,1,2.39839,78332,1,0,180893,1073,1367,166438,509,2694,486007
Formula is TRUE !

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

original formula: AG(EF(((i3.u8.ch_DC_free>=1)&&(i3.u8.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i3.u8.ch_DC_free>=1)&&(i3.u8.ch_A2D_full>=1)))))] = FALSE
(forward)formula 38,1,2.46481,81500,1,0,188964,1074,1375,173007,510,2695,507356
Formula is TRUE !

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

original formula: AG(EF((((i3.u7.ch_A2D_free>=1)&&(u11.swivel>=1))&&(u11.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i3.u7.ch_A2D_free>=1)&&(u11.swivel>=1))&&(u11.arm2_storing>=1)))))] = FALSE
(forward)formula 39,1,2.47804,82028,1,0,189889,1074,1387,174077,512,2695,510556
Formula is TRUE !

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

original formula: AG(EF(((i0.u0.ch_CF_free>=1)&&(i0.u0.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.ch_CF_free>=1)&&(i0.u0.crane_storing>=1)))))] = FALSE
(forward)formula 40,1,2.54998,84932,1,0,198300,1074,1395,180912,513,2695,532126
Formula is TRUE !

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

original formula: AG(EF(((i0.u18.ch_DC_full>=1)&&(i0.u18.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u18.ch_DC_full>=1)&&(i0.u18.crane_store_free>=1)))))] = FALSE
(forward)formula 41,1,2.62727,88364,1,0,207431,1074,1401,188322,513,2695,554691
Formula is TRUE !

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

original formula: AG(EF((((u11.swivel>=1)&&(i1.u2.PL_lower_rs>=1))&&(u13.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u11.swivel>=1)&&(i1.u2.PL_lower_rs>=1))&&(u13.arm1_storing>=1)))))] = FALSE
(forward)formula 42,1,2.63498,88628,1,0,207896,1074,1407,188906,513,2695,556408
Formula is TRUE !

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

original formula: AG(EF((((u11.swivel>=1)&&(i2.u6.TU_lift_rs>=1))&&(u13.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u11.swivel>=1)&&(i2.u6.TU_lift_rs>=1))&&(u13.arm1_store_free>=1)))))] = FALSE
(forward)formula 43,1,2.64314,88892,1,0,208274,1074,1413,189397,513,2695,557958
Formula is TRUE !

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

original formula: AG(EF(((i2.u9.ch_CF_full>=1)&&(i2.u5.TL_lower_rs>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u9.ch_CF_full>=1)&&(i2.u5.TL_lower_rs>=1)))))] = FALSE
(forward)formula 44,1,2.77514,91268,1,0,213924,1074,1420,194380,513,2695,573167
Formula is TRUE !

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

original formula: AG(EF((((u11.swivel>=1)&&(i1.u1.PU_lower_rs>=1))&&(u11.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u11.swivel>=1)&&(i1.u1.PU_lower_rs>=1))&&(u11.arm2_store_free>=1)))))] = FALSE
(forward)formula 45,1,2.79171,91796,1,0,215171,1074,1427,195785,513,2695,577075
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 46,1,2.81712,92852,1,0,217429,1074,1434,198169,513,2701,583338
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 47,1,2.85685,94436,1,0,221234,1074,1438,201884,513,2701,594257
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 48,1,2.90773,96548,1,0,226711,1074,1442,206585,513,2701,609056
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-18 09:23:11] [INFO ] Flatten gal took : 9 ms
[2022-05-18 09:23:11] [INFO ] Flatten gal took : 9 ms
[2022-05-18 09:23:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7501003939468681813.gal : 3 ms
[2022-05-18 09:23:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12920550366108108312.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/CTLFireability7501003939468681813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12920550366108108312.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 42 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,41064,0.227838,10644,2,3514,5,25668,6,0,433,22913,0


Converting to forward existential form...Done !
original formula: AG(EF(((belt2_light_barrier_true>=1)&&(DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_true>=1)&&(DB_trans_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,2.71562,77036,1,0,228,404059,209,129,2646,258337,281
Formula is TRUE !

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

original formula: AG(EF(((belt2_light_barrier_false>=1)&&(DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_false>=1)&&(DB_deliver_run>=1)))))] = FALSE
(forward)formula 1,1,3.78914,101092,1,0,281,551170,210,162,2646,362615,367
Formula is TRUE !

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

original formula: AG(EF(((belt1_light_barrier_true>=1)&&(FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_true>=1)&&(FB_trans_run>=1)))))] = FALSE
(forward)formula 2,1,4.53221,119572,1,0,337,688049,211,195,2646,460226,453
Formula is TRUE !

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

original formula: AG(EF(((A2U_in>=1)&&(arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((A2U_in>=1)&&(arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 3,1,6.33646,168872,1,0,403,1.0027e+06,212,234,2646,686397,554
Formula is TRUE !

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

original formula: AG(EF(((A2U_in>=1)&&(arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((A2U_in>=1)&&(arm1_release_angle>=1)))))] = FALSE
(forward)formula 4,1,8.26915,208576,1,0,466,1.24734e+06,213,271,2646,866804,650
Formula is TRUE !

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

original formula: AG(EF(((A2U_in>=1)&&(arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((A2U_in>=1)&&(arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 5,1,9.553,246260,1,0,542,1.51048e+06,214,312,2646,1.06215e+06,756
Formula is TRUE !

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

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
(forward)formula 6,1,11.3048,284472,1,0,599,1.74104e+06,215,345,2646,1.24458e+06,842
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 7,1,12.0377,308956,1,0,656,1.8726e+06,216,378,2646,1.35126e+06,928
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 8,1,12.4923,322156,1,0,720,1.952e+06,217,411,2646,1.41636e+06,1014
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 9,1,13.7909,359536,1,0,784,2.18963e+06,218,444,2646,1.58987e+06,1100
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 10,1,15.2206,388244,1,0,847,2.3541e+06,219,476,2646,1.72264e+06,1182
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 11,1,17.3363,430544,1,0,924,2.60956e+06,220,523,2646,1.91317e+06,1303
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 12,1,18.5776,462752,1,0,1007,2.85358e+06,221,574,2646,2.09628e+06,1434
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 13,1,19.8268,497796,1,0,1068,3.09042e+06,222,610,2646,2.27359e+06,1526
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 14,1,20.1945,509344,1,0,1124,3.15223e+06,223,643,2646,2.3204e+06,1612
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 15,1,20.4835,516472,1,0,1180,3.19821e+06,224,676,2646,2.35643e+06,1698
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 16,1,20.9391,528088,1,0,1236,3.27382e+06,225,709,2646,2.41372e+06,1784
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 17,1,22.6316,549668,1,0,1292,3.40094e+06,226,742,2646,2.50956e+06,1870
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 18,1,22.9341,558908,1,0,1347,3.46042e+06,227,774,2646,2.55444e+06,1952
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 19,1,23.8537,586100,1,0,1410,3.63986e+06,228,809,2646,2.69446e+06,2043
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 20,1,24.6671,612432,1,0,1488,3.79239e+06,229,854,2646,2.80898e+06,2159
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 21,1,25.4963,638236,1,0,1553,3.9453e+06,230,887,2646,2.92117e+06,2245
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 22,1,25.9618,650908,1,0,1613,4.02309e+06,231,920,2646,2.97688e+06,2331
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 23,1,26.2836,657772,1,0,1673,4.06458e+06,232,953,2646,3.00775e+06,2417
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 24,1,26.7963,669916,1,0,1738,4.13698e+06,233,986,2646,3.05966e+06,2503
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 25,1,27.5436,691160,1,0,1798,4.26123e+06,234,1019,2646,3.14686e+06,2589
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 26,1,28.003,703568,1,0,1856,4.33443e+06,235,1051,2646,3.20019e+06,2670
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 27,1,28.7862,724620,1,0,1916,4.46136e+06,236,1087,2646,3.29859e+06,2761
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-18 09:23:41] [INFO ] Flatten gal took : 8 ms
[2022-05-18 09:23:41] [INFO ] Applying decomposition
[2022-05-18 09:23:41] [INFO ] Flatten gal took : 8 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/graph10530523460086128838.txt' '-o' '/tmp/graph10530523460086128838.bin' '-w' '/tmp/graph10530523460086128838.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10530523460086128838.bin' '-l' '-1' '-v' '-w' '/tmp/graph10530523460086128838.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:23:41] [INFO ] Decomposing Gal with order
[2022-05-18 09:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:23:42] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-18 09:23:42] [INFO ] Flatten gal took : 17 ms
[2022-05-18 09:23:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-18 09:23:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2447288025572496007.gal : 3 ms
[2022-05-18 09:23:42] [INFO ] Time to serialize properties into /tmp/CTLFireability312985138727738694.ctl : 0 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/CTLFireability2447288025572496007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability312985138727738694.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...252
No direction supplied, using forward translation only.
Parsed 14 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,41064,0.048449,6016,284,115,2216,366,340,2109,100,1155,0


Converting to forward existential form...Done !
original formula: AG(EF(((u14.arm2_pick_up_angle>=1)&&(u12.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_pick_up_angle>=1)&&(u12.A1U_in>=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...1784
(forward)formula 0,1,0.169836,11296,1,0,16471,934,1260,14766,476,2480,40039
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u12.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u12.A1U_in>=1)))))] = FALSE
(forward)formula 1,1,0.217661,13408,1,0,22096,938,1262,19937,476,2498,54661
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u12.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u12.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 2,1,0.268566,15784,1,0,27423,943,1267,25265,477,2544,69149
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u12.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u12.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 3,1,0.277385,16048,1,0,27910,943,1272,26007,479,2544,70587
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u12.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u12.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 4,1,0.290707,16312,1,0,28307,943,1278,26619,481,2550,71825
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_ext>=1)&&(u12.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_ext>=1)&&(u12.A1U_ext_run>=1)))))] = FALSE
(forward)formula 5,1,0.30631,16840,1,0,29443,943,1281,28168,481,2550,75078
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 6,1,0.37463,20536,1,0,39028,945,1289,36008,481,2550,99390
Formula is TRUE !

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

original formula: AG(EF(((i9.u17.crane_above_deposit_belt>=1)&&(i9.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_above_deposit_belt>=1)&&(i9.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 7,1,0.456348,24232,1,0,48943,945,1294,43960,481,2550,125688
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_release_height>=1)&&(i9.u18.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_release_height>=1)&&(i9.u18.CU_lower_run>=1)))))] = FALSE
(forward)formula 8,1,0.567216,28192,1,0,59626,945,1302,52435,481,2550,153800
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_pick_up_height>=1)&&(i9.u19.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_pick_up_height>=1)&&(i9.u19.CL_lower_run>=1)))))] = FALSE
(forward)formula 9,1,0.647921,32152,1,0,70108,946,1308,60942,481,2550,181478
Formula is TRUE !

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

original formula: AG(EF(((i9.u17.crane_above_feed_belt>=1)&&(i9.u16.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_above_feed_belt>=1)&&(i9.u16.CL_trans_run>=1)))))] = FALSE
(forward)formula 10,1,0.725479,35584,1,0,79461,946,1312,68478,481,2550,206878
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u16.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u16.CL_lift_run>=1)))))] = FALSE
(forward)formula 11,1,0.822001,39016,1,0,88469,946,1319,75841,483,2550,230636
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_retract_ext>=1)&&(u15.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_retract_ext>=1)&&(u15.A1U_ret_run>=1)))))] = FALSE
(forward)formula 12,1,0.837423,39280,1,0,89127,946,1323,76708,483,2550,232940
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u8.belt1_light_barrier_false>=1)&&(i1.i2.u8.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.belt1_light_barrier_false>=1)&&(i1.i2.u8.FB_deliver_run>=1)))))] = FAL...157
(forward)formula 13,1,0.904511,42184,1,0,96690,946,1336,83167,485,2550,253034
Formula is TRUE !

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

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

BK_STOP 1652865823051

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

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