Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067500466.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DoubleExponent-PT-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067500466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 33K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2023-12
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2023-13
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2023-14
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2023-15
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-00
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-01
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-02
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-03
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-04
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-05
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-06
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-07
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-08
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-09
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-10
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748727473006

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 21:37:54] [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]
[2025-05-31 21:37:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 21:37:54] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2025-05-31 21:37:54] [INFO ] Transformed 110 places.
[2025-05-31 21:37:54] [INFO ] Transformed 98 transitions.
[2025-05-31 21:37:54] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 76 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 16 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:37:54] [INFO ] Computed 11 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:37:54] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-05-31 21:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:37:54] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-05-31 21:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:37:56] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:37:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/204 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:37:57] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:37:57] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:37:57] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:37:58] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:37:58] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 124 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/204 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 97/221 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:03] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:03] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:05] [INFO ] Deduced a trap along path composed of 13 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:06] [INFO ] Deduced a trap along path composed of 5 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:12] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:12] [INFO ] Deduced a trap along path composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 227 constraints, problems are : Problem set: 0 solved, 97 unsolved in 27599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 33774ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 33789ms
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34155 ms. Remains : 106/110 places, 98/98 transitions.
Support contains 76 out of 106 places after structural reductions.
[2025-05-31 21:38:28] [INFO ] Flatten gal took : 25 ms
[2025-05-31 21:38:28] [INFO ] Flatten gal took : 10 ms
[2025-05-31 21:38:28] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 74 out of 106 places (down from 76) after GAL structural reductions.
RANDOM walk for 40000 steps (1325 resets) in 1497 ms. (26 steps per ms) remains 26/61 properties
BEST_FIRST walk for 4000 steps (110 resets) in 150 ms. (26 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (111 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (116 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (115 resets) in 53 ms. (74 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (111 resets) in 28 ms. (137 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (116 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (106 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (115 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (113 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (110 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (108 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (116 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (115 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (114 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (111 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (115 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (109 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (110 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (116 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (111 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (117 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (112 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (118 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (112 resets) in 28 ms. (137 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (113 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (118 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
[2025-05-31 21:38:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 13/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 39/95 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 96/191 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 7 (OVERLAPS) 13/204 variables, 11/117 constraints. Problems are: Problem set: 8 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:30] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:30] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 2/119 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/119 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/119 constraints. Problems are: Problem set: 8 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 119 constraints, problems are : Problem set: 8 solved, 18 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 13/46 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 45/91 variables, 8/10 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/92 variables, 1/11 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 93/185 variables, 92/103 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 14/117 constraints. Problems are: Problem set: 8 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:31] [INFO ] Deduced a trap along path composed of 16 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:31] [INFO ] Deduced a trap along path composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 2/119 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/119 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 16/201 variables, 12/131 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 4/135 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 1/136 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 0/136 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 3/204 variables, 2/138 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 1/139 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/139 constraints. Problems are: Problem set: 8 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 0/204 variables, 0/139 constraints. Problems are: Problem set: 8 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 139 constraints, problems are : Problem set: 8 solved, 18 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 18/26 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3144ms problems are : Problem set: 8 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1275 ms.
Support contains 33 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 106 transition count 92
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 100 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 22 place count 95 transition count 87
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 22 place count 95 transition count 81
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 34 place count 89 transition count 81
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 50 place count 81 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 79 transition count 73
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 79 transition count 73
Applied a total of 58 rules in 24 ms. Remains 79 /106 variables (removed 27) and now considering 73/98 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 79/106 places, 73/98 transitions.
RANDOM walk for 40000 steps (2189 resets) in 414 ms. (96 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40000 steps (1770 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1798 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1786 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1799 resets) in 236 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1798 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1821 resets) in 145 ms. (273 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1805 resets) in 266 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1790 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1786 resets) in 117 ms. (338 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1801 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1798 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1762 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1717 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
// Phase 1: matrix 73 rows 79 cols
[2025-05-31 21:38:35] [INFO ] Computed 11 invariants in 2 ms
[2025-05-31 21:38:35] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 7/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 33/70 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:35] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 73/144 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 8/152 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:35] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/152 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/152 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 95 constraints, problems are : Problem set: 0 solved, 13 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 79/79 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 7/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 33/70 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 73/144 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 8/152 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:36] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:36] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:38:36] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/152 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 0/152 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 111 constraints, problems are : Problem set: 0 solved, 13 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 79/79 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 3776 ms.
Support contains 26 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 73/73 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 69
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 75 transition count 69
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 2 with 4 rules applied. Total rules applied 12 place count 73 transition count 67
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 73 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 72 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 72 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 71 transition count 65
Applied a total of 16 rules in 18 ms. Remains 71 /79 variables (removed 8) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 71/79 places, 65/73 transitions.
RANDOM walk for 40000 steps (2548 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (2018 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (2012 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (2043 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (2064 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (2066 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (2000 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (2018 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (2008 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (2032 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1997 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (2026 resets) in 96 ms. (412 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40001 steps (2044 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1990 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 2792 steps, run visited all 12 properties in 26 ms. (steps per millisecond=107 )
Probabilistic random walk after 2792 steps, saw 1425 distinct states, run finished after 33 ms. (steps per millisecond=84 ) properties seen :12
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 21:38:41] [INFO ] Flatten gal took : 6 ms
[2025-05-31 21:38:41] [INFO ] Flatten gal took : 6 ms
[2025-05-31 21:38:41] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 57 out of 106 places (down from 59) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:38:41] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:41] [INFO ] Implicit Places using invariants in 48 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 7 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:38:41] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-31 21:38:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:41] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:38:41] [INFO ] Flatten gal took : 8 ms
[2025-05-31 21:38:41] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:41] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:38:41] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:41] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:41] [INFO ] Time to serialize gal into /tmp/CTLFireability665320740416167287.gal : 3 ms
[2025-05-31 21:38:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4517491781381614374.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability665320740416167287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4517491781381614374.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.11514,8296,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EG((((EX((((p88>=1) + (EG((p76>=1)) * AG((p100>=1)))) * AF((p39<1)))) + EF((((p101>=1)&&(p60>=1))||(p86<1)))) + (EG((p32>=1)) + EF((p3>=1...172
=> equivalent forward existential formula: [FwdG(Init,(((EX((((p88>=1) + (EG((p76>=1)) * !(E(TRUE U !((p100>=1)))))) * !(EG(!((p39<1)))))) + E(TRUE U (((p1...245
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,2.04195,80572,1,0,1067,282996,233,111,3254,245560,1111
FORMULA DoubleExponent-PT-002-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:38:43] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:43] [INFO ] Implicit Places using invariants in 62 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 6 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:38:43] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:43] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-31 21:38:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:43] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 256 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:38:43] [INFO ] Flatten gal took : 8 ms
[2025-05-31 21:38:43] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:43] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:38:43] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:43] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1037479505009867887.gal : 2 ms
[2025-05-31 21:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12216343200029245183.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1037479505009867887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12216343200029245183.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.098254,8524,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(((p73<1)&&(p17<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U ((p73<1)&&(p17<1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,2.17691,81516,1,0,1063,280239,218,103,3193,242915,1093
FORMULA DoubleExponent-PT-002-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 106 transition count 85
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 93 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 90 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 32 place count 90 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 87 transition count 79
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 56 place count 78 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 78 transition count 70
Applied a total of 57 rules in 19 ms. Remains 78 /106 variables (removed 28) and now considering 70/98 (removed 28) transitions.
// Phase 1: matrix 70 rows 78 cols
[2025-05-31 21:38:46] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:46] [INFO ] Implicit Places using invariants in 49 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 77/106 places, 70/98 transitions.
Graph (complete) has 158 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 68
Applied a total of 3 rules in 9 ms. Remains 75 /77 variables (removed 2) and now considering 68/70 (removed 2) transitions.
// Phase 1: matrix 68 rows 75 cols
[2025-05-31 21:38:46] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-31 21:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 21:38:46] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 75/106 places, 68/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 211 ms. Remains : 75/106 places, 68/98 transitions.
[2025-05-31 21:38:46] [INFO ] Flatten gal took : 6 ms
[2025-05-31 21:38:46] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:46] [INFO ] Input system was already deterministic with 68 transitions.
[2025-05-31 21:38:46] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:46] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7488398750340855485.gal : 1 ms
[2025-05-31 21:38:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11672311453532532035.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7488398750340855485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11672311453532532035.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2564,0.052257,6404,2,1631,5,10452,6,0,370,10219,0


Converting to forward existential form...Done !
original formula: AG(AF(((EG(((p24<1)||(p49<1))) + E(E((p27>=1) U (p88>=1)) U !(((p69>=1)&&(p84>=1))))) + ((E((p26>=1) U (p85>=1)) * (p19<1)) * ((A(((p40>=...218
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((EG(((p24<1)||(p49<1))) + E(E((p27>=1) U (p88>=1)) U !(((p69>=1)&&(p84>=1))))) + ((E((p...315
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t10, t12, t21, t26, t29, t34, t35, t40, t42, t43, t44, t48, t51, t53, t54, t55, t58, ...268
dead was empty
(forward)formula 0,1,0.948853,42652,1,0,922,210195,184,200,2287,190632,985
FORMULA DoubleExponent-PT-002-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 105 transition count 74
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 82 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 46 place count 82 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 82 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 63 transition count 55
Applied a total of 83 rules in 13 ms. Remains 63 /106 variables (removed 43) and now considering 55/98 (removed 43) transitions.
// Phase 1: matrix 55 rows 63 cols
[2025-05-31 21:38:47] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:47] [INFO ] Implicit Places using invariants in 39 ms returned [39, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/106 places, 55/98 transitions.
Graph (complete) has 142 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 57 transition count 51
Applied a total of 7 rules in 6 ms. Remains 57 /61 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 57 cols
[2025-05-31 21:38:47] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:47] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-31 21:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 21:38:47] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/106 places, 51/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 175 ms. Remains : 57/106 places, 51/98 transitions.
[2025-05-31 21:38:47] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:47] [INFO ] Flatten gal took : 7 ms
[2025-05-31 21:38:47] [INFO ] Input system was already deterministic with 51 transitions.
[2025-05-31 21:38:47] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:47] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15454709815015094373.gal : 1 ms
[2025-05-31 21:38:47] [INFO ] Time to serialize properties into /tmp/CTLFireability1090494339725063233.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15454709815015094373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1090494339725063233.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2167,0.055624,6152,2,1391,5,9931,6,0,282,9717,0


Converting to forward existential form...Done !
original formula: AG((AF((p74<1)) + AG((p76<1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(EG(!((p74<1)))))),TRUE) * !((p76<1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t11, t16, t20, t22, t23, t25, t27, t28, t29, t30, t32, t34, t37, t39, t41, t4...261
(forward)formula 0,1,0.381264,21572,1,0,579,79239,126,55,1729,67203,564
FORMULA DoubleExponent-PT-002-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:38:47] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:47] [INFO ] Implicit Places using invariants in 52 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:38:47] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-31 21:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:47] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:38:48] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:48] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:48] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:38:48] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:48] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4789783278647995775.gal : 1 ms
[2025-05-31 21:38:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1170937842499542048.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4789783278647995775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1170937842499542048.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.09834,8528,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: AF(E(EF((p68<1)) U (AG(EX((p88>=1))) * A(EX((p15>=1)) U !(EX((p74>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U (p68<1)) U (!(E(TRUE U !(EX((p88>=1))))) * !((E(!(!(EX((p74>=1)))) U (!(EX((p15>=1))) * ...215
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,2.03705,80492,1,0,1070,281677,224,113,3255,243432,1116
FORMULA DoubleExponent-PT-002-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:38:50] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:50] [INFO ] Implicit Places using invariants in 57 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:38:50] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-31 21:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:50] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 232 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:38:50] [INFO ] Flatten gal took : 6 ms
[2025-05-31 21:38:50] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:50] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:38:50] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:50] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4296368825609891694.gal : 1 ms
[2025-05-31 21:38:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17895153498001455665.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4296368825609891694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17895153498001455665.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.103009,8528,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EG((EF(((p33>=1) + AX((p82>=1)))) + (((p103<1)&&(p41>=1))&&(p65<1))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((p33>=1) + !(EX(!((p82>=1)))))) + (((p103<1)&&(p41>=1))&&(p65<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,2.23648,88132,1,0,1080,344682,221,114,3260,290066,1113
FORMULA DoubleExponent-PT-002-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 106 transition count 84
Reduce places removed 14 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 31 place count 92 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 89 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 89 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 83 transition count 75
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 74 place count 69 transition count 61
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 69 transition count 61
Applied a total of 76 rules in 9 ms. Remains 69 /106 variables (removed 37) and now considering 61/98 (removed 37) transitions.
// Phase 1: matrix 61 rows 69 cols
[2025-05-31 21:38:52] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:52] [INFO ] Implicit Places using invariants in 37 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/106 places, 61/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 60
Applied a total of 2 rules in 3 ms. Remains 67 /68 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 67 cols
[2025-05-31 21:38:52] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-31 21:38:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 21:38:52] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 67/106 places, 60/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 152 ms. Remains : 67/106 places, 60/98 transitions.
[2025-05-31 21:38:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:52] [INFO ] Input system was already deterministic with 60 transitions.
[2025-05-31 21:38:52] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:38:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15556393615308855426.gal : 0 ms
[2025-05-31 21:38:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16865241880268869875.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15556393615308855426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16865241880268869875.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2215,0.042411,5708,2,1912,5,8314,6,0,330,6863,0


Converting to forward existential form...Done !
original formula: (EF((((p56<1)||(p63<1))&&((p71<1)||(p89<1)))) * EF(EG(((p8<1)||(p97<1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(TRUE U (((p56<1)||(p63<1))&&((p71<1)||(p89<1))))),TRUE),((p8<1)||(p97<1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t12, t18, t19, t21, t22, t26, t31, t34, t36, t38, t39, t41, t43, t45, t47, t5...256
Hit Full ! (commute/partial/dont) 50/0/10
(forward)formula 0,1,0.576016,28804,1,0,601,105303,151,65,2316,91469,604
FORMULA DoubleExponent-PT-002-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 0 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:38:53] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:53] [INFO ] Implicit Places using invariants in 56 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:38:53] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:53] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 21:38:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:53] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:38:53] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:53] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:53] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:38:53] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:53] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16904691071051321299.gal : 0 ms
[2025-05-31 21:38:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11987556080621048731.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16904691071051321299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11987556080621048731.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.102358,8520,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EG(EX(EG(((p94<1)&&(p92<1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(EG(((p94<1)&&(p92<1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
dead was empty
(forward)formula 0,0,2.93491,111860,1,0,1221,524443,215,191,2978,435020,1264
FORMULA DoubleExponent-PT-002-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 105 transition count 74
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 46 place count 82 transition count 70
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 54 place count 78 transition count 70
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 82 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 63 transition count 55
Applied a total of 83 rules in 22 ms. Remains 63 /106 variables (removed 43) and now considering 55/98 (removed 43) transitions.
// Phase 1: matrix 55 rows 63 cols
[2025-05-31 21:38:56] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:56] [INFO ] Implicit Places using invariants in 40 ms returned [41, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/106 places, 55/98 transitions.
Graph (complete) has 142 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 59 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 57 transition count 51
Applied a total of 7 rules in 4 ms. Remains 57 /61 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 57 cols
[2025-05-31 21:38:56] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-31 21:38:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 21:38:56] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/106 places, 51/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 181 ms. Remains : 57/106 places, 51/98 transitions.
[2025-05-31 21:38:56] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:56] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:38:56] [INFO ] Input system was already deterministic with 51 transitions.
[2025-05-31 21:38:56] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:56] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14133178496003018325.gal : 1 ms
[2025-05-31 21:38:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5183415991446393071.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14133178496003018325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5183415991446393071.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2343,0.047589,5508,2,1674,5,7461,6,0,282,6569,0


Converting to forward existential form...Done !
original formula: (EG((p103<1)) * (EF(EG((p27<1))) + AF((p27<1))))
=> equivalent forward existential formula: ([(Init * !(EG((p103<1))))] = FALSE * [FwdG((Init * !(E(TRUE U EG((p27<1))))),!((p27<1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t7, t9, t14, t19, t21, t22, t24, t26, t27, t28, t29, t32, t34, t38, t40, t42, t49...260
dead was empty
(forward)formula 0,1,0.811011,39324,1,0,755,198357,133,148,1825,175295,765
FORMULA DoubleExponent-PT-002-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 82 transition count 74
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 46 place count 82 transition count 69
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 56 place count 77 transition count 69
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 84 place count 63 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 62 transition count 54
Applied a total of 85 rules in 10 ms. Remains 62 /106 variables (removed 44) and now considering 54/98 (removed 44) transitions.
// Phase 1: matrix 54 rows 62 cols
[2025-05-31 21:38:57] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:57] [INFO ] Implicit Places using invariants in 39 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/106 places, 54/98 transitions.
Graph (complete) has 145 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 52
Applied a total of 3 rules in 6 ms. Remains 59 /61 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 59 cols
[2025-05-31 21:38:57] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-31 21:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 21:38:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/106 places, 52/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 170 ms. Remains : 59/106 places, 52/98 transitions.
[2025-05-31 21:38:57] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:57] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:38:57] [INFO ] Input system was already deterministic with 52 transitions.
[2025-05-31 21:38:57] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:38:57] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:38:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2150081717643309871.gal : 0 ms
[2025-05-31 21:38:57] [INFO ] Time to serialize properties into /tmp/CTLFireability18004524021661987267.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2150081717643309871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18004524021661987267.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2171,0.049348,5904,2,1326,5,9047,6,0,291,9163,0


Converting to forward existential form...Done !
original formula: EG(EF(((p69>=1)&&(p84>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p69>=1)&&(p84>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t11, t16, t18, t21, t22, t24, t26, t27, t28, t29, t31, t33, t37, t39, t42, t4...261
dead was empty
(forward)formula 0,0,0.408776,23428,1,0,712,91518,127,121,1853,75349,734
FORMULA DoubleExponent-PT-002-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:38:58] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:58] [INFO ] Implicit Places using invariants in 50 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:38:58] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-31 21:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:38:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:38:58] [INFO ] Flatten gal took : 8 ms
[2025-05-31 21:38:58] [INFO ] Flatten gal took : 12 ms
[2025-05-31 21:38:58] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:38:58] [INFO ] Flatten gal took : 4 ms
[2025-05-31 21:38:58] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:38:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12446674982731509530.gal : 1 ms
[2025-05-31 21:38:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17885672804363086025.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12446674982731509530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17885672804363086025.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.104525,8652,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: (EX(EF(AX((p47<1)))) * !(A(((!(AX((p45>=1))) + AF((p23>=1))) + AF((p103>=1))) U ((p55>=1)&&(p61>=1)))))
=> equivalent forward existential formula: ([FwdG(((FwdU((Init * EX(E(TRUE U !(EX(!((p47<1))))))),!(((p55>=1)&&(p61>=1)))) * !(((p55>=1)&&(p61>=1)))) * !((...309
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
Hit Full ! (commute/partial/dont) 91/0/6
Hit Full ! (commute/partial/dont) 95/0/2
(forward)formula 0,1,3.15202,118972,1,0,1223,560238,241,198,3342,459545,1272
FORMULA DoubleExponent-PT-002-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:39:01] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:01] [INFO ] Implicit Places using invariants in 54 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:39:01] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 21:39:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:01] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:39:01] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:39:01] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:39:01] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:39:01] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:39:01] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9457013347658453114.gal : 1 ms
[2025-05-31 21:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4817674720830147163.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9457013347658453114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4817674720830147163.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.107012,8528,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EG(AF((A(((p74<1)&&((p39>=1)||((p14>=1)&&(p8>=1)))) U (EX((p53>=1)) * (p62>=1))) * ((((p106>=1)&&(p49>=1))||((p107>=1)&&(p83>=1)))||(((p6...194
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!((E(!((EX((p53>=1)) * (p62>=1))) U (!(((p74<1)&&((p39>=1)||((p14>=1)&&(p8>=1))))) * !((EX((p...322
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
dead was empty
(forward)formula 0,0,2.21655,86196,1,0,1079,341035,221,113,3119,268443,1118
FORMULA DoubleExponent-PT-002-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:39:04] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:04] [INFO ] Implicit Places using invariants in 51 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:39:04] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:04] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 21:39:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:04] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 222 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:39:04] [INFO ] Flatten gal took : 5 ms
[2025-05-31 21:39:04] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:39:04] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:39:04] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:39:04] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:39:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8478594269780063176.gal : 0 ms
[2025-05-31 21:39:04] [INFO ] Time to serialize properties into /tmp/CTLFireability3319689483987661276.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8478594269780063176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3319689483987661276.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.105877,8656,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EF((AG((AF((p91>=1)) * (p39<1))) + EG(AX((p38>=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!((p91>=1)))) * (p39<1))))))] != FALSE + [FwdG(FwdU(Init,TRUE),!(EX(!((p...176
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,2.99474,117620,1,0,1228,552743,227,201,3108,449703,1280
FORMULA DoubleExponent-PT-002-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2025-05-31 21:39:07] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:07] [INFO ] Implicit Places using invariants in 53 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2025-05-31 21:39:07] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-31 21:39:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:39:07] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 103/106 places, 97/98 transitions.
[2025-05-31 21:39:07] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:39:07] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:39:07] [INFO ] Input system was already deterministic with 97 transitions.
[2025-05-31 21:39:07] [INFO ] Flatten gal took : 2 ms
[2025-05-31 21:39:07] [INFO ] Flatten gal took : 3 ms
[2025-05-31 21:39:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15586406231914382527.gal : 1 ms
[2025-05-31 21:39:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1799091867923114892.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15586406231914382527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1799091867923114892.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3708,0.103502,8532,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(((p11>=1)&&(p31>=1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((p11>=1)&&(p31>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,1.20688,54700,1,0,209,195889,216,118,3190,123775,245
FORMULA DoubleExponent-PT-002-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-05-31 21:39:08] [INFO ] Flatten gal took : 9 ms
[2025-05-31 21:39:08] [INFO ] Flatten gal took : 2 ms
Total runtime 74712 ms.

BK_STOP 1748727548991

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DoubleExponent-PT-002"
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-5832"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-002, 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 r072-tall-174860067500466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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