About the Execution of ITS-Tools for FunctionPointer-PT-c002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ??????FTFTFF?F?? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400114.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 FunctionPointer-PT-c002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400114
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c002-CTLFireability-2023-12
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2023-13
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2023-14
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2023-15
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-00
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-01
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-02
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-03
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-04
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-05
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-06
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-07
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-08
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-09
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-10
FORMULA_NAME FunctionPointer-PT-c002-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748814103000
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-01 21:41:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 21:41:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 21:41:46] [INFO ] Load time of PNML (sax parser for PT used): 964 ms
[2025-06-01 21:41:46] [INFO ] Transformed 2826 places.
[2025-06-01 21:41:46] [INFO ] Transformed 8960 transitions.
[2025-06-01 21:41:47] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 1259 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Deduced a syphon composed of 1198 places in 54 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c002-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 288 places :
Symmetric choice reduction at 1 with 288 rule applications. Total rules 305 place count 1323 transition count 3834
Iterating global reduction 1 with 288 rules applied. Total rules applied 593 place count 1323 transition count 3834
Ensure Unique test removed 442 transitions
Reduce isomorphic transitions removed 442 transitions.
Iterating post reduction 1 with 442 rules applied. Total rules applied 1035 place count 1323 transition count 3392
Discarding 145 places :
Symmetric choice reduction at 2 with 145 rule applications. Total rules 1180 place count 1178 transition count 3102
Iterating global reduction 2 with 145 rules applied. Total rules applied 1325 place count 1178 transition count 3102
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 1421 place count 1178 transition count 3006
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1434 place count 1165 transition count 2980
Iterating global reduction 3 with 13 rules applied. Total rules applied 1447 place count 1165 transition count 2980
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1460 place count 1152 transition count 2954
Iterating global reduction 3 with 13 rules applied. Total rules applied 1473 place count 1152 transition count 2954
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1486 place count 1139 transition count 2928
Iterating global reduction 3 with 13 rules applied. Total rules applied 1499 place count 1139 transition count 2928
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1512 place count 1126 transition count 2902
Iterating global reduction 3 with 13 rules applied. Total rules applied 1525 place count 1126 transition count 2902
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1538 place count 1113 transition count 2876
Iterating global reduction 3 with 13 rules applied. Total rules applied 1551 place count 1113 transition count 2876
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1563 place count 1101 transition count 2852
Iterating global reduction 3 with 12 rules applied. Total rules applied 1575 place count 1101 transition count 2852
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1586 place count 1090 transition count 2830
Iterating global reduction 3 with 11 rules applied. Total rules applied 1597 place count 1090 transition count 2830
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1636 place count 1051 transition count 2686
Iterating global reduction 3 with 39 rules applied. Total rules applied 1675 place count 1051 transition count 2686
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1722 place count 1004 transition count 2498
Iterating global reduction 3 with 47 rules applied. Total rules applied 1769 place count 1004 transition count 2498
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1815 place count 958 transition count 2378
Iterating global reduction 3 with 46 rules applied. Total rules applied 1861 place count 958 transition count 2378
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1907 place count 912 transition count 2286
Iterating global reduction 3 with 46 rules applied. Total rules applied 1953 place count 912 transition count 2286
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1998 place count 867 transition count 2196
Iterating global reduction 3 with 45 rules applied. Total rules applied 2043 place count 867 transition count 2196
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 2088 place count 822 transition count 2106
Iterating global reduction 3 with 45 rules applied. Total rules applied 2133 place count 822 transition count 2106
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2177 place count 778 transition count 2018
Iterating global reduction 3 with 44 rules applied. Total rules applied 2221 place count 778 transition count 2018
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 2234 place count 765 transition count 1992
Iterating global reduction 3 with 13 rules applied. Total rules applied 2247 place count 765 transition count 1992
Applied a total of 2247 rules in 2109 ms. Remains 765 /1628 variables (removed 863) and now considering 1992/5962 (removed 3970) transitions.
[2025-06-01 21:41:49] [INFO ] Flow matrix only has 1338 transitions (discarded 654 similar events)
// Phase 1: matrix 1338 rows 765 cols
[2025-06-01 21:41:49] [INFO ] Computed 2 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:41:50] [INFO ] Implicit Places using invariants in 1533 ms returned []
[2025-06-01 21:41:50] [INFO ] Flow matrix only has 1338 transitions (discarded 654 similar events)
[2025-06-01 21:41:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:41:52] [INFO ] State equation strengthened by 320 read => feed constraints.
[2025-06-01 21:41:55] [INFO ] Implicit Places using invariants and state equation in 5007 ms returned []
Implicit Place search using SMT with State Equation took 6596 ms to find 0 implicit places.
Running 1990 sub problems to find dead transitions.
[2025-06-01 21:41:56] [INFO ] Flow matrix only has 1338 transitions (discarded 654 similar events)
[2025-06-01 21:41:56] [INFO ] Invariant cache hit.
[2025-06-01 21:41:56] [INFO ] State equation strengthened by 320 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1990 unsolved
SMT process timed out in 36887ms, After SMT, problems are : Problem set: 0 solved, 1990 unsolved
Search for dead transitions found 0 dead transitions in 36953ms
Starting structural reductions in LTL mode, iteration 1 : 765/1628 places, 1992/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45716 ms. Remains : 765/1628 places, 1992/5962 transitions.
Support contains 30 out of 765 places after structural reductions.
[2025-06-01 21:42:33] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-06-01 21:42:33] [INFO ] Flatten gal took : 332 ms
FORMULA FunctionPointer-PT-c002-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 21:42:33] [INFO ] Flatten gal took : 168 ms
[2025-06-01 21:42:34] [INFO ] Input system was already deterministic with 1992 transitions.
Support contains 26 out of 765 places (down from 30) after GAL structural reductions.
RANDOM walk for 40001 steps (8 resets) in 3757 ms. (10 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
[2025-06-01 21:42:35] [INFO ] Flow matrix only has 1338 transitions (discarded 654 similar events)
[2025-06-01 21:42:35] [INFO ] Invariant cache hit.
[2025-06-01 21:42:35] [INFO ] State equation strengthened by 320 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 382/398 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 988/1386 variables, 398/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1386 variables, 236/635 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1386 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 570/1956 variables, 251/886 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1956 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1956 variables, 84/971 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 146/2102 variables, 115/1086 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:42:39] [INFO ] Deduced a trap composed of 131 places in 482 ms of which 21 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2102 variables, 1/1087 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2102 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 1/2103 variables, 1/1088 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2103/2103 variables, and 1088 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 765/765 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 13/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 382/398 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 988/1386 variables, 398/399 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1386 variables, 236/635 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1386 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 570/1956 variables, 251/886 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1956 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1956 variables, 84/971 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 12/983 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1956/2103 variables, and 984 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 649/765 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 13/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10126ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 756 transition count 1970
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 756 transition count 1970
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 756 transition count 1968
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 748 transition count 1950
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 748 transition count 1950
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 741 transition count 1928
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 741 transition count 1928
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 735 transition count 1908
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 735 transition count 1908
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 729 transition count 1896
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 729 transition count 1896
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 724 transition count 1886
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 724 transition count 1886
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 719 transition count 1876
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 719 transition count 1876
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 715 transition count 1868
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 715 transition count 1868
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 711 transition count 1860
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 711 transition count 1860
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 134 place count 711 transition count 1836
Applied a total of 134 rules in 777 ms. Remains 711 /765 variables (removed 54) and now considering 1836/1992 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 711/765 places, 1836/1992 transitions.
RANDOM walk for 40002 steps (8 resets) in 455 ms. (87 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
[2025-06-01 21:42:47] [INFO ] Flow matrix only has 1229 transitions (discarded 607 similar events)
// Phase 1: matrix 1229 rows 711 cols
[2025-06-01 21:42:47] [INFO ] Computed 2 invariants in 24 ms
[2025-06-01 21:42:47] [INFO ] State equation strengthened by 296 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/394 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 934/1328 variables, 394/395 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1328 variables, 217/612 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1328 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 480/1808 variables, 214/826 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1808 variables, 1/827 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1808 variables, 79/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1808 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 117/1925 variables, 95/1001 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1925 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 10/1935 variables, 5/1006 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1935 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 5/1940 variables, 3/1009 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1940 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/1940 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1940/1940 variables, and 1009 constraints, problems are : Problem set: 0 solved, 9 unsolved in 8927 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 711/711 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 383/394 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 934/1328 variables, 394/395 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1328 variables, 217/612 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1328 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 480/1808 variables, 214/826 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1808 variables, 1/827 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1808 variables, 79/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1808 variables, 9/915 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:00] [INFO ] Deduced a trap composed of 131 places in 437 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1808 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:03] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:03] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:03] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:04] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:04] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:04] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:04] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:05] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:05] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:05] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:05] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1808 variables, 11/927 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:09] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:09] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:09] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:09] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:09] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:09] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:10] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:10] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:10] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:10] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:10] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:10] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:11] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:11] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:11] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:11] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:11] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:11] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:11] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:12] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1808 variables, 20/947 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:13] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:14] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:14] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:14] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:15] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:15] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:15] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:15] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:16] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:16] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:16] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:16] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:16] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:16] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:17] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:17] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1808 variables, 16/963 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:20] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:21] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1808 variables, 2/965 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1808 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 117/1925 variables, 95/1060 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:28] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:28] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1925 variables, 3/1063 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:32] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:33] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:33] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:33] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:33] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:33] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:33] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1925 variables, 7/1070 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:38] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:39] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:39] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:39] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:39] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1925 variables, 5/1075 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1925/1940 variables, and 1075 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/711 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 64/64 constraints]
After SMT, in 54070ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 1836/1836 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 707 transition count 1824
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 707 transition count 1824
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 707 transition count 1822
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 704 transition count 1816
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 704 transition count 1816
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 702 transition count 1810
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 702 transition count 1810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 700 transition count 1806
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 700 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 698 transition count 1802
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 698 transition count 1802
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 696 transition count 1798
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 696 transition count 1798
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 694 transition count 1794
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 694 transition count 1794
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 691 transition count 1784
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 691 transition count 1784
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 688 transition count 1778
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 688 transition count 1778
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 686 transition count 1774
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 686 transition count 1774
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 684 transition count 1770
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 684 transition count 1770
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 682 transition count 1766
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 682 transition count 1766
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 680 transition count 1762
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 680 transition count 1762
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 678 transition count 1758
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 678 transition count 1758
Applied a total of 68 rules in 786 ms. Remains 678 /711 variables (removed 33) and now considering 1758/1836 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 786 ms. Remains : 678/711 places, 1758/1836 transitions.
RANDOM walk for 40001 steps (8 resets) in 533 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
[2025-06-01 21:43:42] [INFO ] Flow matrix only has 1176 transitions (discarded 582 similar events)
// Phase 1: matrix 1176 rows 678 cols
[2025-06-01 21:43:42] [INFO ] Computed 2 invariants in 8 ms
[2025-06-01 21:43:42] [INFO ] State equation strengthened by 286 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 817/1209 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 73/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 535/1744 variables, 194/660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1744 variables, 213/873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1744 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/1745 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1745 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1745 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 105/1850 variables, 87/962 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1850 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/1854 variables, 4/966 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1854 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1854 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1854/1854 variables, and 966 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 678/678 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 817/1209 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 73/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 535/1744 variables, 194/660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1744 variables, 213/873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1744 variables, 8/881 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:51] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:51] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1744 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1744 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/1745 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1745 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:56] [INFO ] Deduced a trap composed of 131 places in 326 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1745 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:59] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:59] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:59] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:59] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:59] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:43:59] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:00] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:00] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:00] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:00] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:00] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:00] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:01] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:01] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:01] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:01] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:01] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:01] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:01] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:02] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1745 variables, 20/906 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:04] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:04] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:04] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:04] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:04] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:05] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:05] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:05] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:05] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:05] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:05] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:06] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:06] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:06] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:06] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:06] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:06] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:06] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:07] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:07] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1745 variables, 20/926 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:09] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:09] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:09] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:09] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:09] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:09] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1745 variables, 6/932 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:13] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:13] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:13] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:14] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:14] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:14] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:14] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:14] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:14] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:15] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:15] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:15] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:15] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:15] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:15] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:15] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 16/948 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 105/1850 variables, 87/1035 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1850 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 4/1854 variables, 4/1039 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1854 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/1854 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1854/1854 variables, and 1039 constraints, problems are : Problem set: 0 solved, 8 unsolved in 44135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 678/678 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 64/64 constraints]
After SMT, in 49728ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 1 properties in 586 ms.
Support contains 8 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1758/1758 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 677 transition count 1756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 677 transition count 1756
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 676 transition count 1752
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 676 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 675 transition count 1750
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 675 transition count 1750
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 674 transition count 1748
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 674 transition count 1748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 673 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 673 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 672 transition count 1744
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 672 transition count 1744
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 671 transition count 1742
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 671 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 670 transition count 1740
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 670 transition count 1740
Applied a total of 16 rules in 283 ms. Remains 670 /678 variables (removed 8) and now considering 1740/1758 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 670/678 places, 1740/1758 transitions.
[2025-06-01 21:44:33] [INFO ] Flatten gal took : 89 ms
[2025-06-01 21:44:33] [INFO ] Flatten gal took : 99 ms
[2025-06-01 21:44:33] [INFO ] Input system was already deterministic with 1992 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 746 transition count 1942
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 746 transition count 1942
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 746 transition count 1934
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 64 place count 728 transition count 1896
Iterating global reduction 1 with 18 rules applied. Total rules applied 82 place count 728 transition count 1896
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 728 transition count 1892
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 101 place count 713 transition count 1844
Iterating global reduction 2 with 15 rules applied. Total rules applied 116 place count 713 transition count 1844
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 698 transition count 1792
Iterating global reduction 2 with 15 rules applied. Total rules applied 146 place count 698 transition count 1792
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 162 place count 682 transition count 1752
Iterating global reduction 2 with 16 rules applied. Total rules applied 178 place count 682 transition count 1752
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 193 place count 667 transition count 1718
Iterating global reduction 2 with 15 rules applied. Total rules applied 208 place count 667 transition count 1718
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 223 place count 652 transition count 1688
Iterating global reduction 2 with 15 rules applied. Total rules applied 238 place count 652 transition count 1688
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 252 place count 638 transition count 1658
Iterating global reduction 2 with 14 rules applied. Total rules applied 266 place count 638 transition count 1658
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 280 place count 624 transition count 1628
Iterating global reduction 2 with 14 rules applied. Total rules applied 294 place count 624 transition count 1628
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 299 place count 619 transition count 1618
Iterating global reduction 2 with 5 rules applied. Total rules applied 304 place count 619 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 307 place count 616 transition count 1612
Iterating global reduction 2 with 3 rules applied. Total rules applied 310 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 311 place count 615 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 312 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 313 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 314 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 315 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 316 place count 613 transition count 1606
Applied a total of 316 rules in 293 ms. Remains 613 /765 variables (removed 152) and now considering 1606/1992 (removed 386) transitions.
[2025-06-01 21:44:33] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2025-06-01 21:44:33] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:34] [INFO ] Implicit Places using invariants in 990 ms returned []
[2025-06-01 21:44:34] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2025-06-01 21:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-01 21:44:38] [INFO ] Implicit Places using invariants and state equation in 3588 ms returned []
Implicit Place search using SMT with State Equation took 4580 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2025-06-01 21:44:38] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2025-06-01 21:44:38] [INFO ] Invariant cache hit.
[2025-06-01 21:44:38] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63547ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 63553ms
Starting structural reductions in LTL mode, iteration 1 : 613/765 places, 1606/1992 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68430 ms. Remains : 613/765 places, 1606/1992 transitions.
[2025-06-01 21:45:42] [INFO ] Flatten gal took : 89 ms
[2025-06-01 21:45:42] [INFO ] Flatten gal took : 91 ms
[2025-06-01 21:45:42] [INFO ] Input system was already deterministic with 1606 transitions.
[2025-06-01 21:45:42] [INFO ] Flatten gal took : 83 ms
[2025-06-01 21:45:42] [INFO ] Flatten gal took : 83 ms
[2025-06-01 21:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2276191481994489170.gal : 57 ms
[2025-06-01 21:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14821705997284177362.ctl : 7 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/CTLFireability2276191481994489170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14821705997284177362.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.
Detected timeout of ITS tools.
[2025-06-01 21:46:12] [INFO ] Flatten gal took : 48 ms
[2025-06-01 21:46:12] [INFO ] Applying decomposition
[2025-06-01 21:46:12] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4780499618025885618.txt' '-o' '/tmp/graph4780499618025885618.bin' '-w' '/tmp/graph4780499618025885618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4780499618025885618.bin' '-l' '-1' '-v' '-w' '/tmp/graph4780499618025885618.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:46:13] [INFO ] Decomposing Gal with order
[2025-06-01 21:46:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:46:13] [INFO ] Removed a total of 2666 redundant transitions.
[2025-06-01 21:46:13] [INFO ] Flatten gal took : 354 ms
[2025-06-01 21:46:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1193 labels/synchronizations in 129 ms.
[2025-06-01 21:46:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8019405630765964893.gal : 30 ms
[2025-06-01 21:46:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14246765707093317256.ctl : 3 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/CTLFireability8019405630765964893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14246765707093317256.ctl'
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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 748 transition count 1946
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 748 transition count 1946
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 748 transition count 1940
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 732 transition count 1904
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 732 transition count 1904
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 76 place count 732 transition count 1900
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 719 transition count 1856
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 719 transition count 1856
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 114 place count 707 transition count 1816
Iterating global reduction 2 with 12 rules applied. Total rules applied 126 place count 707 transition count 1816
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 140 place count 693 transition count 1782
Iterating global reduction 2 with 14 rules applied. Total rules applied 154 place count 693 transition count 1782
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 167 place count 680 transition count 1750
Iterating global reduction 2 with 13 rules applied. Total rules applied 180 place count 680 transition count 1750
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 193 place count 667 transition count 1724
Iterating global reduction 2 with 13 rules applied. Total rules applied 206 place count 667 transition count 1724
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 655 transition count 1700
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 655 transition count 1700
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 241 place count 644 transition count 1678
Iterating global reduction 2 with 11 rules applied. Total rules applied 252 place count 644 transition count 1678
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 641 transition count 1672
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 641 transition count 1672
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 261 place count 638 transition count 1666
Iterating global reduction 2 with 3 rules applied. Total rules applied 264 place count 638 transition count 1666
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 272 place count 638 transition count 1658
Applied a total of 272 rules in 688 ms. Remains 638 /765 variables (removed 127) and now considering 1658/1992 (removed 334) transitions.
[2025-06-01 21:46:44] [INFO ] Flow matrix only has 1108 transitions (discarded 550 similar events)
// Phase 1: matrix 1108 rows 638 cols
[2025-06-01 21:46:44] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:46:45] [INFO ] Implicit Places using invariants in 617 ms returned []
[2025-06-01 21:46:45] [INFO ] Flow matrix only has 1108 transitions (discarded 550 similar events)
[2025-06-01 21:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:46:45] [INFO ] State equation strengthened by 272 read => feed constraints.
[2025-06-01 21:46:48] [INFO ] Implicit Places using invariants and state equation in 2767 ms returned []
Implicit Place search using SMT with State Equation took 3399 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:46:48] [INFO ] Redundant transitions in 243 ms returned []
Running 1656 sub problems to find dead transitions.
[2025-06-01 21:46:48] [INFO ] Flow matrix only has 1108 transitions (discarded 550 similar events)
[2025-06-01 21:46:48] [INFO ] Invariant cache hit.
[2025-06-01 21:46:48] [INFO ] State equation strengthened by 272 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
SMT process timed out in 33537ms, After SMT, problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 33556ms
Starting structural reductions in SI_CTL mode, iteration 1 : 638/765 places, 1658/1992 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37904 ms. Remains : 638/765 places, 1658/1992 transitions.
[2025-06-01 21:47:21] [INFO ] Flatten gal took : 80 ms
[2025-06-01 21:47:22] [INFO ] Flatten gal took : 86 ms
[2025-06-01 21:47:22] [INFO ] Input system was already deterministic with 1658 transitions.
[2025-06-01 21:47:22] [INFO ] Flatten gal took : 82 ms
[2025-06-01 21:47:22] [INFO ] Flatten gal took : 83 ms
[2025-06-01 21:47:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8952068170129981470.gal : 15 ms
[2025-06-01 21:47:22] [INFO ] Time to serialize properties into /tmp/CTLFireability324028056071211988.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/CTLFireability8952068170129981470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability324028056071211988.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.
Detected timeout of ITS tools.
[2025-06-01 21:47:52] [INFO ] Flatten gal took : 49 ms
[2025-06-01 21:47:52] [INFO ] Applying decomposition
[2025-06-01 21:47:52] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5295835756142820933.txt' '-o' '/tmp/graph5295835756142820933.bin' '-w' '/tmp/graph5295835756142820933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5295835756142820933.bin' '-l' '-1' '-v' '-w' '/tmp/graph5295835756142820933.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:47:52] [INFO ] Decomposing Gal with order
[2025-06-01 21:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:47:52] [INFO ] Removed a total of 2775 redundant transitions.
[2025-06-01 21:47:53] [INFO ] Flatten gal took : 117 ms
[2025-06-01 21:47:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1242 labels/synchronizations in 66 ms.
[2025-06-01 21:47:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1985009123163912018.gal : 16 ms
[2025-06-01 21:47:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15727910793057967856.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/CTLFireability1985009123163912018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15727910793057967856.ctl'
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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 748 transition count 1950
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 748 transition count 1950
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 42 place count 748 transition count 1942
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 732 transition count 1906
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 732 transition count 1906
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 82 place count 732 transition count 1898
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 95 place count 719 transition count 1858
Iterating global reduction 2 with 13 rules applied. Total rules applied 108 place count 719 transition count 1858
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 121 place count 706 transition count 1816
Iterating global reduction 2 with 13 rules applied. Total rules applied 134 place count 706 transition count 1816
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 148 place count 692 transition count 1780
Iterating global reduction 2 with 14 rules applied. Total rules applied 162 place count 692 transition count 1780
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 175 place count 679 transition count 1750
Iterating global reduction 2 with 13 rules applied. Total rules applied 188 place count 679 transition count 1750
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 201 place count 666 transition count 1724
Iterating global reduction 2 with 13 rules applied. Total rules applied 214 place count 666 transition count 1724
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 226 place count 654 transition count 1698
Iterating global reduction 2 with 12 rules applied. Total rules applied 238 place count 654 transition count 1698
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 249 place count 643 transition count 1674
Iterating global reduction 2 with 11 rules applied. Total rules applied 260 place count 643 transition count 1674
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 265 place count 638 transition count 1664
Iterating global reduction 2 with 5 rules applied. Total rules applied 270 place count 638 transition count 1664
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 273 place count 635 transition count 1658
Iterating global reduction 2 with 3 rules applied. Total rules applied 276 place count 635 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 277 place count 634 transition count 1656
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 634 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 279 place count 633 transition count 1654
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 281 place count 632 transition count 1652
Iterating global reduction 2 with 1 rules applied. Total rules applied 282 place count 632 transition count 1652
Applied a total of 282 rules in 523 ms. Remains 632 /765 variables (removed 133) and now considering 1652/1992 (removed 340) transitions.
[2025-06-01 21:48:23] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
// Phase 1: matrix 1103 rows 632 cols
[2025-06-01 21:48:23] [INFO ] Computed 2 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:48:24] [INFO ] Implicit Places using invariants in 908 ms returned []
[2025-06-01 21:48:24] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2025-06-01 21:48:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:48:25] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-01 21:48:29] [INFO ] Implicit Places using invariants and state equation in 4675 ms returned []
Implicit Place search using SMT with State Equation took 5589 ms to find 0 implicit places.
Running 1650 sub problems to find dead transitions.
[2025-06-01 21:48:29] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2025-06-01 21:48:29] [INFO ] Invariant cache hit.
[2025-06-01 21:48:29] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
SMT process timed out in 33742ms, After SMT, problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 33752ms
Starting structural reductions in LTL mode, iteration 1 : 632/765 places, 1652/1992 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39872 ms. Remains : 632/765 places, 1652/1992 transitions.
[2025-06-01 21:49:03] [INFO ] Flatten gal took : 59 ms
[2025-06-01 21:49:03] [INFO ] Flatten gal took : 68 ms
[2025-06-01 21:49:03] [INFO ] Input system was already deterministic with 1652 transitions.
[2025-06-01 21:49:03] [INFO ] Flatten gal took : 66 ms
[2025-06-01 21:49:03] [INFO ] Flatten gal took : 67 ms
[2025-06-01 21:49:03] [INFO ] Time to serialize gal into /tmp/CTLFireability11129154917734994683.gal : 11 ms
[2025-06-01 21:49:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14005175187047032708.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/CTLFireability11129154917734994683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14005175187047032708.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.
Detected timeout of ITS tools.
[2025-06-01 21:49:33] [INFO ] Flatten gal took : 43 ms
[2025-06-01 21:49:33] [INFO ] Applying decomposition
[2025-06-01 21:49:33] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7108340785237319630.txt' '-o' '/tmp/graph7108340785237319630.bin' '-w' '/tmp/graph7108340785237319630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7108340785237319630.bin' '-l' '-1' '-v' '-w' '/tmp/graph7108340785237319630.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:49:33] [INFO ] Decomposing Gal with order
[2025-06-01 21:49:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:49:33] [INFO ] Removed a total of 2744 redundant transitions.
[2025-06-01 21:49:33] [INFO ] Flatten gal took : 95 ms
[2025-06-01 21:49:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1207 labels/synchronizations in 58 ms.
[2025-06-01 21:49:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12744992030789356103.gal : 14 ms
[2025-06-01 21:49:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4677430584697539639.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/CTLFireability12744992030789356103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4677430584697539639.ctl'
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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 748 transition count 1948
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 748 transition count 1948
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 44 place count 748 transition count 1938
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 732 transition count 1902
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 732 transition count 1902
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 732 transition count 1898
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 93 place count 719 transition count 1854
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 719 transition count 1854
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 705 transition count 1806
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 705 transition count 1806
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 149 place count 690 transition count 1768
Iterating global reduction 2 with 15 rules applied. Total rules applied 164 place count 690 transition count 1768
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 179 place count 675 transition count 1734
Iterating global reduction 2 with 15 rules applied. Total rules applied 194 place count 675 transition count 1734
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 209 place count 660 transition count 1704
Iterating global reduction 2 with 15 rules applied. Total rules applied 224 place count 660 transition count 1704
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 238 place count 646 transition count 1674
Iterating global reduction 2 with 14 rules applied. Total rules applied 252 place count 646 transition count 1674
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 265 place count 633 transition count 1646
Iterating global reduction 2 with 13 rules applied. Total rules applied 278 place count 633 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 283 place count 628 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 288 place count 628 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 625 transition count 1630
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 295 place count 624 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 624 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 297 place count 623 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 623 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 299 place count 622 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 300 place count 622 transition count 1624
Applied a total of 300 rules in 290 ms. Remains 622 /765 variables (removed 143) and now considering 1624/1992 (removed 368) transitions.
[2025-06-01 21:50:04] [INFO ] Flow matrix only has 1088 transitions (discarded 536 similar events)
// Phase 1: matrix 1088 rows 622 cols
[2025-06-01 21:50:04] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:50:05] [INFO ] Implicit Places using invariants in 999 ms returned []
[2025-06-01 21:50:05] [INFO ] Flow matrix only has 1088 transitions (discarded 536 similar events)
[2025-06-01 21:50:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:50:05] [INFO ] State equation strengthened by 270 read => feed constraints.
[2025-06-01 21:50:08] [INFO ] Implicit Places using invariants and state equation in 3529 ms returned []
Implicit Place search using SMT with State Equation took 4533 ms to find 0 implicit places.
Running 1622 sub problems to find dead transitions.
[2025-06-01 21:50:08] [INFO ] Flow matrix only has 1088 transitions (discarded 536 similar events)
[2025-06-01 21:50:08] [INFO ] Invariant cache hit.
[2025-06-01 21:50:08] [INFO ] State equation strengthened by 270 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
SMT process timed out in 33779ms, After SMT, problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 33784ms
Starting structural reductions in LTL mode, iteration 1 : 622/765 places, 1624/1992 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38612 ms. Remains : 622/765 places, 1624/1992 transitions.
[2025-06-01 21:50:42] [INFO ] Flatten gal took : 59 ms
[2025-06-01 21:50:42] [INFO ] Flatten gal took : 66 ms
[2025-06-01 21:50:42] [INFO ] Input system was already deterministic with 1624 transitions.
[2025-06-01 21:50:43] [INFO ] Flatten gal took : 66 ms
[2025-06-01 21:50:43] [INFO ] Flatten gal took : 68 ms
[2025-06-01 21:50:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17308219694098165512.gal : 18 ms
[2025-06-01 21:50:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5042354944646213382.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/CTLFireability17308219694098165512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5042354944646213382.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.
Detected timeout of ITS tools.
[2025-06-01 21:51:13] [INFO ] Flatten gal took : 43 ms
[2025-06-01 21:51:13] [INFO ] Applying decomposition
[2025-06-01 21:51:13] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5922955979589536360.txt' '-o' '/tmp/graph5922955979589536360.bin' '-w' '/tmp/graph5922955979589536360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5922955979589536360.bin' '-l' '-1' '-v' '-w' '/tmp/graph5922955979589536360.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:51:13] [INFO ] Decomposing Gal with order
[2025-06-01 21:51:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:51:13] [INFO ] Removed a total of 2698 redundant transitions.
[2025-06-01 21:51:13] [INFO ] Flatten gal took : 89 ms
[2025-06-01 21:51:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1234 labels/synchronizations in 47 ms.
[2025-06-01 21:51:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13724026831799323546.gal : 12 ms
[2025-06-01 21:51:13] [INFO ] Time to serialize properties into /tmp/CTLFireability18330138537683026445.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/CTLFireability13724026831799323546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18330138537683026445.ctl'
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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 746 transition count 1942
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 746 transition count 1942
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 746 transition count 1934
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 64 place count 728 transition count 1894
Iterating global reduction 1 with 18 rules applied. Total rules applied 82 place count 728 transition count 1894
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 728 transition count 1890
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 101 place count 713 transition count 1842
Iterating global reduction 2 with 15 rules applied. Total rules applied 116 place count 713 transition count 1842
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 698 transition count 1792
Iterating global reduction 2 with 15 rules applied. Total rules applied 146 place count 698 transition count 1792
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 162 place count 682 transition count 1752
Iterating global reduction 2 with 16 rules applied. Total rules applied 178 place count 682 transition count 1752
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 193 place count 667 transition count 1718
Iterating global reduction 2 with 15 rules applied. Total rules applied 208 place count 667 transition count 1718
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 223 place count 652 transition count 1688
Iterating global reduction 2 with 15 rules applied. Total rules applied 238 place count 652 transition count 1688
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 252 place count 638 transition count 1658
Iterating global reduction 2 with 14 rules applied. Total rules applied 266 place count 638 transition count 1658
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 279 place count 625 transition count 1630
Iterating global reduction 2 with 13 rules applied. Total rules applied 292 place count 625 transition count 1630
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 297 place count 620 transition count 1620
Iterating global reduction 2 with 5 rules applied. Total rules applied 302 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 617 transition count 1614
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 309 place count 616 transition count 1612
Iterating global reduction 2 with 1 rules applied. Total rules applied 310 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 311 place count 615 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 312 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 313 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 314 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 318 place count 614 transition count 1604
Applied a total of 318 rules in 763 ms. Remains 614 /765 variables (removed 151) and now considering 1604/1992 (removed 388) transitions.
[2025-06-01 21:51:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2025-06-01 21:51:44] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:45] [INFO ] Implicit Places using invariants in 1032 ms returned []
[2025-06-01 21:51:45] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-01 21:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-01 21:51:49] [INFO ] Implicit Places using invariants and state equation in 3649 ms returned []
Implicit Place search using SMT with State Equation took 4683 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:51:49] [INFO ] Redundant transitions in 49 ms returned []
Running 1602 sub problems to find dead transitions.
[2025-06-01 21:51:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-01 21:51:49] [INFO ] Invariant cache hit.
[2025-06-01 21:51:49] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63300ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63303ms
Starting structural reductions in SI_CTL mode, iteration 1 : 614/765 places, 1604/1992 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68806 ms. Remains : 614/765 places, 1604/1992 transitions.
[2025-06-01 21:52:52] [INFO ] Flatten gal took : 52 ms
[2025-06-01 21:52:52] [INFO ] Flatten gal took : 60 ms
[2025-06-01 21:52:52] [INFO ] Input system was already deterministic with 1604 transitions.
[2025-06-01 21:52:52] [INFO ] Flatten gal took : 61 ms
[2025-06-01 21:52:52] [INFO ] Flatten gal took : 61 ms
[2025-06-01 21:52:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3502011355299592706.gal : 11 ms
[2025-06-01 21:52:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10857132623418681271.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/CTLFireability3502011355299592706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10857132623418681271.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.
Detected timeout of ITS tools.
[2025-06-01 21:53:22] [INFO ] Flatten gal took : 34 ms
[2025-06-01 21:53:22] [INFO ] Applying decomposition
[2025-06-01 21:53:22] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14296336482654219045.txt' '-o' '/tmp/graph14296336482654219045.bin' '-w' '/tmp/graph14296336482654219045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14296336482654219045.bin' '-l' '-1' '-v' '-w' '/tmp/graph14296336482654219045.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:53:23] [INFO ] Decomposing Gal with order
[2025-06-01 21:53:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:53:23] [INFO ] Removed a total of 2664 redundant transitions.
[2025-06-01 21:53:23] [INFO ] Flatten gal took : 77 ms
[2025-06-01 21:53:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1216 labels/synchronizations in 65 ms.
[2025-06-01 21:53:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2155584555693124779.gal : 29 ms
[2025-06-01 21:53:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2196230089253343983.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/CTLFireability2155584555693124779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2196230089253343983.ctl'
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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 747 transition count 1944
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 747 transition count 1944
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 747 transition count 1940
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 58 place count 729 transition count 1900
Iterating global reduction 1 with 18 rules applied. Total rules applied 76 place count 729 transition count 1900
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 729 transition count 1896
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 713 transition count 1844
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 713 transition count 1844
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 128 place count 697 transition count 1790
Iterating global reduction 2 with 16 rules applied. Total rules applied 144 place count 697 transition count 1790
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 161 place count 680 transition count 1748
Iterating global reduction 2 with 17 rules applied. Total rules applied 178 place count 680 transition count 1748
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 193 place count 665 transition count 1714
Iterating global reduction 2 with 15 rules applied. Total rules applied 208 place count 665 transition count 1714
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 223 place count 650 transition count 1684
Iterating global reduction 2 with 15 rules applied. Total rules applied 238 place count 650 transition count 1684
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 252 place count 636 transition count 1656
Iterating global reduction 2 with 14 rules applied. Total rules applied 266 place count 636 transition count 1656
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 279 place count 623 transition count 1630
Iterating global reduction 2 with 13 rules applied. Total rules applied 292 place count 623 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 296 place count 619 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 300 place count 619 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 302 place count 617 transition count 1618
Iterating global reduction 2 with 2 rules applied. Total rules applied 304 place count 617 transition count 1618
Applied a total of 304 rules in 244 ms. Remains 617 /765 variables (removed 148) and now considering 1618/1992 (removed 374) transitions.
[2025-06-01 21:53:53] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 617 cols
[2025-06-01 21:53:53] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:53:54] [INFO ] Implicit Places using invariants in 699 ms returned []
[2025-06-01 21:53:54] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2025-06-01 21:53:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:53:54] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-01 21:53:59] [INFO ] Implicit Places using invariants and state equation in 4795 ms returned []
Implicit Place search using SMT with State Equation took 5495 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2025-06-01 21:53:59] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2025-06-01 21:53:59] [INFO ] Invariant cache hit.
[2025-06-01 21:53:59] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63591ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 63595ms
Starting structural reductions in LTL mode, iteration 1 : 617/765 places, 1618/1992 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69342 ms. Remains : 617/765 places, 1618/1992 transitions.
[2025-06-01 21:55:02] [INFO ] Flatten gal took : 53 ms
[2025-06-01 21:55:02] [INFO ] Flatten gal took : 61 ms
[2025-06-01 21:55:03] [INFO ] Input system was already deterministic with 1618 transitions.
[2025-06-01 21:55:03] [INFO ] Flatten gal took : 60 ms
[2025-06-01 21:55:03] [INFO ] Flatten gal took : 60 ms
[2025-06-01 21:55:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5681769901584250591.gal : 10 ms
[2025-06-01 21:55:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17936144810207629004.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/CTLFireability5681769901584250591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17936144810207629004.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.
Detected timeout of ITS tools.
[2025-06-01 21:55:33] [INFO ] Flatten gal took : 35 ms
[2025-06-01 21:55:33] [INFO ] Applying decomposition
[2025-06-01 21:55:33] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1040872574954076227.txt' '-o' '/tmp/graph1040872574954076227.bin' '-w' '/tmp/graph1040872574954076227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1040872574954076227.bin' '-l' '-1' '-v' '-w' '/tmp/graph1040872574954076227.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:55:33] [INFO ] Decomposing Gal with order
[2025-06-01 21:55:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:55:33] [INFO ] Removed a total of 2688 redundant transitions.
[2025-06-01 21:55:33] [INFO ] Flatten gal took : 68 ms
[2025-06-01 21:55:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1210 labels/synchronizations in 40 ms.
[2025-06-01 21:55:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6908591371117386106.gal : 11 ms
[2025-06-01 21:55:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13171479968425455687.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/CTLFireability6908591371117386106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13171479968425455687.ctl'
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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 747 transition count 1946
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 747 transition count 1946
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 46 place count 747 transition count 1936
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 730 transition count 1898
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 730 transition count 1898
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 84 place count 730 transition count 1894
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 98 place count 716 transition count 1850
Iterating global reduction 2 with 14 rules applied. Total rules applied 112 place count 716 transition count 1850
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 702 transition count 1804
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 702 transition count 1804
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 155 place count 687 transition count 1766
Iterating global reduction 2 with 15 rules applied. Total rules applied 170 place count 687 transition count 1766
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 184 place count 673 transition count 1734
Iterating global reduction 2 with 14 rules applied. Total rules applied 198 place count 673 transition count 1734
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 212 place count 659 transition count 1706
Iterating global reduction 2 with 14 rules applied. Total rules applied 226 place count 659 transition count 1706
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 239 place count 646 transition count 1678
Iterating global reduction 2 with 13 rules applied. Total rules applied 252 place count 646 transition count 1678
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 264 place count 634 transition count 1652
Iterating global reduction 2 with 12 rules applied. Total rules applied 276 place count 634 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 281 place count 629 transition count 1642
Iterating global reduction 2 with 5 rules applied. Total rules applied 286 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 289 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 292 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 293 place count 625 transition count 1634
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 295 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 297 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 623 transition count 1630
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 304 place count 623 transition count 1624
Applied a total of 304 rules in 509 ms. Remains 623 /765 variables (removed 142) and now considering 1624/1992 (removed 368) transitions.
[2025-06-01 21:56:04] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2025-06-01 21:56:04] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:56:04] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-01 21:56:04] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2025-06-01 21:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:56:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-01 21:56:08] [INFO ] Implicit Places using invariants and state equation in 3421 ms returned []
Implicit Place search using SMT with State Equation took 4174 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:56:08] [INFO ] Redundant transitions in 256 ms returned []
Running 1622 sub problems to find dead transitions.
[2025-06-01 21:56:08] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2025-06-01 21:56:08] [INFO ] Invariant cache hit.
[2025-06-01 21:56:08] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/1622 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63410ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 63414ms
Starting structural reductions in SI_CTL mode, iteration 1 : 623/765 places, 1624/1992 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68365 ms. Remains : 623/765 places, 1624/1992 transitions.
[2025-06-01 21:57:12] [INFO ] Flatten gal took : 53 ms
[2025-06-01 21:57:12] [INFO ] Flatten gal took : 62 ms
[2025-06-01 21:57:12] [INFO ] Input system was already deterministic with 1624 transitions.
[2025-06-01 21:57:12] [INFO ] Flatten gal took : 60 ms
[2025-06-01 21:57:12] [INFO ] Flatten gal took : 65 ms
[2025-06-01 21:57:12] [INFO ] Time to serialize gal into /tmp/CTLFireability14173687592834418728.gal : 10 ms
[2025-06-01 21:57:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5180790586806941349.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/CTLFireability14173687592834418728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5180790586806941349.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.
Detected timeout of ITS tools.
[2025-06-01 21:57:42] [INFO ] Flatten gal took : 37 ms
[2025-06-01 21:57:42] [INFO ] Applying decomposition
[2025-06-01 21:57:42] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13064975303087533306.txt' '-o' '/tmp/graph13064975303087533306.bin' '-w' '/tmp/graph13064975303087533306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13064975303087533306.bin' '-l' '-1' '-v' '-w' '/tmp/graph13064975303087533306.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:57:42] [INFO ] Decomposing Gal with order
[2025-06-01 21:57:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:57:42] [INFO ] Removed a total of 2698 redundant transitions.
[2025-06-01 21:57:42] [INFO ] Flatten gal took : 87 ms
[2025-06-01 21:57:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1198 labels/synchronizations in 73 ms.
[2025-06-01 21:57:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4825028245058618716.gal : 15 ms
[2025-06-01 21:57:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17862033250891696773.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/CTLFireability4825028245058618716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17862033250891696773.ctl'
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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 746 transition count 1944
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 746 transition count 1944
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 48 place count 746 transition count 1934
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 728 transition count 1894
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 728 transition count 1894
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 728 transition count 1890
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 104 place count 712 transition count 1838
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 712 transition count 1838
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 136 place count 696 transition count 1784
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 696 transition count 1784
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 168 place count 680 transition count 1746
Iterating global reduction 2 with 16 rules applied. Total rules applied 184 place count 680 transition count 1746
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 199 place count 665 transition count 1714
Iterating global reduction 2 with 15 rules applied. Total rules applied 214 place count 665 transition count 1714
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 229 place count 650 transition count 1684
Iterating global reduction 2 with 15 rules applied. Total rules applied 244 place count 650 transition count 1684
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 258 place count 636 transition count 1654
Iterating global reduction 2 with 14 rules applied. Total rules applied 272 place count 636 transition count 1654
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 285 place count 623 transition count 1626
Iterating global reduction 2 with 13 rules applied. Total rules applied 298 place count 623 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 302 place count 619 transition count 1618
Iterating global reduction 2 with 4 rules applied. Total rules applied 306 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 308 place count 617 transition count 1614
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 311 place count 616 transition count 1612
Iterating global reduction 2 with 1 rules applied. Total rules applied 312 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 313 place count 615 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 314 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 315 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 316 place count 614 transition count 1608
Applied a total of 316 rules in 287 ms. Remains 614 /765 variables (removed 151) and now considering 1608/1992 (removed 384) transitions.
[2025-06-01 21:58:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2025-06-01 21:58:13] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:58:14] [INFO ] Implicit Places using invariants in 1097 ms returned []
[2025-06-01 21:58:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-01 21:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:58:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-01 21:58:17] [INFO ] Implicit Places using invariants and state equation in 3498 ms returned []
Implicit Place search using SMT with State Equation took 4597 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-01 21:58:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-01 21:58:17] [INFO ] Invariant cache hit.
[2025-06-01 21:58:17] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 5)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 1)
(s517 0)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64427ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 64430ms
Starting structural reductions in LTL mode, iteration 1 : 614/765 places, 1608/1992 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69319 ms. Remains : 614/765 places, 1608/1992 transitions.
[2025-06-01 21:59:22] [INFO ] Flatten gal took : 51 ms
[2025-06-01 21:59:22] [INFO ] Flatten gal took : 59 ms
[2025-06-01 21:59:22] [INFO ] Input system was already deterministic with 1608 transitions.
[2025-06-01 21:59:22] [INFO ] Flatten gal took : 58 ms
[2025-06-01 21:59:22] [INFO ] Flatten gal took : 59 ms
[2025-06-01 21:59:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14672141692594241691.gal : 9 ms
[2025-06-01 21:59:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11248373705765860769.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/CTLFireability14672141692594241691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11248373705765860769.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.
Detected timeout of ITS tools.
[2025-06-01 21:59:52] [INFO ] Flatten gal took : 34 ms
[2025-06-01 21:59:52] [INFO ] Applying decomposition
[2025-06-01 21:59:52] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17528218630090747344.txt' '-o' '/tmp/graph17528218630090747344.bin' '-w' '/tmp/graph17528218630090747344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17528218630090747344.bin' '-l' '-1' '-v' '-w' '/tmp/graph17528218630090747344.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:59:52] [INFO ] Decomposing Gal with order
[2025-06-01 21:59:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:59:52] [INFO ] Removed a total of 2672 redundant transitions.
[2025-06-01 21:59:52] [INFO ] Flatten gal took : 71 ms
[2025-06-01 21:59:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1114 labels/synchronizations in 41 ms.
[2025-06-01 21:59:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18364173912640307366.gal : 7 ms
[2025-06-01 21:59:52] [INFO ] Time to serialize properties into /tmp/CTLFireability9951383709903805625.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/CTLFireability18364173912640307366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9951383709903805625.ctl'
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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 765/765 places, 1992/1992 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 747 transition count 1946
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 747 transition count 1946
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 747 transition count 1940
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 731 transition count 1906
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 731 transition count 1906
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 88 place count 717 transition count 1858
Iterating global reduction 1 with 14 rules applied. Total rules applied 102 place count 717 transition count 1858
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 116 place count 703 transition count 1808
Iterating global reduction 1 with 14 rules applied. Total rules applied 130 place count 703 transition count 1808
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 144 place count 689 transition count 1776
Iterating global reduction 1 with 14 rules applied. Total rules applied 158 place count 689 transition count 1776
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 171 place count 676 transition count 1750
Iterating global reduction 1 with 13 rules applied. Total rules applied 184 place count 676 transition count 1750
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 197 place count 663 transition count 1724
Iterating global reduction 1 with 13 rules applied. Total rules applied 210 place count 663 transition count 1724
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 224 place count 649 transition count 1692
Iterating global reduction 1 with 14 rules applied. Total rules applied 238 place count 649 transition count 1692
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 251 place count 636 transition count 1662
Iterating global reduction 1 with 13 rules applied. Total rules applied 264 place count 636 transition count 1662
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 268 place count 632 transition count 1654
Iterating global reduction 1 with 4 rules applied. Total rules applied 272 place count 632 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 274 place count 630 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 276 place count 630 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 278 place count 628 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 280 place count 628 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 282 place count 626 transition count 1642
Iterating global reduction 1 with 2 rules applied. Total rules applied 284 place count 626 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 286 place count 624 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 288 place count 624 transition count 1638
Applied a total of 288 rules in 418 ms. Remains 624 /765 variables (removed 141) and now considering 1638/1992 (removed 354) transitions.
[2025-06-01 22:00:23] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 624 cols
[2025-06-01 22:00:23] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:00:24] [INFO ] Implicit Places using invariants in 953 ms returned []
[2025-06-01 22:00:24] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2025-06-01 22:00:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:00:24] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-01 22:00:28] [INFO ] Implicit Places using invariants and state equation in 3816 ms returned []
Implicit Place search using SMT with State Equation took 4774 ms to find 0 implicit places.
Running 1636 sub problems to find dead transitions.
[2025-06-01 22:00:28] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2025-06-01 22:00:28] [INFO ] Invariant cache hit.
[2025-06-01 22:00:28] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
SMT process timed out in 33837ms, After SMT, problems are : Problem set: 0 solved, 1636 unsolved
Search for dead transitions found 0 dead transitions in 33840ms
Starting structural reductions in LTL mode, iteration 1 : 624/765 places, 1638/1992 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39036 ms. Remains : 624/765 places, 1638/1992 transitions.
[2025-06-01 22:01:02] [INFO ] Flatten gal took : 51 ms
[2025-06-01 22:01:02] [INFO ] Flatten gal took : 60 ms
[2025-06-01 22:01:02] [INFO ] Input system was already deterministic with 1638 transitions.
[2025-06-01 22:01:02] [INFO ] Flatten gal took : 60 ms
[2025-06-01 22:01:02] [INFO ] Flatten gal took : 60 ms
[2025-06-01 22:01:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14539256877909927057.gal : 10 ms
[2025-06-01 22:01:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9707608074797840647.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/CTLFireability14539256877909927057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9707608074797840647.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.
Detected timeout of ITS tools.
[2025-06-01 22:01:32] [INFO ] Flatten gal took : 35 ms
[2025-06-01 22:01:32] [INFO ] Applying decomposition
[2025-06-01 22:01:32] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1672875367043679779.txt' '-o' '/tmp/graph1672875367043679779.bin' '-w' '/tmp/graph1672875367043679779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1672875367043679779.bin' '-l' '-1' '-v' '-w' '/tmp/graph1672875367043679779.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:01:32] [INFO ] Decomposing Gal with order
[2025-06-01 22:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:01:32] [INFO ] Removed a total of 2734 redundant transitions.
[2025-06-01 22:01:32] [INFO ] Flatten gal took : 94 ms
[2025-06-01 22:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1232 labels/synchronizations in 58 ms.
[2025-06-01 22:01:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10867829935672409182.gal : 11 ms
[2025-06-01 22:01:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13469214030319698562.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/CTLFireability10867829935672409182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13469214030319698562.ctl'
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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 22:02:02] [INFO ] Flatten gal took : 43 ms
[2025-06-01 22:02:02] [INFO ] Flatten gal took : 44 ms
[2025-06-01 22:02:02] [INFO ] Applying decomposition
[2025-06-01 22:02:03] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8028977668173545209.txt' '-o' '/tmp/graph8028977668173545209.bin' '-w' '/tmp/graph8028977668173545209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8028977668173545209.bin' '-l' '-1' '-v' '-w' '/tmp/graph8028977668173545209.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:02:03] [INFO ] Decomposing Gal with order
[2025-06-01 22:02:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:02:03] [INFO ] Removed a total of 3293 redundant transitions.
[2025-06-01 22:02:03] [INFO ] Flatten gal took : 139 ms
[2025-06-01 22:02:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1648 labels/synchronizations in 80 ms.
[2025-06-01 22:02:03] [INFO ] Time to serialize gal into /tmp/CTLFireability18350244946226124559.gal : 15 ms
[2025-06-01 22:02:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10594152234385137695.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/CTLFireability18350244946226124559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10594152234385137695.ctl'
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 -...264
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 22:28:48] [INFO ] Flatten gal took : 50 ms
[2025-06-01 22:28:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10715368454488269384.gal : 7 ms
[2025-06-01 22:28:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3522483688853281971.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/CTLFireability10715368454488269384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3522483688853281971.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 9 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007400114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c002.tgz
mv FunctionPointer-PT-c002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;