About the Execution of ITS-Tools for GPPP-PT-C0001N0000000001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 40737.00 | 0.00 | 0.00 | FTTTTTTFTFTFTTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007600241.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 GPPP-PT-C0001N0000000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007600241
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K 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.8K 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 17 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1 May 29 14:32 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000001-CTLCardinality-2023-12
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2023-13
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2023-14
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2023-15
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-00
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-01
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-02
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-03
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-04
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-05
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-06
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-07
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-08
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-09
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-10
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748908258742
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 23:51:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 23:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 23:51:01] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2025-06-02 23:51:01] [INFO ] Transformed 33 places.
[2025-06-02 23:51:01] [INFO ] Transformed 22 transitions.
[2025-06-02 23:51:01] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 16 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-02 23:51:02] [INFO ] Computed 13 invariants in 9 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2314 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3545ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 3570ms
[2025-06-02 23:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 23:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:05] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2025-06-02 23:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2925ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 2927ms
Finished structural reductions in LTL mode , in 1 iterations and 6757 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2025-06-02 23:51:09] [INFO ] Flatten gal took : 35 ms
[2025-06-02 23:51:09] [INFO ] Flatten gal took : 13 ms
[2025-06-02 23:51:09] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 31 out of 33 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1931 ms. (20 steps per ms) remains 25/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 146 ms. (27 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
[2025-06-02 23:51:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp52 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 19 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/26 variables, 3/5 constraints. Problems are: Problem set: 16 solved, 9 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 17 solved, 8 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
After SMT solving in domain Real declared 32/55 variables, and 12 constraints, problems are : Problem set: 25 solved, 0 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 25 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 25 atomic propositions for a total of 15 simplifications.
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 23:51:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 23:51:10] [INFO ] Flatten gal took : 7 ms
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 23:51:10] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:51:10] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 20 out of 33 places (down from 22) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Applied a total of 5 rules in 33 ms. Remains 30 /33 variables (removed 3) and now considering 19/22 (removed 3) transitions.
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 19 rows 30 cols
[2025-06-02 23:51:10] [INFO ] Computed 13 invariants in 3 ms
[2025-06-02 23:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 18/48 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/49 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 44 constraints, problems are : Problem set: 0 solved, 18 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 18/48 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/49 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 62 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2173ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 2173ms
[2025-06-02 23:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:12] [INFO ] Implicit Places using invariants in 60 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 28/33 places, 19/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2272 ms. Remains : 28/33 places, 19/22 transitions.
[2025-06-02 23:51:12] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:12] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:12] [INFO ] Input system was already deterministic with 19 transitions.
[2025-06-02 23:51:12] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:12] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6744255945785207624.gal : 2 ms
[2025-06-02 23:51:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality12933325442208683823.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6744255945785207624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12933325442208683823.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,2874,0.044757,4312,2,929,5,4738,6,0,137,4341,0
Converting to forward existential form...Done !
original formula: AG((!(E(((Pyr<=GSSG)&&(ATP<=6)) U AG((Pi<=_3PG)))) + (GSH<=GSSG)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((GSH<=GSSG))),((Pyr<=GSSG)&&(ATP<=6))) * !(E(TRUE U !((Pi<=_3PG)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.169824,7640,1,0,42,17708,57,21,926,12317,46
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-02 23:51:12] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2002ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 2003ms
[2025-06-02 23:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:15] [INFO ] Implicit Places using invariants in 119 ms returned [0, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 120 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2126 ms. Remains : 30/33 places, 22/22 transitions.
[2025-06-02 23:51:15] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:51:15] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:51:15] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-02 23:51:15] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:51:15] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:51:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality917067579663212473.gal : 3 ms
[2025-06-02 23:51:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality8422670803274450756.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/CTLCardinality917067579663212473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8422670803274450756.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,10380,0.114408,6132,2,2162,5,12516,6,0,148,10597,0
Converting to forward existential form...Done !
original formula: AX(EX(TRUE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.463649,11380,1,0,45,28374,57,25,931,20365,49
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-02 23:51:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2368 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2869ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 2870ms
[2025-06-02 23:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:18] [INFO ] Implicit Places using invariants in 77 ms returned [0, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 94 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2969 ms. Remains : 30/33 places, 22/22 transitions.
[2025-06-02 23:51:18] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:51:18] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:51:18] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-02 23:51:18] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:51:18] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:51:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality18087086658105776982.gal : 2 ms
[2025-06-02 23:51:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality14594362553065877152.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/CTLCardinality18087086658105776982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14594362553065877152.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,10380,0.07491,6136,2,2162,5,12516,6,0,148,10597,0
Converting to forward existential form...Done !
original formula: AG(E(AG((ATP<=5)) U (!(AF(AX((S7P>=1)))) * (AF((b2<3)) + (S7P<=Lac)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(E(TRUE U !((ATP<=5)))) U (!(!(EG(!(!(EX(!((S7P>=1)))))))) * (!(EG(!((b2<3)))) + (S7P<=...173
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.402236,14712,1,0,68,45279,84,35,1031,36056,116
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions 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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 17
Applied a total of 9 rules in 19 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 28 cols
[2025-06-02 23:51:19] [INFO ] Computed 13 invariants in 2 ms
[2025-06-02 23:51:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 16/44 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/45 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 42 constraints, problems are : Problem set: 0 solved, 16 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 16/44 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 58 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2062ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 2063ms
[2025-06-02 23:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:21] [INFO ] Implicit Places using invariants in 59 ms returned [0, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/33 places, 17/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Applied a total of 5 rules in 4 ms. Remains 23 /26 variables (removed 3) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 23 cols
[2025-06-02 23:51:21] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 23:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 23:51:21] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/33 places, 15/22 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2284 ms. Remains : 23/33 places, 15/22 transitions.
[2025-06-02 23:51:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:51:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:51:21] [INFO ] Input system was already deterministic with 15 transitions.
[2025-06-02 23:51:21] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:21] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality3896949908210895071.gal : 1 ms
[2025-06-02 23:51:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality17558629698572594149.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/CTLCardinality3896949908210895071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17558629698572594149.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,912,0.019494,4336,2,362,5,2855,6,0,113,3179,0
Converting to forward existential form...Done !
original formula: AF(!(E((GSH<=0) U !(EF((NADH<=a2))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((GSH<=0) U !(E(TRUE U (NADH<=a2)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.058873,5360,1,0,37,6590,58,18,781,5867,41
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-02 23:51:21] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1842ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1843ms
[2025-06-02 23:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:23] [INFO ] Implicit Places using invariants in 60 ms returned [0, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1906 ms. Remains : 31/33 places, 22/22 transitions.
[2025-06-02 23:51:23] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:23] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:51:23] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-02 23:51:23] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:23] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality14107040389267835676.gal : 1 ms
[2025-06-02 23:51:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2865010612552180636.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/CTLCardinality14107040389267835676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2865010612552180636.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,10380,0.080553,5504,2,1559,5,9046,6,0,152,7775,0
Converting to forward existential form...Done !
original formula: EF(EX(((ATP>NADH)&&(ATP>4))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((ATP>NADH)&&(ATP>4)))] != FALSE
(forward)formula 0,1,0.108278,5760,1,0,7,9046,8,1,334,7775,2
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-02 23:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2352ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 2352ms
[2025-06-02 23:51:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:25] [INFO ] Implicit Places using invariants in 49 ms returned [0, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2406 ms. Remains : 30/33 places, 22/22 transitions.
[2025-06-02 23:51:25] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:25] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:25] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-02 23:51:25] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:25] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality11848272494490584750.gal : 1 ms
[2025-06-02 23:51:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality11626952221223006382.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/CTLCardinality11848272494490584750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11626952221223006382.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,10380,0.096815,6132,2,2162,5,12516,6,0,148,10597,0
Converting to forward existential form...Done !
original formula: E(AF(!(AX(FALSE))) U AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(!(!(EX(!(FALSE)))))))) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.376755,11636,1,0,45,28374,57,25,930,20365,49
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-02 23:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1921ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1921ms
[2025-06-02 23:51:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:28] [INFO ] Implicit Places using invariants in 77 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2011 ms. Remains : 32/33 places, 22/22 transitions.
[2025-06-02 23:51:28] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:28] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:51:28] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-02 23:51:28] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:28] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality793236454759121700.gal : 1 ms
[2025-06-02 23:51:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality16667134518501268881.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/CTLCardinality793236454759121700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16667134518501268881.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,10380,0.075929,5392,2,1384,5,8905,6,0,156,8118,0
Converting to forward existential form...Done !
original formula: AX(EG(E(EF((ATP<3)) U ((E((DHAP<=a2) U (NADH<=c2)) * (Pi<3)) * (NADplus>0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(E(TRUE U (ATP<3)) U ((E((DHAP<=a2) U (NADH<=c2)) * (Pi<3)) * (NADplus>0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.410456,11792,1,0,91,34906,73,51,1075,33019,135
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-02 23:51:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2341ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 2342ms
[2025-06-02 23:51:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:31] [INFO ] Implicit Places using invariants in 65 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2413 ms. Remains : 31/33 places, 22/22 transitions.
[2025-06-02 23:51:31] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:51:31] [INFO ] Flatten gal took : 11 ms
[2025-06-02 23:51:31] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-02 23:51:31] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:31] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:51:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality7946153162355074798.gal : 1 ms
[2025-06-02 23:51:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13791587819817915790.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/CTLCardinality7946153162355074798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13791587819817915790.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,10380,0.089581,6944,2,2397,5,15639,6,0,153,14382,0
Converting to forward existential form...Done !
original formula: AF(AX(EF((a1<=ADP))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E(TRUE U (a1<=ADP)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.426674,14752,1,0,45,44225,69,25,1054,36940,55
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions 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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 28 transition count 18
Applied a total of 8 rules in 5 ms. Remains 28 /33 variables (removed 5) and now considering 18/22 (removed 4) transitions.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 28 cols
[2025-06-02 23:51:31] [INFO ] Computed 12 invariants in 1 ms
[2025-06-02 23:51:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 17/45 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/46 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/46 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 17/45 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/46 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/46 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 58 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2549ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 2549ms
[2025-06-02 23:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:34] [INFO ] Implicit Places using invariants in 48 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 27/33 places, 18/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 16
Applied a total of 5 rules in 2 ms. Remains 24 /27 variables (removed 3) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 24 cols
[2025-06-02 23:51:34] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-02 23:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 23:51:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 24/33 places, 16/22 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2706 ms. Remains : 24/33 places, 16/22 transitions.
[2025-06-02 23:51:34] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:34] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:34] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-02 23:51:34] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:34] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5758296589193985196.gal : 0 ms
[2025-06-02 23:51:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality16966543994773565246.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/CTLCardinality5758296589193985196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16966543994773565246.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,645,0.023088,4092,2,491,5,2028,6,0,118,1759,0
Converting to forward existential form...Done !
original formula: EG((AF((AG((Pi>NADPH)) + (AF((R5P>NADH)) * AF((b2>a2))))) * EF(EG(AG((R5P>FBP))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((!(E(TRUE U !((Pi>NADPH)))) + (!(EG(!((R5P>NADH)))) * !(EG(!((b2>a2))))))))) * E(TRUE U EG(!(...192
Reverse transition relation is NOT exact ! Due to transitions t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.068614,5500,1,0,37,6940,64,19,820,5359,42
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 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 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 9 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 26 cols
[2025-06-02 23:51:34] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1972ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1972ms
[2025-06-02 23:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:36] [INFO ] Implicit Places using invariants in 61 ms returned [0, 3, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/33 places, 17/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 19 transition count 14
Applied a total of 7 rules in 3 ms. Remains 19 /23 variables (removed 4) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 19 cols
[2025-06-02 23:51:36] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-02 23:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:36] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 19/33 places, 14/22 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2153 ms. Remains : 19/33 places, 14/22 transitions.
[2025-06-02 23:51:36] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:36] [INFO ] Flatten gal took : 1 ms
[2025-06-02 23:51:36] [INFO ] Input system was already deterministic with 14 transitions.
[2025-06-02 23:51:36] [INFO ] Flatten gal took : 6 ms
[2025-06-02 23:51:36] [INFO ] Flatten gal took : 6 ms
[2025-06-02 23:51:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10681304952593907087.gal : 1 ms
[2025-06-02 23:51:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8794468676719478910.prop : 5 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10681304952593907087.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8794468676719478910.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 36503 steps (7 resets) in 104 ms. (347 steps per ms) remains 0/1 properties
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8794468676719478910.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-02 23:51:36] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2211ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 2212ms
[2025-06-02 23:51:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:38] [INFO ] Implicit Places using invariants in 56 ms returned [0, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2273 ms. Remains : 30/33 places, 22/22 transitions.
[2025-06-02 23:51:39] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:51:39] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:39] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-02 23:51:39] [INFO ] Flatten gal took : 1 ms
[2025-06-02 23:51:39] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17952855472743346872.gal : 1 ms
[2025-06-02 23:51:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality17529824570608726984.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/CTLCardinality17952855472743346872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17529824570608726984.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,10380,0.090482,6128,2,2162,5,12516,6,0,148,10597,0
Converting to forward existential form...Done !
original formula: AX(((G6P>0) + EX((G6P>0))))
=> equivalent forward existential formula: [((EY(Init) * !((G6P>0))) * !(EX((G6P>0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.384956,12272,1,0,48,30587,59,28,948,21065,52
FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-02 23:51:39] [INFO ] Flatten gal took : 2 ms
[2025-06-02 23:51:39] [INFO ] Flatten gal took : 2 ms
Total runtime 38148 ms.
BK_STOP 1748908299479
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="GPPP-PT-C0001N0000000001"
export BK_EXAMINATION="CTLCardinality"
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 GPPP-PT-C0001N0000000001, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007600241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000001.tgz
mv GPPP-PT-C0001N0000000001 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;