fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654447200465
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBNT-PT-S05J60

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16204.668 2715156.00 2956918.00 1811.80 ?TF?T?TTFF?TT?T? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200465.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S05J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716930997752

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 21:16:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:16:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:16:39] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-28 21:16:39] [INFO ] Transformed 909 places.
[2024-05-28 21:16:39] [INFO ] Transformed 1970 transitions.
[2024-05-28 21:16:39] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 779 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Applied a total of 0 rules in 30 ms. Remains 909 /909 variables (removed 0) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-05-28 21:16:39] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 21:16:39] [INFO ] Computed 142 invariants in 105 ms
[2024-05-28 21:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2220 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20118 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2220 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 43559ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 43601ms
[2024-05-28 21:17:23] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:17:23] [INFO ] Invariant cache hit.
[2024-05-28 21:17:23] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-28 21:17:23] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:17:23] [INFO ] Invariant cache hit.
[2024-05-28 21:17:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:17:25] [INFO ] Implicit Places using invariants and state equation in 2342 ms returned []
Implicit Place search using SMT with State Equation took 2658 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-05-28 21:17:25] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:17:25] [INFO ] Invariant cache hit.
[2024-05-28 21:17:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1314 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/909 variables, 11/142 constraints. Problems are: Problem set: 95 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 909/2220 variables, and 142 constraints, problems are : Problem set: 95 solved, 1214 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 95 solved, 1214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 95 solved, 1214 unsolved
[2024-05-28 21:18:12] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 1/132 constraints. Problems are: Problem set: 95 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2220 variables, and 132 constraints, problems are : Problem set: 95 solved, 1214 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 1/1 constraints]
After SMT, in 63001ms problems are : Problem set: 95 solved, 1214 unsolved
Search for dead transitions found 95 dead transitions in 63014ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in LTL mode, iteration 1 : 909/909 places, 1220/1315 transitions.
Applied a total of 0 rules in 9 ms. Remains 909 /909 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109372 ms. Remains : 909/909 places, 1220/1315 transitions.
Support contains 779 out of 909 places after structural reductions.
[2024-05-28 21:18:29] [INFO ] Flatten gal took : 192 ms
[2024-05-28 21:18:29] [INFO ] Flatten gal took : 150 ms
[2024-05-28 21:18:30] [INFO ] Input system was already deterministic with 1220 transitions.
Support contains 778 out of 909 places (down from 779) after GAL structural reductions.
RANDOM walk for 40000 steps (2767 resets) in 2757 ms. (14 steps per ms) remains 40/54 properties
BEST_FIRST walk for 4003 steps (98 resets) in 74 ms. (53 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (98 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (99 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (44 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (64 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (64 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (55 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (99 resets) in 51 ms. (76 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (61 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (98 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (60 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (43 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (45 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (68 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (37 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (52 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (47 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (46 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (65 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (61 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (37 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (36 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (60 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (55 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (87 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (61 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (55 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (67 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (63 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
[2024-05-28 21:18:31] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 909 cols
[2024-05-28 21:18:31] [INFO ] Computed 142 invariants in 48 ms
[2024-05-28 21:18:31] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 515/869 variables, 112/112 constraints. Problems are: Problem set: 25 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 1/113 constraints. Problems are: Problem set: 25 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 0/113 constraints. Problems are: Problem set: 25 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 4 (OVERLAPS) 39/908 variables, 29/142 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 0/142 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1216/2124 variables, 908/1050 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2124 variables, 1/1051 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2124 variables, 0/1051 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/2125 variables, 1/1052 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2125 variables, 0/1052 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2125 variables, 0/1052 constraints. Problems are: Problem set: 37 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2125/2125 variables, and 1052 constraints, problems are : Problem set: 37 solved, 3 unsolved in 1789 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 37 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 214/221 variables, 7/7 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/7 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 283/504 variables, 48/55 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/55 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 215/719 variables, 43/98 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 0/98 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 175/894 variables, 30/128 constraints. Problems are: Problem set: 37 solved, 3 unsolved
[2024-05-28 21:18:34] [INFO ] Deduced a trap composed of 170 places in 466 ms of which 7 ms to minimize.
[2024-05-28 21:18:34] [INFO ] Deduced a trap composed of 24 places in 575 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/894 variables, 2/130 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/894 variables, 0/130 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 14/908 variables, 14/144 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/908 variables, 0/144 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1216/2124 variables, 908/1052 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2124 variables, 1/1053 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2124 variables, 3/1056 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2124 variables, 0/1056 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/2125 variables, 1/1057 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2125 variables, 0/1057 constraints. Problems are: Problem set: 37 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2125 variables, 0/1057 constraints. Problems are: Problem set: 37 solved, 3 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 2125/2125 variables, and 1057 constraints, problems are : Problem set: 37 solved, 3 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/40 constraints, Known Traps: 2/2 constraints]
After SMT, in 6987ms problems are : Problem set: 37 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 133 place count 840 transition count 1156
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 133 place count 840 transition count 1091
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 263 place count 775 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 774 transition count 1090
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 774 transition count 1090
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 269 place count 772 transition count 1088
Applied a total of 269 rules in 552 ms. Remains 772 /909 variables (removed 137) and now considering 1088/1220 (removed 132) transitions.
Running 1082 sub problems to find dead transitions.
[2024-05-28 21:18:39] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
// Phase 1: matrix 1084 rows 772 cols
[2024-05-28 21:18:39] [INFO ] Computed 137 invariants in 38 ms
[2024-05-28 21:18:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:18:50] [INFO ] Deduced a trap composed of 253 places in 318 ms of which 5 ms to minimize.
[2024-05-28 21:18:50] [INFO ] Deduced a trap composed of 208 places in 332 ms of which 6 ms to minimize.
[2024-05-28 21:18:51] [INFO ] Deduced a trap composed of 207 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:18:51] [INFO ] Deduced a trap composed of 207 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:18:51] [INFO ] Deduced a trap composed of 208 places in 344 ms of which 5 ms to minimize.
[2024-05-28 21:18:52] [INFO ] Deduced a trap composed of 211 places in 319 ms of which 6 ms to minimize.
[2024-05-28 21:18:52] [INFO ] Deduced a trap composed of 267 places in 221 ms of which 3 ms to minimize.
[2024-05-28 21:18:53] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 5 ms to minimize.
[2024-05-28 21:18:53] [INFO ] Deduced a trap composed of 256 places in 283 ms of which 5 ms to minimize.
[2024-05-28 21:18:54] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:18:54] [INFO ] Deduced a trap composed of 199 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:18:54] [INFO ] Deduced a trap composed of 199 places in 252 ms of which 3 ms to minimize.
[2024-05-28 21:18:54] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 3 ms to minimize.
[2024-05-28 21:18:55] [INFO ] Deduced a trap composed of 241 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:18:55] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:18:56] [INFO ] Deduced a trap composed of 250 places in 327 ms of which 5 ms to minimize.
[2024-05-28 21:18:57] [INFO ] Deduced a trap composed of 244 places in 296 ms of which 5 ms to minimize.
[2024-05-28 21:18:57] [INFO ] Deduced a trap composed of 198 places in 282 ms of which 3 ms to minimize.
[2024-05-28 21:18:57] [INFO ] Deduced a trap composed of 199 places in 252 ms of which 3 ms to minimize.
[2024-05-28 21:18:58] [INFO ] Deduced a trap composed of 211 places in 337 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:19:00] [INFO ] Deduced a trap composed of 198 places in 319 ms of which 5 ms to minimize.
[2024-05-28 21:19:00] [INFO ] Deduced a trap composed of 198 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:19:01] [INFO ] Deduced a trap composed of 204 places in 353 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1856 variables, and 155 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 23/155 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 142 places in 321 ms of which 4 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 198 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 206 places in 247 ms of which 3 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 147 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 135 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:19:06] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:19:06] [INFO ] Deduced a trap composed of 213 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:19:06] [INFO ] Deduced a trap composed of 210 places in 306 ms of which 4 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 207 places in 238 ms of which 20 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 238 places in 339 ms of which 4 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 238 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 250 places in 234 ms of which 3 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 248 places in 234 ms of which 4 ms to minimize.
[2024-05-28 21:19:09] [INFO ] Deduced a trap composed of 250 places in 535 ms of which 6 ms to minimize.
[2024-05-28 21:19:09] [INFO ] Deduced a trap composed of 289 places in 247 ms of which 3 ms to minimize.
[2024-05-28 21:19:09] [INFO ] Deduced a trap composed of 247 places in 338 ms of which 5 ms to minimize.
[2024-05-28 21:19:10] [INFO ] Deduced a trap composed of 273 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:19:10] [INFO ] Deduced a trap composed of 254 places in 298 ms of which 4 ms to minimize.
[2024-05-28 21:19:10] [INFO ] Deduced a trap composed of 248 places in 278 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1856 variables, and 175 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 43/43 constraints]
After SMT, in 42177ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 42201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42770 ms. Remains : 772/909 places, 1088/1220 transitions.
RANDOM walk for 12734 steps (668 resets) in 654 ms. (19 steps per ms) remains 0/3 properties
Successfully simplified 37 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:19:21] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 21:19:21] [INFO ] Flatten gal took : 131 ms
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:19:21] [INFO ] Flatten gal took : 117 ms
[2024-05-28 21:19:22] [INFO ] Input system was already deterministic with 1220 transitions.
Support contains 378 out of 909 places (down from 515) after GAL structural reductions.
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 67 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:19:22] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-05-28 21:19:22] [INFO ] Computed 137 invariants in 33 ms
[2024-05-28 21:19:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 18/24 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:19:49] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 21:19:49] [INFO ] Deduced a trap composed of 137 places in 121 ms of which 3 ms to minimize.
[2024-05-28 21:19:51] [INFO ] Deduced a trap composed of 138 places in 103 ms of which 2 ms to minimize.
[2024-05-28 21:19:52] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:19:53] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 2 ms to minimize.
[2024-05-28 21:19:54] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 3 ms to minimize.
[2024-05-28 21:19:58] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:19:58] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 139 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 18/24 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 8/8 constraints]
After SMT, in 42250ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42259ms
[2024-05-28 21:20:04] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:20:04] [INFO ] Invariant cache hit.
[2024-05-28 21:20:05] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2024-05-28 21:20:05] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:20:05] [INFO ] Invariant cache hit.
[2024-05-28 21:20:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:20:19] [INFO ] Implicit Places using invariants and state equation in 13845 ms returned []
Implicit Place search using SMT with State Equation took 15176 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:20:19] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:20:19] [INFO ] Invariant cache hit.
[2024-05-28 21:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:20:54] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 4 ms to minimize.
[2024-05-28 21:20:56] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 3 ms to minimize.
[2024-05-28 21:20:56] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 8 ms to minimize.
[2024-05-28 21:21:00] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 4 ms to minimize.
[2024-05-28 21:21:00] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:21:02] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:21:02] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 137 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 137 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-28 21:21:11] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 113/113 constraints, Generalized P Invariants (flows): 18/24 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 62200ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 62210ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119728 ms. Remains : 903/909 places, 1219/1220 transitions.
[2024-05-28 21:21:21] [INFO ] Flatten gal took : 44 ms
[2024-05-28 21:21:21] [INFO ] Flatten gal took : 45 ms
[2024-05-28 21:21:22] [INFO ] Input system was already deterministic with 1219 transitions.
[2024-05-28 21:21:22] [INFO ] Flatten gal took : 42 ms
[2024-05-28 21:21:22] [INFO ] Flatten gal took : 41 ms
[2024-05-28 21:21:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6421528784483944962.gal : 25 ms
[2024-05-28 21:21:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12862219684171486788.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6421528784483944962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12862219684171486788.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:21:52] [INFO ] Flatten gal took : 43 ms
[2024-05-28 21:21:52] [INFO ] Applying decomposition
[2024-05-28 21:21:52] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3374625885879501030.txt' '-o' '/tmp/graph3374625885879501030.bin' '-w' '/tmp/graph3374625885879501030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3374625885879501030.bin' '-l' '-1' '-v' '-w' '/tmp/graph3374625885879501030.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:21:52] [INFO ] Decomposing Gal with order
[2024-05-28 21:21:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:21:53] [INFO ] Removed a total of 1608 redundant transitions.
[2024-05-28 21:21:53] [INFO ] Flatten gal took : 482 ms
[2024-05-28 21:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 72 ms.
[2024-05-28 21:21:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17182769071236563748.gal : 17 ms
[2024-05-28 21:21:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16270873547713614157.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17182769071236563748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16270873547713614157.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 41 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:22:23] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-05-28 21:22:23] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 21:22:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:22:49] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 6 ms to minimize.
[2024-05-28 21:22:49] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:22:50] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 3 ms to minimize.
[2024-05-28 21:22:52] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 2 ms to minimize.
[2024-05-28 21:22:52] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 3 ms to minimize.
[2024-05-28 21:22:53] [INFO ] Deduced a trap composed of 137 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:22:56] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 21:22:56] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 2 ms to minimize.
[2024-05-28 21:22:58] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 2 ms to minimize.
[2024-05-28 21:22:59] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
[2024-05-28 21:23:01] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:23:05] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
[2024-05-28 21:23:05] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 144 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 13/13 constraints]
After SMT, in 42813ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42827ms
[2024-05-28 21:23:06] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:23:06] [INFO ] Invariant cache hit.
[2024-05-28 21:23:08] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2024-05-28 21:23:08] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:23:08] [INFO ] Invariant cache hit.
[2024-05-28 21:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:23:29] [INFO ] Implicit Places using invariants and state equation in 20928 ms returned []
Implicit Place search using SMT with State Equation took 22475 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:23:29] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:23:29] [INFO ] Invariant cache hit.
[2024-05-28 21:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:24:13] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:24:13] [INFO ] Deduced a trap composed of 140 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:24:13] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:24:18] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 2 ms to minimize.
[2024-05-28 21:24:18] [INFO ] Deduced a trap composed of 140 places in 125 ms of which 2 ms to minimize.
[2024-05-28 21:24:18] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:24:18] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 2 ms to minimize.
[2024-05-28 21:24:18] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 2 ms to minimize.
[2024-05-28 21:24:19] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 1 ms to minimize.
[2024-05-28 21:24:19] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 1 ms to minimize.
[2024-05-28 21:24:19] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:24:25] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 2 ms to minimize.
[2024-05-28 21:24:28] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 2 ms to minimize.
[2024-05-28 21:24:28] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(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 1)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(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 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(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 1)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(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 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(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 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 1)
(s209 1)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 10)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(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 1)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 1)
(s446 1)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 1)
(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 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 1)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 1)
(s514 1)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 1)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 145 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 14/14 constraints]
After SMT, in 62519ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 62541ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127893 ms. Remains : 903/909 places, 1219/1220 transitions.
[2024-05-28 21:24:31] [INFO ] Flatten gal took : 81 ms
[2024-05-28 21:24:31] [INFO ] Flatten gal took : 77 ms
[2024-05-28 21:24:31] [INFO ] Input system was already deterministic with 1219 transitions.
[2024-05-28 21:24:32] [INFO ] Flatten gal took : 136 ms
[2024-05-28 21:24:32] [INFO ] Flatten gal took : 81 ms
[2024-05-28 21:24:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality4032973628895573326.gal : 20 ms
[2024-05-28 21:24:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality13285584236371259765.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4032973628895573326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13285584236371259765.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:25:02] [INFO ] Flatten gal took : 73 ms
[2024-05-28 21:25:02] [INFO ] Applying decomposition
[2024-05-28 21:25:02] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9225252984419914620.txt' '-o' '/tmp/graph9225252984419914620.bin' '-w' '/tmp/graph9225252984419914620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9225252984419914620.bin' '-l' '-1' '-v' '-w' '/tmp/graph9225252984419914620.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:25:02] [INFO ] Decomposing Gal with order
[2024-05-28 21:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:25:02] [INFO ] Removed a total of 1321 redundant transitions.
[2024-05-28 21:25:02] [INFO ] Flatten gal took : 202 ms
[2024-05-28 21:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 45 ms.
[2024-05-28 21:25:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality17069930188521160549.gal : 34 ms
[2024-05-28 21:25:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality11936752975435363966.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17069930188521160549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11936752975435363966.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 33 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:25:33] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:25:33] [INFO ] Invariant cache hit.
[2024-05-28 21:25:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:26:07] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:26:07] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:26:07] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
[2024-05-28 21:26:10] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 2 ms to minimize.
[2024-05-28 21:26:10] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:26:11] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 2 ms to minimize.
[2024-05-28 21:26:11] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 1 ms to minimize.
[2024-05-28 21:26:11] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 1 ms to minimize.
[2024-05-28 21:26:11] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 2 ms to minimize.
[2024-05-28 21:26:12] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 2 ms to minimize.
[2024-05-28 21:26:12] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
(s507 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(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 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 1)
(s55 0)
(s56 1)
(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 1)
(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 1)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 1)
(s105 1)
(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 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(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 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(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 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 4)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 4)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 1)
(s261 10)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 1)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 1)
(s417 1)
(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 1)
(s441 0)
(s442 1)
(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 1)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 1)
(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 1)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 42153ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42165ms
[2024-05-28 21:26:15] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:26:15] [INFO ] Invariant cache hit.
[2024-05-28 21:26:16] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2024-05-28 21:26:16] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:26:16] [INFO ] Invariant cache hit.
[2024-05-28 21:26:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:26:27] [INFO ] Implicit Places using invariants and state equation in 11634 ms returned []
Implicit Place search using SMT with State Equation took 12799 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:26:27] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:26:27] [INFO ] Invariant cache hit.
[2024-05-28 21:26:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 139 places in 139 ms of which 2 ms to minimize.
[2024-05-28 21:27:13] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:27:13] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 2 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 2 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:27:17] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:27:17] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 2 ms to minimize.
[2024-05-28 21:27:17] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 2 ms to minimize.
[2024-05-28 21:27:17] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 1 ms to minimize.
[2024-05-28 21:27:18] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 2 ms to minimize.
[2024-05-28 21:27:18] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:27:24] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 2 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 145 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 14/14 constraints]
After SMT, in 62711ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 62721ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117723 ms. Remains : 903/909 places, 1219/1220 transitions.
[2024-05-28 21:27:30] [INFO ] Flatten gal took : 54 ms
[2024-05-28 21:27:30] [INFO ] Flatten gal took : 83 ms
[2024-05-28 21:27:30] [INFO ] Input system was already deterministic with 1219 transitions.
[2024-05-28 21:27:31] [INFO ] Flatten gal took : 49 ms
[2024-05-28 21:27:31] [INFO ] Flatten gal took : 48 ms
[2024-05-28 21:27:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17580127245597085284.gal : 12 ms
[2024-05-28 21:27:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3790087145842972396.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17580127245597085284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3790087145842972396.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:28:01] [INFO ] Flatten gal took : 85 ms
[2024-05-28 21:28:01] [INFO ] Applying decomposition
[2024-05-28 21:28:01] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7354381633926649645.txt' '-o' '/tmp/graph7354381633926649645.bin' '-w' '/tmp/graph7354381633926649645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7354381633926649645.bin' '-l' '-1' '-v' '-w' '/tmp/graph7354381633926649645.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:28:01] [INFO ] Decomposing Gal with order
[2024-05-28 21:28:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:28:02] [INFO ] Removed a total of 1823 redundant transitions.
[2024-05-28 21:28:02] [INFO ] Flatten gal took : 509 ms
[2024-05-28 21:28:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 25 ms.
[2024-05-28 21:28:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15471405549930493582.gal : 21 ms
[2024-05-28 21:28:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality289416115584903337.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15471405549930493582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality289416115584903337.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1155
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1090
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1089
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1089
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1087
Applied a total of 266 rules in 181 ms. Remains 771 /909 variables (removed 138) and now considering 1087/1220 (removed 133) transitions.
Running 1081 sub problems to find dead transitions.
[2024-05-28 21:28:32] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2024-05-28 21:28:32] [INFO ] Computed 137 invariants in 28 ms
[2024-05-28 21:28:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 197 places in 365 ms of which 5 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 197 places in 333 ms of which 5 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 197 places in 302 ms of which 4 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 234 places in 306 ms of which 6 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 197 places in 298 ms of which 5 ms to minimize.
[2024-05-28 21:28:48] [INFO ] Deduced a trap composed of 197 places in 346 ms of which 5 ms to minimize.
[2024-05-28 21:28:48] [INFO ] Deduced a trap composed of 197 places in 343 ms of which 5 ms to minimize.
[2024-05-28 21:28:49] [INFO ] Deduced a trap composed of 197 places in 318 ms of which 5 ms to minimize.
[2024-05-28 21:28:49] [INFO ] Deduced a trap composed of 206 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:28:49] [INFO ] Deduced a trap composed of 206 places in 238 ms of which 3 ms to minimize.
[2024-05-28 21:28:49] [INFO ] Deduced a trap composed of 262 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:28:50] [INFO ] Deduced a trap composed of 207 places in 222 ms of which 4 ms to minimize.
[2024-05-28 21:28:50] [INFO ] Deduced a trap composed of 206 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:28:50] [INFO ] Deduced a trap composed of 203 places in 322 ms of which 5 ms to minimize.
[2024-05-28 21:28:50] [INFO ] Deduced a trap composed of 208 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 206 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 209 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 207 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 207 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:28:52] [INFO ] Deduced a trap composed of 208 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:28:53] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 212 places in 270 ms of which 4 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 197 places in 283 ms of which 5 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 251 places in 278 ms of which 4 ms to minimize.
SMT process timed out in 22549ms, After SMT, problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 22567ms
[2024-05-28 21:28:55] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2024-05-28 21:28:55] [INFO ] Invariant cache hit.
[2024-05-28 21:28:56] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2024-05-28 21:28:56] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2024-05-28 21:28:56] [INFO ] Invariant cache hit.
[2024-05-28 21:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:29:10] [INFO ] Implicit Places using invariants and state equation in 14193 ms returned []
Implicit Place search using SMT with State Equation took 15379 ms to find 0 implicit places.
[2024-05-28 21:29:10] [INFO ] Redundant transitions in 85 ms returned []
Running 1081 sub problems to find dead transitions.
[2024-05-28 21:29:10] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2024-05-28 21:29:10] [INFO ] Invariant cache hit.
[2024-05-28 21:29:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:29:22] [INFO ] Deduced a trap composed of 249 places in 339 ms of which 5 ms to minimize.
[2024-05-28 21:29:23] [INFO ] Deduced a trap composed of 243 places in 315 ms of which 4 ms to minimize.
[2024-05-28 21:29:23] [INFO ] Deduced a trap composed of 234 places in 314 ms of which 6 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 234 places in 302 ms of which 5 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 234 places in 311 ms of which 3 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 197 places in 272 ms of which 5 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 197 places in 272 ms of which 3 ms to minimize.
[2024-05-28 21:29:25] [INFO ] Deduced a trap composed of 197 places in 277 ms of which 4 ms to minimize.
[2024-05-28 21:29:25] [INFO ] Deduced a trap composed of 203 places in 273 ms of which 5 ms to minimize.
[2024-05-28 21:29:25] [INFO ] Deduced a trap composed of 203 places in 275 ms of which 5 ms to minimize.
[2024-05-28 21:29:26] [INFO ] Deduced a trap composed of 208 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:29:26] [INFO ] Deduced a trap composed of 211 places in 315 ms of which 4 ms to minimize.
[2024-05-28 21:29:26] [INFO ] Deduced a trap composed of 213 places in 330 ms of which 6 ms to minimize.
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 249 places in 284 ms of which 4 ms to minimize.
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 4 ms to minimize.
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 197 places in 276 ms of which 4 ms to minimize.
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 3 ms to minimize.
[2024-05-28 21:29:28] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 3 ms to minimize.
[2024-05-28 21:29:28] [INFO ] Deduced a trap composed of 197 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:29:28] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:29:30] [INFO ] Deduced a trap composed of 247 places in 358 ms of which 5 ms to minimize.
[2024-05-28 21:29:30] [INFO ] Deduced a trap composed of 197 places in 308 ms of which 5 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:29:32] [INFO ] Deduced a trap composed of 197 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:29:32] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:29:32] [INFO ] Deduced a trap composed of 240 places in 240 ms of which 3 ms to minimize.
[2024-05-28 21:29:33] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:29:33] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 3 ms to minimize.
[2024-05-28 21:29:33] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 5 ms to minimize.
[2024-05-28 21:29:33] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 3 ms to minimize.
[2024-05-28 21:29:34] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:29:34] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:29:34] [INFO ] Deduced a trap composed of 197 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:29:34] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 4 ms to minimize.
[2024-05-28 21:29:35] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 3 ms to minimize.
[2024-05-28 21:29:35] [INFO ] Deduced a trap composed of 210 places in 318 ms of which 3 ms to minimize.
[2024-05-28 21:29:36] [INFO ] Deduced a trap composed of 197 places in 331 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1854 variables, and 172 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
[2024-05-28 21:29:48] [INFO ] Deduced a trap composed of 249 places in 277 ms of which 3 ms to minimize.
[2024-05-28 21:29:48] [INFO ] Deduced a trap composed of 241 places in 236 ms of which 3 ms to minimize.
[2024-05-28 21:29:48] [INFO ] Deduced a trap composed of 240 places in 311 ms of which 5 ms to minimize.
[2024-05-28 21:29:49] [INFO ] Deduced a trap composed of 247 places in 299 ms of which 5 ms to minimize.
[2024-05-28 21:29:49] [INFO ] Deduced a trap composed of 246 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:29:49] [INFO ] Deduced a trap composed of 243 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:29:49] [INFO ] Deduced a trap composed of 231 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:29:50] [INFO ] Deduced a trap composed of 231 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:29:50] [INFO ] Deduced a trap composed of 246 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:29:50] [INFO ] Deduced a trap composed of 243 places in 233 ms of which 3 ms to minimize.
[2024-05-28 21:29:51] [INFO ] Deduced a trap composed of 258 places in 345 ms of which 5 ms to minimize.
[2024-05-28 21:29:51] [INFO ] Deduced a trap composed of 225 places in 318 ms of which 6 ms to minimize.
[2024-05-28 21:29:51] [INFO ] Deduced a trap composed of 197 places in 305 ms of which 6 ms to minimize.
[2024-05-28 21:29:52] [INFO ] Deduced a trap composed of 264 places in 338 ms of which 5 ms to minimize.
[2024-05-28 21:29:52] [INFO ] Deduced a trap composed of 255 places in 302 ms of which 5 ms to minimize.
[2024-05-28 21:29:52] [INFO ] Deduced a trap composed of 252 places in 298 ms of which 4 ms to minimize.
[2024-05-28 21:29:52] [INFO ] Deduced a trap composed of 252 places in 260 ms of which 3 ms to minimize.
[2024-05-28 21:29:53] [INFO ] Deduced a trap composed of 237 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:29:53] [INFO ] Deduced a trap composed of 240 places in 333 ms of which 5 ms to minimize.
[2024-05-28 21:29:53] [INFO ] Deduced a trap composed of 237 places in 338 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1854 variables, and 192 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1081 constraints, Known Traps: 60/60 constraints]
After SMT, in 62212ms problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 62220ms
Starting structural reductions in SI_CTL mode, iteration 1 : 771/909 places, 1087/1220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100449 ms. Remains : 771/909 places, 1087/1220 transitions.
[2024-05-28 21:30:13] [INFO ] Flatten gal took : 28 ms
[2024-05-28 21:30:13] [INFO ] Flatten gal took : 30 ms
[2024-05-28 21:30:13] [INFO ] Input system was already deterministic with 1087 transitions.
[2024-05-28 21:30:13] [INFO ] Flatten gal took : 29 ms
[2024-05-28 21:30:13] [INFO ] Flatten gal took : 29 ms
[2024-05-28 21:30:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2074561319942045907.gal : 6 ms
[2024-05-28 21:30:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13580195519103973937.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2074561319942045907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13580195519103973937.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:30:43] [INFO ] Flatten gal took : 71 ms
[2024-05-28 21:30:43] [INFO ] Applying decomposition
[2024-05-28 21:30:43] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph13861439227421844399.txt' '-o' '/tmp/graph13861439227421844399.bin' '-w' '/tmp/graph13861439227421844399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13861439227421844399.bin' '-l' '-1' '-v' '-w' '/tmp/graph13861439227421844399.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:30:43] [INFO ] Decomposing Gal with order
[2024-05-28 21:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:30:43] [INFO ] Removed a total of 368 redundant transitions.
[2024-05-28 21:30:43] [INFO ] Flatten gal took : 242 ms
[2024-05-28 21:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-28 21:30:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1851881115382138501.gal : 22 ms
[2024-05-28 21:30:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1654569786109594171.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1851881115382138501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1654569786109594171.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 68 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:31:14] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-05-28 21:31:14] [INFO ] Computed 137 invariants in 22 ms
[2024-05-28 21:31:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:31:39] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
[2024-05-28 21:31:40] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-05-28 21:31:40] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 2 ms to minimize.
[2024-05-28 21:31:42] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 2 ms to minimize.
[2024-05-28 21:31:42] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 3 ms to minimize.
[2024-05-28 21:31:44] [INFO ] Deduced a trap composed of 137 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:31:47] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 21:31:47] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:31:50] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:31:51] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:31:54] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 42425ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42439ms
[2024-05-28 21:31:56] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:31:56] [INFO ] Invariant cache hit.
[2024-05-28 21:31:57] [INFO ] Implicit Places using invariants in 1354 ms returned []
[2024-05-28 21:31:57] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:31:57] [INFO ] Invariant cache hit.
[2024-05-28 21:31:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:32:15] [INFO ] Implicit Places using invariants and state equation in 17178 ms returned []
Implicit Place search using SMT with State Equation took 18547 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:32:15] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:32:15] [INFO ] Invariant cache hit.
[2024-05-28 21:32:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:33:01] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 2 ms to minimize.
[2024-05-28 21:33:01] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 2 ms to minimize.
[2024-05-28 21:33:01] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 2 ms to minimize.
[2024-05-28 21:33:05] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 2 ms to minimize.
[2024-05-28 21:33:05] [INFO ] Deduced a trap composed of 140 places in 183 ms of which 3 ms to minimize.
[2024-05-28 21:33:05] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 3 ms to minimize.
[2024-05-28 21:33:05] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 3 ms to minimize.
[2024-05-28 21:33:06] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 2 ms to minimize.
[2024-05-28 21:33:06] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-05-28 21:33:06] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 2 ms to minimize.
[2024-05-28 21:33:07] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:33:14] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:33:18] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 2 ms to minimize.
SMT process timed out in 63125ms, After SMT, problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 63134ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124196 ms. Remains : 903/909 places, 1219/1220 transitions.
[2024-05-28 21:33:18] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:33:18] [INFO ] Flatten gal took : 48 ms
[2024-05-28 21:33:18] [INFO ] Input system was already deterministic with 1219 transitions.
[2024-05-28 21:33:18] [INFO ] Flatten gal took : 48 ms
[2024-05-28 21:33:18] [INFO ] Flatten gal took : 50 ms
[2024-05-28 21:33:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality16503732076532910130.gal : 8 ms
[2024-05-28 21:33:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality387139270570901194.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16503732076532910130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality387139270570901194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:33:48] [INFO ] Flatten gal took : 37 ms
[2024-05-28 21:33:48] [INFO ] Applying decomposition
[2024-05-28 21:33:48] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph11167278757292552529.txt' '-o' '/tmp/graph11167278757292552529.bin' '-w' '/tmp/graph11167278757292552529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11167278757292552529.bin' '-l' '-1' '-v' '-w' '/tmp/graph11167278757292552529.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:33:48] [INFO ] Decomposing Gal with order
[2024-05-28 21:33:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:33:48] [INFO ] Removed a total of 1335 redundant transitions.
[2024-05-28 21:33:48] [INFO ] Flatten gal took : 107 ms
[2024-05-28 21:33:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 11 ms.
[2024-05-28 21:33:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality11536432716944141777.gal : 10 ms
[2024-05-28 21:33:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality14017650736549731677.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11536432716944141777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14017650736549731677.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 33 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:34:19] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:34:19] [INFO ] Invariant cache hit.
[2024-05-28 21:34:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:34:54] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 2 ms to minimize.
[2024-05-28 21:34:55] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:34:55] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 3 ms to minimize.
[2024-05-28 21:34:58] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 2 ms to minimize.
[2024-05-28 21:34:58] [INFO ] Deduced a trap composed of 140 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:34:58] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 2 ms to minimize.
[2024-05-28 21:34:59] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 2 ms to minimize.
[2024-05-28 21:34:59] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:34:59] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:34:59] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
[2024-05-28 21:35:00] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 42597ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42607ms
[2024-05-28 21:35:01] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:35:01] [INFO ] Invariant cache hit.
[2024-05-28 21:35:03] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2024-05-28 21:35:03] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:35:03] [INFO ] Invariant cache hit.
[2024-05-28 21:35:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:35:22] [INFO ] Implicit Places using invariants and state equation in 18909 ms returned []
Implicit Place search using SMT with State Equation took 20256 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2024-05-28 21:35:22] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-05-28 21:35:22] [INFO ] Invariant cache hit.
[2024-05-28 21:35:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2118 variables, and 137 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 3 ms to minimize.
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:36:11] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 2 ms to minimize.
[2024-05-28 21:36:11] [INFO ] Deduced a trap composed of 140 places in 127 ms of which 2 ms to minimize.
[2024-05-28 21:36:11] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 1 ms to minimize.
[2024-05-28 21:36:12] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 2 ms to minimize.
[2024-05-28 21:36:12] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 21:36:12] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 4 ms to minimize.
[2024-05-28 21:36:12] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 4 ms to minimize.
[2024-05-28 21:36:13] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-05-28 21:36:19] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:36:22] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 21:36:22] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 145 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 14/14 constraints]
After SMT, in 62815ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 62828ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125731 ms. Remains : 903/909 places, 1219/1220 transitions.
[2024-05-28 21:36:24] [INFO ] Flatten gal took : 36 ms
[2024-05-28 21:36:25] [INFO ] Flatten gal took : 40 ms
[2024-05-28 21:36:25] [INFO ] Input system was already deterministic with 1219 transitions.
[2024-05-28 21:36:25] [INFO ] Flatten gal took : 36 ms
[2024-05-28 21:36:25] [INFO ] Flatten gal took : 37 ms
[2024-05-28 21:36:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality8009648298992409397.gal : 6 ms
[2024-05-28 21:36:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality12728542360675879973.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8009648298992409397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12728542360675879973.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:36:55] [INFO ] Flatten gal took : 72 ms
[2024-05-28 21:36:55] [INFO ] Applying decomposition
[2024-05-28 21:36:55] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5025538465462526984.txt' '-o' '/tmp/graph5025538465462526984.bin' '-w' '/tmp/graph5025538465462526984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5025538465462526984.bin' '-l' '-1' '-v' '-w' '/tmp/graph5025538465462526984.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:36:55] [INFO ] Decomposing Gal with order
[2024-05-28 21:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:36:55] [INFO ] Removed a total of 1321 redundant transitions.
[2024-05-28 21:36:55] [INFO ] Flatten gal took : 169 ms
[2024-05-28 21:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 19 ms.
[2024-05-28 21:36:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13693061537382968604.gal : 13 ms
[2024-05-28 21:36:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality10483792101765598527.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13693061537382968604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10483792101765598527.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:37:26] [INFO ] Flatten gal took : 84 ms
[2024-05-28 21:37:26] [INFO ] Flatten gal took : 60 ms
[2024-05-28 21:37:26] [INFO ] Applying decomposition
[2024-05-28 21:37:26] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14655526501357309407.txt' '-o' '/tmp/graph14655526501357309407.bin' '-w' '/tmp/graph14655526501357309407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14655526501357309407.bin' '-l' '-1' '-v' '-w' '/tmp/graph14655526501357309407.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:37:26] [INFO ] Decomposing Gal with order
[2024-05-28 21:37:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:37:27] [INFO ] Removed a total of 241 redundant transitions.
[2024-05-28 21:37:27] [INFO ] Flatten gal took : 546 ms
[2024-05-28 21:37:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 28 ms.
[2024-05-28 21:37:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12198259215224649507.gal : 14 ms
[2024-05-28 21:37:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality12405102892415384156.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12198259215224649507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12405102892415384156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 21:45:45] [INFO ] Flatten gal took : 48 ms
[2024-05-28 21:45:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8463733643104726765.gal : 7 ms
[2024-05-28 21:45:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality12461670939925745163.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8463733643104726765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12461670939925745163.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 21:53:22] [INFO ] Flatten gal took : 42 ms
[2024-05-28 21:53:22] [INFO ] Input system was already deterministic with 1220 transitions.
[2024-05-28 21:53:22] [INFO ] Transformed 909 places.
[2024-05-28 21:53:22] [INFO ] Transformed 1220 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 21:53:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4764754758488471608.gal : 9 ms
[2024-05-28 21:53:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality11246853106765013098.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4764754758488471608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11246853106765013098.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2713525 ms.

BK_STOP 1716933712908

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J60, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654447200465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;