About the Execution of ITS-Tools for ParamProductionCell-PT-0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
449.207 | 18079.00 | 30495.00 | 159.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-165277001700159.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-0, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-165277001700159
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 9.2K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.2K 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 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 149K 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 1652865232071
Running Version 202205111006
[2022-05-18 09:13:53] [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:13:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 09:13:54] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2022-05-18 09:13:54] [INFO ] Transformed 198 places.
[2022-05-18 09:13:54] [INFO ] Transformed 176 transitions.
[2022-05-18 09:13:54] [INFO ] Found NUPN structural information;
[2022-05-18 09:13:54] [INFO ] Parsed PT model containing 198 places and 176 transitions in 326 ms.
Built sparse matrix representations for Structural reductions in 8 ms.12614KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 198/198 places, 176/176 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 50 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 176/176 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 198/198 places, 176/176 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 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 198 cols
[2022-05-18 09:13:54] [INFO ] Computed 49 place invariants in 40 ms
[2022-05-18 09:13:54] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 176 rows 198 cols
[2022-05-18 09:13:54] [INFO ] Computed 49 place invariants in 5 ms
[2022-05-18 09:13:55] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-18 09:13:55] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2022-05-18 09:13:55] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 176 rows 198 cols
[2022-05-18 09:13:55] [INFO ] Computed 49 place invariants in 5 ms
[2022-05-18 09:13:55] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 176/176 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1973 ms (no deadlock found). (steps per millisecond=633 )
Random directed walk for 1250003 steps, including 0 resets, run took 1475 ms (no deadlock found). (steps per millisecond=847 )
// Phase 1: matrix 176 rows 198 cols
[2022-05-18 09:13:58] [INFO ] Computed 49 place invariants in 3 ms
[2022-05-18 09:13:59] [INFO ] [Real]Absence check using 32 positive place invariants in 42 ms returned sat
[2022-05-18 09:13:59] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 52 ms returned sat
[2022-05-18 09:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:13:59] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2022-05-18 09:13:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:13:59] [INFO ] [Nat]Absence check using 32 positive place invariants in 27 ms returned sat
[2022-05-18 09:13:59] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 30 ms returned sat
[2022-05-18 09:13:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:14:00] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2022-05-18 09:14:00] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-18 09:14:00] [INFO ] [Nat]Added 59 Read/Feed constraints in 30 ms returned sat
[2022-05-18 09:14:00] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 5 ms to minimize.
[2022-05-18 09:14:00] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2022-05-18 09:14:00] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2022-05-18 09:14:01] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2022-05-18 09:14:01] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2022-05-18 09:14:01] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2022-05-18 09:14:01] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2022-05-18 09:14:01] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2022-05-18 09:14:01] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2022-05-18 09:14:01] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-18 09:14:02] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2022-05-18 09:14:03] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2022-05-18 09:14:04] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2022-05-18 09:14:04] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2022-05-18 09:14:04] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2022-05-18 09:14:04] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2022-05-18 09:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 33 trap constraints in 3737 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 180 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 180 transition count 158
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 74 place count 160 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 74 place count 160 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 158 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 156 transition count 138
Applied a total of 80 rules in 83 ms. Remains 156 /198 variables (removed 42) and now considering 138/176 (removed 38) transitions.
// Phase 1: matrix 138 rows 156 cols
[2022-05-18 09:14:04] [INFO ] Computed 45 place invariants in 4 ms
[2022-05-18 09:14:04] [INFO ] Implicit Places using invariants in 240 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 88, 89, 91, 93, 94, 128, 129, 131, 133, 134]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 243 ms to find 31 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 125/198 places, 138/176 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 125 transition count 122
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 109 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 109 transition count 118
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 103 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 103 transition count 116
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 118 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 65 transition count 78
Applied a total of 120 rules in 22 ms. Remains 65 /125 variables (removed 60) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-05-18 09:14:04] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-18 09:14:04] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-05-18 09:14:04] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-18 09:14:04] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-18 09:14:04] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 65/198 places, 78/176 transitions.
Finished structural reductions, in 2 iterations. Remains : 65/198 places, 78/176 transitions.
Initial state reduction rules removed 1 formulas.
Finished random walk after 2321 steps, including 0 resets, run visited all 77 properties in 348 ms. (steps per millisecond=6 )
Able to resolve query QuasiLiveness after proving 78 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 180 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 180 transition count 158
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 74 place count 160 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 74 place count 160 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 158 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 156 transition count 138
Applied a total of 80 rules in 28 ms. Remains 156 /198 variables (removed 42) and now considering 138/176 (removed 38) transitions.
// Phase 1: matrix 138 rows 156 cols
[2022-05-18 09:14:05] [INFO ] Computed 45 place invariants in 2 ms
[2022-05-18 09:14:05] [INFO ] Implicit Places using invariants in 205 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 88, 89, 91, 93, 94, 128, 129, 131, 133, 134]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 209 ms to find 31 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 125/198 places, 138/176 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 125 transition count 122
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 109 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 109 transition count 118
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 103 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 103 transition count 116
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 118 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 65 transition count 78
Applied a total of 120 rules in 11 ms. Remains 65 /125 variables (removed 60) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-05-18 09:14:05] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-18 09:14:05] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-05-18 09:14:05] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-18 09:14:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-18 09:14:05] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 65/198 places, 78/176 transitions.
Finished structural reductions, in 2 iterations. Remains : 65/198 places, 78/176 transitions.
[2022-05-18 09:14:05] [INFO ] Flatten gal took : 51 ms
[2022-05-18 09:14:05] [INFO ] Flatten gal took : 20 ms
[2022-05-18 09:14:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17260422190368703122.gal : 10 ms
[2022-05-18 09:14:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11130468280757827143.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/CTLFireability17260422190368703122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11130468280757827143.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 78 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7928,0.097353,7232,2,1117,5,11534,6,0,341,11266,0
Converting to forward existential form...Done !
original formula: AG(EF(((press_at_lower_pos>=1)&&(PU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_lower_pos>=1)&&(PU_lower_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions TL_rot_Cstop.TL_rot_Pstop.TL_lower_Pstart, TU_rot_Cstop.TU_rot_Pstop.TU_lift_Pstart, FB_deliv...1539
(forward)formula 0,1,0.494861,19284,1,0,186,76558,177,103,2099,52047,224
Formula is TRUE !
***************************************
original formula: AG(EF(((press_at_upper_pos>=1)&&(PU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_upper_pos>=1)&&(PU_lower_run>=1)))))] = FALSE
(forward)formula 1,1,0.541365,20604,1,0,223,84410,178,126,2099,58000,285
Formula is TRUE !
***************************************
original formula: AG(EF(((press_at_middle_pos>=1)&&(forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_middle_pos>=1)&&(forge_run>=1)))))] = FALSE
(forward)formula 2,1,0.597051,22452,1,0,260,94965,179,150,2099,66926,346
Formula is TRUE !
***************************************
original formula: AG(EF(((press_at_lower_pos>=1)&&(PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_lower_pos>=1)&&(PL_lower_run>=1)))))] = FALSE
(forward)formula 3,1,0.752774,26676,1,0,297,119942,180,174,2099,87208,407
Formula is TRUE !
***************************************
original formula: AG(EF(((table_unload_angle>=1)&&(TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_unload_angle>=1)&&(TL_rot_run>=1)))))] = FALSE
(forward)formula 4,1,0.96393,30804,1,0,336,148223,181,198,2099,110607,468
Formula is TRUE !
***************************************
original formula: AG(EF(((table_top_pos>=1)&&(TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TL_lower_run>=1)))))] = FALSE
(forward)formula 5,1,0.969737,31068,1,0,375,148441,182,222,2099,111551,529
Formula is TRUE !
***************************************
original formula: AG(EF(((table_top_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 6,1,0.975967,31332,1,0,414,148861,183,245,2099,112156,590
Formula is TRUE !
***************************************
original formula: AG(EF(((table_bottom_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_bottom_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 7,1,0.981505,31596,1,0,453,149068,184,269,2099,112730,651
Formula is TRUE !
***************************************
original formula: AG(EF(((table_load_angle>=1)&&(TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_load_angle>=1)&&(TU_rot_run>=1)))))] = FALSE
(forward)formula 8,1,0.984948,31596,1,0,492,149138,185,293,2099,112960,712
Formula is TRUE !
***************************************
original formula: AG(EF(((belt2_light_barrier_false>=1)&&(DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_false>=1)&&(DB_trans_run>=1)))))] = FALSE
(forward)formula 9,1,1.1189,35556,1,0,527,178252,186,317,2099,134571,773
Formula is TRUE !
***************************************
original formula: AG(EF(((belt2_light_barrier_true>=1)&&(DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_true>=1)&&(DB_deliver_run>=1)))))] = FALSE
(forward)formula 10,1,1.17371,37140,1,0,562,187880,187,340,2099,143278,834
Formula is TRUE !
***************************************
original formula: AG(EF(((belt1_light_barrier_false>=1)&&(FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_false>=1)&&(FB_trans_run>=1)))))] = FALSE
(forward)formula 11,1,1.24051,39252,1,0,601,199807,188,364,2099,152717,895
Formula is TRUE !
***************************************
original formula: AG(EF(((belt1_light_barrier_true>=1)&&(FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_true>=1)&&(FB_deliver_run>=1)))))] = FALSE
(forward)formula 12,1,1.36388,41364,1,0,640,212483,189,387,2099,161822,956
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A2U_rot1_run>=1)))))] = FALSE
(forward)formula 13,1,1.59277,48492,1,0,699,255167,190,422,2099,197427,1047
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle>=1)&&(A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A2U_rot2_run>=1)))))] = FALSE
(forward)formula 14,1,1.86226,55620,1,0,746,293955,191,449,2099,229718,1118
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2U_rot3_run>=1)))))] = FALSE
(forward)formula 15,1,2.05556,58524,1,0,787,315889,192,472,2099,248559,1179
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_retract_ext>=1)&&(A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext>=1)&&(A2U_ext_run>=1)))))] = FALSE
(forward)formula 16,1,2.17963,61692,1,0,828,338852,193,496,2099,266971,1240
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_ext>=1)&&(A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_ext>=1)&&(A2U_ret_run>=1)))))] = FALSE
(forward)formula 17,1,2.26114,64068,1,0,869,354246,194,519,2099,280960,1301
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A2L_rot1_run>=1)))))] = FALSE
(forward)formula 18,1,2.48845,70668,1,0,928,396784,195,554,2099,315315,1392
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle>=1)&&(A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A2L_rot2_run>=1)))))] = FALSE
(forward)formula 19,1,2.85851,78852,1,0,981,444971,196,585,2099,354980,1473
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-18 09:14:09] [INFO ] Flatten gal took : 13 ms
[2022-05-18 09:14:09] [INFO ] Applying decomposition
[2022-05-18 09:14:09] [INFO ] Flatten gal took : 12 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/graph971119738117970893.txt' '-o' '/tmp/graph971119738117970893.bin' '-w' '/tmp/graph971119738117970893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph971119738117970893.bin' '-l' '-1' '-v' '-w' '/tmp/graph971119738117970893.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:14:09] [INFO ] Decomposing Gal with order
[2022-05-18 09:14:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:14:09] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-18 09:14:09] [INFO ] Flatten gal took : 63 ms
[2022-05-18 09:14:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-18 09:14:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11387724297342540779.gal : 5 ms
[2022-05-18 09:14:09] [INFO ] Time to serialize properties into /tmp/CTLFireability11694466312135167135.ctl : 3 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/CTLFireability11387724297342540779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11694466312135167135.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...255
No direction supplied, using forward translation only.
Parsed 58 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7928,0.051559,5788,187,107,1857,361,250,2057,89,1102,0
Converting to forward existential form...Done !
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u10.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u10.A2L_rot3_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions A2U_ret_Cstop_A2U_ret_Pstop_arm2_unlock_output_area_arm2_unlock_swivel_2_deposit_belt_lock_in...1602
(forward)formula 0,1,0.112778,7812,1,0,5843,905,947,6558,433,2250,18797
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 1,1,0.126635,8340,1,0,6832,937,950,7790,433,2312,21976
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 2,1,0.136319,8604,1,0,7400,943,956,8568,435,2315,24085
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u9.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u9.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 3,1,0.158925,9660,1,0,9507,943,959,10619,435,2318,30335
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u9.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u9.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 4,1,0.172204,10188,1,0,10760,943,962,11874,435,2324,33999
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u9.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u9.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 5,1,0.182452,10452,1,0,11682,943,965,12769,435,2324,36763
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u9.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u9.A1L_ext_run>=1)))))] = FALSE
(forward)formula 6,1,0.193897,10980,1,0,12234,943,969,13445,435,2324,38546
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_ext>=1)&&(u12.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_ext>=1)&&(u12.A1L_ret_run>=1)))))] = FALSE
(forward)formula 7,1,0.200306,11244,1,0,12477,945,973,13889,435,2324,39686
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle>=1)&&(u13.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle>=1)&&(u13.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 8,1,0.208054,11508,1,0,12956,945,976,14538,435,2344,41245
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u13.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u13.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 9,1,0.225883,12036,1,0,14253,945,979,16001,435,2354,45155
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u13.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u13.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 10,1,0.234333,12300,1,0,14877,945,982,16755,435,2358,47231
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u13.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u13.A1U_ext_run>=1)))))] = FALSE
(forward)formula 11,1,0.24098,12564,1,0,15241,960,984,17293,435,2382,48399
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_release_ext>=1)&&(u12.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_ext>=1)&&(u12.A1U_ret_run>=1)))))] = FALSE
(forward)formula 12,1,0.245597,12828,1,0,15442,960,990,17558,437,2382,49141
Formula is TRUE !
***************************************
original formula: AG(EF((((u6.ch_A2D_free>=1)&&(u11.swivel>=1))&&(u11.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u6.ch_A2D_free>=1)&&(u11.swivel>=1))&&(u11.arm2_storing>=1)))))] = FALSE
(forward)formula 13,1,0.252108,13092,1,0,15905,960,1001,18077,439,2382,50769
Formula is TRUE !
***************************************
original formula: AG(EF((((i0.u1.ch_A1P_free>=1)&&(u11.swivel>=1))&&(u12.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u1.ch_A1P_free>=1)&&(u11.swivel>=1))&&(u12.arm1_storing>=1)))))] = FALSE
(forward)formula 14,1,0.256259,13356,1,0,16106,960,1007,18310,439,2382,51629
Formula is TRUE !
***************************************
original formula: AG(EF((((u11.swivel>=1)&&(i2.i1.u5.TU_lift_rs>=1))&&(u12.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u11.swivel>=1)&&(i2.i1.u5.TU_lift_rs>=1))&&(u12.arm1_store_free>=1)))))] = FAL...157
(forward)formula 15,1,0.266432,13356,1,0,16368,960,1014,18563,439,2382,52697
Formula is TRUE !
***************************************
original formula: AG(EF((((u11.swivel>=1)&&(i0.u0.PU_lower_rs>=1))&&(u11.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u11.swivel>=1)&&(i0.u0.PU_lower_rs>=1))&&(u11.arm2_store_free>=1)))))] = FALSE
(forward)formula 16,1,0.274427,13620,1,0,16966,960,1023,19262,441,2382,54872
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u0.press_at_upper_pos>=1)&&(i0.u0.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.press_at_upper_pos>=1)&&(i0.u0.forge_run>=1)))))] = FALSE
(forward)formula 17,1,0.289599,14148,1,0,18350,960,1031,20740,441,2391,58777
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u1.press_at_middle_pos>=1)&&(i0.u1.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u1.press_at_middle_pos>=1)&&(i0.u1.PL_lower_run>=1)))))] = FALSE
(forward)formula 18,1,0.306991,14676,1,0,19564,962,1040,22182,443,2396,62648
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i0.u2.table_load_angle>=1)&&(i2.i0.u4.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u2.table_load_angle>=1)&&(i2.i0.u4.TL_rot_run>=1)))))] = FALSE
(forward)formula 19,1,0.326467,15468,1,0,21326,964,1050,23982,443,2404,68162
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i0.u2.table_unload_angle>=1)&&(i2.i0.u7.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u2.table_unload_angle>=1)&&(i2.i0.u7.TU_rot_run>=1)))))] = FALSE
(forward)formula 20,1,0.347983,16524,1,0,23329,964,1059,25870,443,2404,74205
Formula is TRUE !
***************************************
original formula: AG(EF(((u6.belt2_light_barrier_true>=1)&&(u6.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.belt2_light_barrier_true>=1)&&(u6.DB_trans_run>=1)))))] = FALSE
(forward)formula 21,1,0.373615,17316,1,0,24935,965,1059,27760,443,2413,79792
Formula is TRUE !
***************************************
original formula: AG(EF(((u6.belt2_light_barrier_false>=1)&&(u6.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.belt2_light_barrier_false>=1)&&(u6.DB_deliver_run>=1)))))] = FALSE
(forward)formula 22,1,0.403047,18108,1,0,26499,968,1064,29623,444,2417,85367
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i0.u7.belt1_light_barrier_true>=1)&&(i2.i0.u7.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u7.belt1_light_barrier_true>=1)&&(i2.i0.u7.FB_trans_run>=1)))))] = FALSE
(forward)formula 23,1,0.428154,19164,1,0,28759,978,1076,32177,445,2526,92030
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i0.u7.belt1_light_barrier_false>=1)&&(i2.i0.u7.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u7.belt1_light_barrier_false>=1)&&(i2.i0.u7.FB_deliver_run>=1)))))] = FAL...157
(forward)formula 24,1,0.447944,19956,1,0,30536,979,1089,33969,447,2527,97676
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.A2U_in>=1)&&(u9.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.A2U_in>=1)&&(u9.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 25,1,0.458458,20220,1,0,31376,979,1091,34890,447,2527,100394
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.A2U_in>=1)&&(u13.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.A2U_in>=1)&&(u13.arm1_release_angle>=1)))))] = FALSE
(forward)formula 26,1,0.466579,20748,1,0,31926,979,1093,35508,447,2527,102170
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.A2U_in>=1)&&(u10.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.A2U_in>=1)&&(u10.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 27,1,0.475935,21012,1,0,32472,979,1095,36218,447,2527,104184
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u8.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u8.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 28,1,0.496885,21540,1,0,33117,980,1099,37002,448,2532,106322
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u8.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u8.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 29,1,0.503905,21804,1,0,33597,981,1103,37573,449,2532,108046
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u8.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u8.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 30,1,0.512525,21804,1,0,34210,982,1108,38373,450,2537,110229
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_ext>=1)&&(u8.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_ext>=1)&&(u8.A2U_ext_run>=1)))))] = FALSE
(forward)formula 31,1,0.52301,22332,1,0,34960,982,1110,39315,450,2537,112820
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_retract_ext>=1)&&(u11.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_retract_ext>=1)&&(u11.A2U_ret_run>=1)))))] = FALSE
(forward)formula 32,1,0.531802,22596,1,0,35492,982,1112,40042,450,2537,114810
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle>=1)&&(u10.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle>=1)&&(u10.A2L_in>=1)))))] = FALSE
(forward)formula 33,1,0.543371,23124,1,0,36421,986,1115,41138,450,2540,117523
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u10.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u10.A2L_in>=1)))))] = FALSE
(forward)formula 34,1,0.551394,23388,1,0,36976,986,1117,41848,450,2540,119287
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u10.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u10.A2L_in>=1)))))] = FALSE
(forward)formula 35,1,0.558562,23916,1,0,37384,987,1119,42338,450,2541,120899
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 36,1,0.564897,23916,1,0,37827,992,1122,42866,450,2559,122361
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 37,1,0.572534,24180,1,0,38297,992,1125,43489,450,2569,124009
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 38,1,0.579501,24444,1,0,38695,992,1127,43993,450,2571,125600
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_ext>=1)&&(u10.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_ext>=1)&&(u10.A2L_ext_run>=1)))))] = FALSE
(forward)formula 39,1,0.588132,24972,1,0,39171,995,1129,44642,450,2573,127489
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_retract_ext>=1)&&(u11.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_retract_ext>=1)&&(u11.A2L_ret_run>=1)))))] = FALSE
(forward)formula 40,1,0.596627,24972,1,0,39691,995,1133,45321,452,2573,129388
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u9.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u9.A1L_in>=1)))))] = FALSE
(forward)formula 41,1,0.600682,25236,1,0,39794,995,1136,45484,452,2573,130012
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u9.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u9.A1L_in>=1)))))] = FALSE
(forward)formula 42,1,0.605231,25500,1,0,39952,995,1138,45693,452,2573,130871
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u9.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u9.A1L_in>=1)))))] = FALSE
(forward)formula 43,1,0.608803,25500,1,0,40105,995,1140,45886,452,2573,131682
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle>=1)&&(u9.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle>=1)&&(u9.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 44,1,0.613817,25500,1,0,40260,995,1144,46189,453,2573,132555
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle>=1)&&(u9.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle>=1)&&(u9.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 45,1,0.617853,25764,1,0,40404,995,1146,46418,453,2573,133419
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle>=1)&&(u9.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle>=1)&&(u9.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 46,1,0.621653,25764,1,0,40542,995,1150,46624,455,2573,134232
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_ext>=1)&&(u9.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_ext>=1)&&(u9.A1L_ext_run>=1)))))] = FALSE
(forward)formula 47,1,0.627101,25764,1,0,40688,995,1152,46941,455,2573,135186
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u12.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u12.A1L_ret_run>=1)))))] = FALSE
(forward)formula 48,1,0.633024,26028,1,0,40887,995,1154,47306,455,2573,136250
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle>=1)&&(u13.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle>=1)&&(u13.A1U_in>=1)))))] = FALSE
(forward)formula 49,1,0.635689,26028,1,0,40977,995,1157,47414,455,2573,136604
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u13.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u13.A1U_in>=1)))))] = FALSE
(forward)formula 50,1,0.638539,26556,1,0,41075,995,1159,47527,455,2573,136985
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u13.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u13.A1U_in>=1)))))] = FALSE
(forward)formula 51,1,0.640778,26556,1,0,41160,995,1161,47612,455,2573,137337
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u13.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u13.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 52,1,0.643779,26556,1,0,41278,995,1163,47804,455,2581,137712
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u13.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u13.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 53,1,0.646887,26556,1,0,41392,995,1165,47981,455,2583,138115
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u13.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u13.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 54,1,0.649541,26556,1,0,41486,995,1167,48113,455,2585,138460
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_release_ext>=1)&&(u13.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_ext>=1)&&(u13.A1U_ext_run>=1)))))] = FALSE
(forward)formula 55,1,0.653026,26820,1,0,41570,995,1169,48277,455,2585,138857
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u12.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u12.A1U_ret_run>=1)))))] = FALSE
(forward)formula 56,1,0.657239,26820,1,0,41770,995,1173,48531,457,2585,139524
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i1.u3.table_bottom_pos>=1)&&(i2.i0.u4.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i1.u3.table_bottom_pos>=1)&&(i2.i0.u4.TL_lower_run>=1)))))] = FALSE
(forward)formula 57,1,0.677881,27348,1,0,43672,995,1179,50513,457,2585,144984
Formula is TRUE !
***************************************
Able to resolve query Liveness after proving 78 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 16163 ms.
BK_STOP 1652865250150
--------------------
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-0"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-0, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-165277001700159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;