fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r268-smll-171654406700018
Last Updated
July 7, 2024

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
542.344 43876.00 68485.00 417.90 FTTFFTFTTTFFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r268-smll-171654406700018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ParamProductionCell-PT-1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406700018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-00
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-01
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-02
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-03
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-04
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-05
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-06
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-07
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-08
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-09
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-10
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2024-11
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2023-12
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2023-13
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2023-14
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716651604300

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-25 15:40:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:40:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:40:06] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-05-25 15:40:06] [INFO ] Transformed 231 places.
[2024-05-25 15:40:06] [INFO ] Transformed 202 transitions.
[2024-05-25 15:40:06] [INFO ] Found NUPN structural information;
[2024-05-25 15:40:06] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 99 ms.
Support contains 115 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 200
Applied a total of 4 rules in 50 ms. Remains 229 /231 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 229 cols
[2024-05-25 15:40:06] [INFO ] Computed 59 invariants in 22 ms
[2024-05-25 15:40:07] [INFO ] Implicit Places using invariants in 593 ms returned [1, 15, 16, 18, 19, 36, 42, 46, 59, 64, 73, 115, 120, 167, 194, 195]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 638 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 213/231 places, 200/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 213 /213 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 722 ms. Remains : 213/231 places, 200/202 transitions.
Support contains 115 out of 213 places after structural reductions.
[2024-05-25 15:40:07] [INFO ] Flatten gal took : 61 ms
[2024-05-25 15:40:07] [INFO ] Flatten gal took : 28 ms
[2024-05-25 15:40:08] [INFO ] Input system was already deterministic with 200 transitions.
Reduction of identical properties reduced properties to check from 75 to 74
RANDOM walk for 40000 steps (8 resets) in 2398 ms. (16 steps per ms) remains 23/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 127 ms. (31 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 105 ms. (37 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 77 ms. (51 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
// Phase 1: matrix 200 rows 213 cols
[2024-05-25 15:40:09] [INFO ] Computed 43 invariants in 6 ms
[2024-05-25 15:40:09] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/168 variables, 16/16 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 6/22 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-25 15:40:09] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 19 ms to minimize.
[2024-05-25 15:40:09] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 3 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 6/28 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/29 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 1/30 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/30 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 3/171 variables, 3/33 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 2/35 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 18 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 10 (OVERLAPS) 28/199 variables, 12/47 constraints. Problems are: Problem set: 6 solved, 17 unsolved
[2024-05-25 15:40:11] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
Problem AtomicPropp13 is UNSAT
[2024-05-25 15:40:11] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-25 15:40:11] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-05-25 15:40:11] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
[2024-05-25 15:40:11] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp55 is UNSAT
[2024-05-25 15:40:11] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 6/53 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/53 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 185/384 variables, 199/252 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 45/297 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/297 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 15/399 variables, 23/320 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/399 variables, 0/320 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 14/413 variables, 14/334 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/413 variables, 6/340 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/413 variables, 0/340 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/413 variables, 0/340 constraints. Problems are: Problem set: 18 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 340 constraints, problems are : Problem set: 18 solved, 5 unsolved in 3329 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 213/213 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 18 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/154 variables, 11/11 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 2/13 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/15 constraints. Problems are: Problem set: 18 solved, 5 unsolved
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/19 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 5/159 variables, 5/24 constraints. Problems are: Problem set: 18 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 18 solved, 5 unsolved
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 8 (OVERLAPS) 32/191 variables, 16/40 constraints. Problems are: Problem set: 21 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/41 constraints. Problems are: Problem set: 21 solved, 2 unsolved
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Int declared 191/413 variables, and 44 constraints, problems are : Problem set: 23 solved, 0 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 16/25 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/213 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 10/23 constraints]
After SMT, in 4218ms problems are : Problem set: 23 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 15:40:13] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-25 15:40:13] [INFO ] Flatten gal took : 20 ms
[2024-05-25 15:40:13] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ParamProductionCell-PT-1-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 15:40:13] [INFO ] Flatten gal took : 19 ms
[2024-05-25 15:40:13] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 59 out of 213 places (down from 78) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 30 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 209 cols
[2024-05-25 15:40:13] [INFO ] Computed 43 invariants in 10 ms
[2024-05-25 15:40:14] [INFO ] Implicit Places using invariants in 380 ms returned [19, 26, 30, 35, 39, 55, 67, 68, 87, 88, 90, 102, 104, 106, 146, 147, 149, 151, 174, 178, 179, 184, 185, 189, 200]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 381 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/213 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 13 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2024-05-25 15:40:14] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 15:40:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-25 15:40:14] [INFO ] Invariant cache hit.
[2024-05-25 15:40:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:40:14] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/213 places, 194/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 889 ms. Remains : 182/213 places, 194/200 transitions.
[2024-05-25 15:40:14] [INFO ] Flatten gal took : 13 ms
[2024-05-25 15:40:14] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:40:14] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-25 15:40:14] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:40:14] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:40:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3734623046987226767.gal : 5 ms
[2024-05-25 15:40:14] [INFO ] Time to serialize properties into /tmp/CTLFireability10204937241721790613.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3734623046987226767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10204937241721790613.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.146305,6932,2,2888,5,15249,6,0,925,9370,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.160218,6932,1,0,6,15249,7,1,1214,9370,1
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 211 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 211 transition count 198
Applied a total of 4 rules in 10 ms. Remains 211 /213 variables (removed 2) and now considering 198/200 (removed 2) transitions.
// Phase 1: matrix 198 rows 211 cols
[2024-05-25 15:40:14] [INFO ] Computed 43 invariants in 2 ms
[2024-05-25 15:40:15] [INFO ] Implicit Places using invariants in 228 ms returned [19, 30, 35, 39, 55, 67, 103, 105, 107, 148, 149, 151, 153, 176, 181, 186, 187, 191, 202]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 230 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/213 places, 198/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 245 ms. Remains : 192/213 places, 198/200 transitions.
[2024-05-25 15:40:15] [INFO ] Flatten gal took : 12 ms
[2024-05-25 15:40:15] [INFO ] Flatten gal took : 12 ms
[2024-05-25 15:40:15] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-25 15:40:15] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:40:15] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:40:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17228211904050091000.gal : 4 ms
[2024-05-25 15:40:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15870548328061899560.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17228211904050091000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15870548328061899560.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.183019,9016,2,4348,5,20899,6,0,969,11985,0


Converting to forward existential form...Done !
original formula: AG(((AX(((press_at_upper_pos==1)&&(forge_run==1))) + E(A((deposit_belt_empty!=1) U (((swivel==1)&&(arm2_waiting_for_swivel_2==1))||((arm1...641
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((!(EX(!(((press_at_upper_pos==1)&&(forge_run==1))))) + E(!((E(!((((swivel==1)&&(arm2...1175
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t81, t86, t90, t101, t109, t113, t...333
(forward)formula 0,1,2.61372,78844,1,0,264,228282,392,175,5606,153257,389
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 213 transition count 188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 201 transition count 188
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 24 place count 201 transition count 173
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 54 place count 186 transition count 173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 182 transition count 169
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 182 transition count 169
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 106 place count 160 transition count 147
Applied a total of 106 rules in 53 ms. Remains 160 /213 variables (removed 53) and now considering 147/200 (removed 53) transitions.
// Phase 1: matrix 147 rows 160 cols
[2024-05-25 15:40:17] [INFO ] Computed 43 invariants in 1 ms
[2024-05-25 15:40:18] [INFO ] Implicit Places using invariants in 257 ms returned [1, 5, 8, 11, 17, 20, 23, 27, 38, 44, 45, 51, 56, 57, 59, 71, 72, 73, 92, 105, 106, 108, 109, 130, 133, 134, 138, 139, 142, 152]
[2024-05-25 15:40:18] [INFO ] Actually due to overlaps returned [57, 59, 56, 8, 23, 44, 71, 72, 105, 106, 108, 133, 134, 142, 11, 17, 27, 38, 45, 138, 139, 152, 20, 73]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 260 ms to find 24 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 136/213 places, 147/200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 136 transition count 138
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 127 transition count 138
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 18 place count 127 transition count 131
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 120 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 118 transition count 129
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 118 transition count 129
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 110 place count 81 transition count 92
Applied a total of 110 rules in 32 ms. Remains 81 /136 variables (removed 55) and now considering 92/147 (removed 55) transitions.
// Phase 1: matrix 92 rows 81 cols
[2024-05-25 15:40:18] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 15:40:18] [INFO ] Implicit Places using invariants in 94 ms returned [1, 4, 30, 49, 56, 66]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 96 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 75/213 places, 92/200 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 73 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 72 transition count 89
Applied a total of 6 rules in 10 ms. Remains 72 /75 variables (removed 3) and now considering 89/92 (removed 3) transitions.
// Phase 1: matrix 89 rows 72 cols
[2024-05-25 15:40:18] [INFO ] Computed 13 invariants in 0 ms
[2024-05-25 15:40:18] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-25 15:40:18] [INFO ] Invariant cache hit.
[2024-05-25 15:40:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 15:40:18] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 72/213 places, 89/200 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 692 ms. Remains : 72/213 places, 89/200 transitions.
[2024-05-25 15:40:18] [INFO ] Flatten gal took : 5 ms
[2024-05-25 15:40:18] [INFO ] Flatten gal took : 5 ms
[2024-05-25 15:40:18] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-25 15:40:18] [INFO ] Flatten gal took : 5 ms
[2024-05-25 15:40:18] [INFO ] Flatten gal took : 5 ms
[2024-05-25 15:40:18] [INFO ] Time to serialize gal into /tmp/CTLFireability6430381514685117535.gal : 2 ms
[2024-05-25 15:40:18] [INFO ] Time to serialize properties into /tmp/CTLFireability15308667497928021939.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6430381514685117535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15308667497928021939.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 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,535,0.029833,3988,2,557,5,2534,6,0,380,1919,0


Converting to forward existential form...Done !
original formula: AG(EF((CU_out==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (CU_out==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t41, t46, t47, t50, t56, t58, t63, t66, t72, t73, t77, t81, t82, t85, t87, t88, Intersection...241
(forward)formula 0,1,0.186341,9584,1,0,170,26796,175,98,2183,18153,242
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 11 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 209 cols
[2024-05-25 15:40:18] [INFO ] Computed 43 invariants in 1 ms
[2024-05-25 15:40:19] [INFO ] Implicit Places using invariants in 232 ms returned [19, 26, 30, 35, 39, 55, 67, 68, 87, 88, 90, 102, 104, 106, 146, 147, 149, 151, 174, 178, 179, 184, 185, 189, 200]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 235 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/213 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 6 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2024-05-25 15:40:19] [INFO ] Computed 18 invariants in 2 ms
[2024-05-25 15:40:19] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 15:40:19] [INFO ] Invariant cache hit.
[2024-05-25 15:40:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:40:19] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/213 places, 194/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 723 ms. Remains : 182/213 places, 194/200 transitions.
[2024-05-25 15:40:19] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:40:19] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:40:19] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-25 15:40:19] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:40:19] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:40:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6093527172568293235.gal : 2 ms
[2024-05-25 15:40:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10736772044441395254.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6093527172568293235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10736772044441395254.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.122328,7004,2,2888,5,15249,6,0,925,9370,0


Converting to forward existential form...Done !
original formula: EF(EG((EF(((arm1_release_angle==1)&&(A2L_in==1))) + AX(FALSE))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U ((arm1_release_angle==1)&&(A2L_in==1))) + !(EX(!(FALSE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t79, t84, t88, t98, t106, t110, t1...332
(forward)formula 0,1,2.93718,86680,1,0,369,406309,381,227,5473,248054,526
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 7 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 209 cols
[2024-05-25 15:40:22] [INFO ] Computed 43 invariants in 4 ms
[2024-05-25 15:40:22] [INFO ] Implicit Places using invariants in 229 ms returned [19, 26, 30, 35, 39, 55, 67, 68, 88, 90, 102, 104, 106, 146, 147, 149, 151, 174, 178, 179, 184, 185, 189, 200]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 233 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/213 places, 196/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 185/213 places, 196/200 transitions.
[2024-05-25 15:40:22] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:40:22] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:40:22] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-25 15:40:22] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:40:22] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:40:22] [INFO ] Time to serialize gal into /tmp/CTLFireability667640490656601004.gal : 1 ms
[2024-05-25 15:40:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1841231636514425154.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability667640490656601004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1841231636514425154.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.130837,7036,2,2888,5,15146,6,0,939,9198,0


Converting to forward existential form...Done !
original formula: AF(((AF(AX(AF((arm2_having_swivel_2==0)))) * (robot_right==1)) * ((arm2_pick_up_angle==1)&&(A2U_rot3_run==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(!(EX(!(!(EG(!((arm2_having_swivel_2==0)))))))))) * (robot_right==1)) * ((arm2_pick_up_angl...192
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t80, t85, t89, t99, t107, t111, t1...332
(forward)formula 0,1,3.86763,118632,1,0,934,575920,392,599,5007,453945,1138
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 5 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
[2024-05-25 15:40:26] [INFO ] Invariant cache hit.
[2024-05-25 15:40:26] [INFO ] Implicit Places using invariants in 222 ms returned [19, 26, 30, 35, 55, 67, 68, 87, 88, 90, 102, 104, 106, 146, 147, 149, 151, 174, 178, 184, 185, 189, 200]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 223 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/213 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 5 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-25 15:40:27] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-25 15:40:27] [INFO ] Invariant cache hit.
[2024-05-25 15:40:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/213 places, 194/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 744 ms. Remains : 184/213 places, 194/200 transitions.
[2024-05-25 15:40:27] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:27] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:40:27] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-25 15:40:27] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:27] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2901340287708049589.gal : 1 ms
[2024-05-25 15:40:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15235393294894604916.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2901340287708049589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15235393294894604916.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.133855,7560,2,3158,5,16266,6,0,933,10035,0


Converting to forward existential form...Done !
original formula: EF(((EF(((crane_stop_v==1)&&(CL_loaded==1))) * EG(EX((A1U_out==0)))) * ((table_stop_v==0)||(table_at_unload_angle==0))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * ((table_stop_v==0)||(table_at_unload_angle==0))) * E(TRUE U ((crane_stop_v==1)&&(CL_lo...194
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t79, t84, t88, t98, t106, t110, t1...332
(forward)formula 0,1,2.97035,87692,1,0,373,393329,385,232,5257,238795,528
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 4 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 209 cols
[2024-05-25 15:40:30] [INFO ] Computed 43 invariants in 2 ms
[2024-05-25 15:40:30] [INFO ] Implicit Places using invariants in 272 ms returned [19, 26, 35, 39, 67, 68, 87, 88, 90, 102, 104, 106, 147, 149, 151, 174, 179, 184, 185, 189, 200]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 274 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-25 15:40:30] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 15:40:30] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-25 15:40:30] [INFO ] Invariant cache hit.
[2024-05-25 15:40:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:40:31] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/213 places, 194/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 721 ms. Remains : 186/213 places, 194/200 transitions.
[2024-05-25 15:40:31] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:31] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:40:31] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-25 15:40:31] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:31] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9077831720814456207.gal : 2 ms
[2024-05-25 15:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14537293818371257195.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9077831720814456207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14537293818371257195.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.123249,6788,2,2567,5,13404,6,0,941,8397,0


Converting to forward existential form...Done !
original formula: AF(E(AX(((AX(((belt2_stop==1)&&(DB_in==1))) * (arm1_retract_ext==1)) * ((arm1_forward==1)&&(A1U_ext_run==1)))) U ((!(EF(((ch_FT_full==1)&...257
=> equivalent forward existential formula: [FwdG(Init,!(E(!(EX(!(((!(EX(!(((belt2_stop==1)&&(DB_in==1))))) * (arm1_retract_ext==1)) * ((arm1_forward==1)&&(...320
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t79, t84, t88, t98, t106, t110, t1...332
(forward)formula 0,0,2.19489,72628,1,0,378,297947,390,233,5641,195780,535
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 5 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 209 cols
[2024-05-25 15:40:33] [INFO ] Computed 43 invariants in 1 ms
[2024-05-25 15:40:33] [INFO ] Implicit Places using invariants in 284 ms returned [19, 26, 30, 35, 39, 55, 67, 68, 87, 88, 90, 102, 104, 106, 147, 151, 174, 178, 184, 185, 189, 200]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 285 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/213 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:40:33] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:40:34] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-25 15:40:34] [INFO ] Invariant cache hit.
[2024-05-25 15:40:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:40:34] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/213 places, 194/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 741 ms. Remains : 185/213 places, 194/200 transitions.
[2024-05-25 15:40:34] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:34] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:40:34] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-25 15:40:34] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:34] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12040502162558702107.gal : 1 ms
[2024-05-25 15:40:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17763021783043096009.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12040502162558702107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17763021783043096009.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.13444,7576,2,3195,5,16407,6,0,937,10180,0


Converting to forward existential form...Done !
original formula: (A(EX(((arm1_forward==1)&&(A1U_ext_rs==1))) U EF(!((((table_top_pos==1)&&(TU_lift_run==1)) + AF(((crane_stop_v==1)&&(CU_in==1))))))) + EF...225
=> equivalent forward existential formula: ([((Init * !(EG(!(E(TRUE U !((((table_top_pos==1)&&(TU_lift_run==1)) + !(EG(!(((crane_stop_v==1)&&(CU_in==1)))))...533
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t79, t84, t88, t98, t106, t110, t1...332
Hit Full ! (commute/partial/dont) 185/15/9
(forward)formula 0,0,5.6482,173952,1,0,1137,1.05694e+06,394,527,5629,691986,1453
FORMULA ParamProductionCell-PT-1-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 4 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 209 cols
[2024-05-25 15:40:40] [INFO ] Computed 43 invariants in 1 ms
[2024-05-25 15:40:40] [INFO ] Implicit Places using invariants in 296 ms returned [26, 30, 35, 39, 55, 68, 87, 88, 90, 102, 104, 106, 146, 149, 151, 174, 178, 179, 184, 185, 189, 200]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 297 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/213 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:40:40] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:40:40] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-25 15:40:40] [INFO ] Invariant cache hit.
[2024-05-25 15:40:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:40:40] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/213 places, 194/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 776 ms. Remains : 185/213 places, 194/200 transitions.
[2024-05-25 15:40:40] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:40:40] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:40:40] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-25 15:40:40] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:40:40] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:40:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13187488159312093491.gal : 2 ms
[2024-05-25 15:40:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12557851232321547626.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13187488159312093491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12557851232321547626.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.136538,7572,2,3207,5,17632,6,0,937,11136,0


Converting to forward existential form...Done !
original formula: AG(AF((EX(((belt1_start==1)&&(FB_deliver_rs==1))) + (((press_upward==1)&&(forge_rs==1))&&((arm1_stop==0)||(A1U_unloadet==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EX(((belt1_start==1)&&(FB_deliver_rs==1))) + (((press_upward==1)&&(forge_rs==1))&&((arm...198
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t79, t84, t88, t98, t106, t110, t1...332
(forward)formula 0,1,2.80668,86240,1,0,255,303040,379,171,5060,210501,370
FORMULA ParamProductionCell-PT-1-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 209 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 209 transition count 196
Applied a total of 8 rules in 5 ms. Remains 209 /213 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 209 cols
[2024-05-25 15:40:43] [INFO ] Computed 43 invariants in 2 ms
[2024-05-25 15:40:44] [INFO ] Implicit Places using invariants in 347 ms returned [19, 26, 30, 35, 39, 55, 68, 87, 88, 90, 104, 106, 146, 147, 149, 151, 174, 178, 184, 185, 189, 200]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 349 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/213 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:40:44] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:40:44] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-25 15:40:44] [INFO ] Invariant cache hit.
[2024-05-25 15:40:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:40:44] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/213 places, 194/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 860 ms. Remains : 185/213 places, 194/200 transitions.
[2024-05-25 15:40:44] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:40:44] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:40:44] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-25 15:40:44] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:40:44] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:40:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2456119517361501327.gal : 1 ms
[2024-05-25 15:40:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3449533491325113492.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2456119517361501327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3449533491325113492.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 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,25632,0.226964,7572,2,3313,5,17042,6,0,937,10761,0


Converting to forward existential form...Done !
original formula: (EG(AF(((crane_stop_v==0)||(CL_in==0)))) * (A(AF((PU_out!=1)) U (((arm2_retract_ext==1)&&(arm2_forward==1))&&(A2U_ext_run==1))) + AX(EX(E...200
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!(((crane_stop_v==0)||(CL_in==0))))))))] = FALSE * [(EY((Init * !(!((E(!((((arm2_retract_ext...443
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t65, t79, t84, t88, t98, t106, t110, t1...332
(forward)formula 0,1,3.431,93200,1,0,460,425300,386,265,5279,257788,646
FORMULA ParamProductionCell-PT-1-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-25 15:40:48] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:40:48] [INFO ] Flatten gal took : 7 ms
Total runtime 41925 ms.

BK_STOP 1716651648176

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-1"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5568"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-1, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654406700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;