About the Execution of LTSMin+red for CircularTrains-PT-768
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1253.315 | 2933521.00 | 4043764.00 | 6955.10 | FTT??FT?F?????F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505700372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CircularTrains-PT-768, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505700372
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 591K May 18 16:42 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 CircularTrains-PT-768-LTLFireability-00
FORMULA_NAME CircularTrains-PT-768-LTLFireability-01
FORMULA_NAME CircularTrains-PT-768-LTLFireability-02
FORMULA_NAME CircularTrains-PT-768-LTLFireability-03
FORMULA_NAME CircularTrains-PT-768-LTLFireability-04
FORMULA_NAME CircularTrains-PT-768-LTLFireability-05
FORMULA_NAME CircularTrains-PT-768-LTLFireability-06
FORMULA_NAME CircularTrains-PT-768-LTLFireability-07
FORMULA_NAME CircularTrains-PT-768-LTLFireability-08
FORMULA_NAME CircularTrains-PT-768-LTLFireability-09
FORMULA_NAME CircularTrains-PT-768-LTLFireability-10
FORMULA_NAME CircularTrains-PT-768-LTLFireability-11
FORMULA_NAME CircularTrains-PT-768-LTLFireability-12
FORMULA_NAME CircularTrains-PT-768-LTLFireability-13
FORMULA_NAME CircularTrains-PT-768-LTLFireability-14
FORMULA_NAME CircularTrains-PT-768-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717206042197
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:40:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:40:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:40:43] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-01 01:40:43] [INFO ] Transformed 1536 places.
[2024-06-01 01:40:43] [INFO ] Transformed 768 transitions.
[2024-06-01 01:40:43] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CircularTrains-PT-768-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 768/768 transitions.
Applied a total of 0 rules in 149 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2024-06-01 01:40:43] [INFO ] Computed 769 invariants in 92 ms
[2024-06-01 01:40:45] [INFO ] Implicit Places using invariants in 1548 ms returned [3, 14, 18, 29, 35, 45, 47, 59, 75, 79, 81, 83, 85, 90, 94, 96, 102, 106, 110, 125, 128, 138, 144, 149, 150, 152, 155, 158, 163, 173, 180, 187, 193, 196, 197, 198, 224, 228, 243, 244, 247, 248, 250, 255, 259, 273, 276, 296, 304, 312, 318, 325, 330, 333, 350, 353, 355, 368, 380, 381, 389, 402, 409, 414, 419, 420, 421, 438, 451, 453, 463, 464, 471, 473, 480, 499, 509, 516, 519, 530, 531, 533, 535, 544, 549, 557, 558, 561, 577, 578, 580, 600, 606, 612, 622, 630, 633, 656, 658, 661, 662, 665, 666, 669, 671, 677, 679, 681, 688, 689, 693, 694, 696, 697, 699, 705, 709, 711, 715, 716, 725, 732, 750, 761, 767, 770, 776, 780, 793, 804, 807, 810, 811, 817, 820, 839, 843, 846, 856, 872, 874, 883, 884, 885, 905, 929, 934, 940, 943, 948, 952, 953, 970, 973, 975, 977, 991, 997, 1005, 1009, 1013, 1017, 1018, 1019, 1020, 1042, 1046, 1059, 1071, 1072, 1073, 1078, 1079, 1087, 1088, 1094, 1096, 1101, 1121, 1128, 1131, 1147, 1153, 1157, 1160, 1162, 1163, 1168, 1178, 1182, 1185, 1198, 1204, 1209, 1211, 1216, 1228, 1229, 1244, 1247, 1252, 1261, 1262, 1266, 1273, 1292, 1299, 1300, 1301, 1305, 1306, 1329, 1335, 1337, 1338, 1339, 1350, 1354, 1356, 1360, 1362, 1373, 1378, 1379, 1385, 1391, 1430, 1438, 1446, 1450, 1453, 1461, 1472, 1476, 1484, 1485, 1487, 1488, 1493, 1495, 1497, 1507, 1512, 1513, 1515, 1517, 1525, 1527, 1531]
Discarding 249 places :
Implicit Place search using SMT only with invariants took 1590 ms to find 249 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1287/1536 places, 768/768 transitions.
Applied a total of 0 rules in 148 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1913 ms. Remains : 1287/1536 places, 768/768 transitions.
Support contains 56 out of 1287 places after structural reductions.
[2024-06-01 01:40:45] [INFO ] Flatten gal took : 91 ms
[2024-06-01 01:40:45] [INFO ] Flatten gal took : 50 ms
[2024-06-01 01:40:46] [INFO ] Input system was already deterministic with 768 transitions.
Support contains 54 out of 1287 places (down from 56) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 7817 steps (0 resets) in 1129 ms. (6 steps per ms) remains 0/26 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||F(p1)))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 49 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-06-01 01:40:46] [INFO ] Computed 520 invariants in 18 ms
[2024-06-01 01:40:47] [INFO ] Implicit Places using invariants in 888 ms returned [92, 285, 304, 794, 968, 1183]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 891 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1287 places, 768/768 transitions.
Applied a total of 0 rules in 108 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1050 ms. Remains : 1281/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-03
Product exploration explored 100000 steps with 481 reset in 3924 ms.
Product exploration explored 100000 steps with 453 reset in 4031 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 24546 steps (5 resets) in 1082 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 243 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 768 rows 1281 cols
[2024-06-01 01:40:57] [INFO ] Computed 514 invariants in 18 ms
[2024-06-01 01:40:58] [INFO ] [Real]Absence check using 510 positive place invariants in 280 ms returned sat
[2024-06-01 01:40:59] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 108 ms returned sat
[2024-06-01 01:41:08] [INFO ] [Real]Absence check using state equation in 9003 ms returned sat
[2024-06-01 01:41:08] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 60 ms.
[2024-06-01 01:41:12] [INFO ] Added : 15 causal constraints over 3 iterations in 4752 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 52 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:41:13] [INFO ] Invariant cache hit.
[2024-06-01 01:41:13] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-06-01 01:41:13] [INFO ] Invariant cache hit.
[2024-06-01 01:41:14] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:41:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2049 variables, and 512 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/4 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 2/1281 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2049 variables, 1281/1795 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2049 variables, 512/2307 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2049/2049 variables, and 2307 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1281/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Finished structural reductions in LTL mode , in 1 iterations and 62207 ms. Remains : 1281/1281 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 18031 steps (3 resets) in 683 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 283 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 01:42:17] [INFO ] Invariant cache hit.
[2024-06-01 01:42:17] [INFO ] [Real]Absence check using 510 positive place invariants in 268 ms returned sat
[2024-06-01 01:42:18] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 111 ms returned sat
[2024-06-01 01:42:26] [INFO ] [Real]Absence check using state equation in 8713 ms returned sat
[2024-06-01 01:42:26] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 38 ms.
[2024-06-01 01:42:31] [INFO ] Added : 15 causal constraints over 3 iterations in 5103 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 487 reset in 3594 ms.
Product exploration explored 100000 steps with 489 reset in 3852 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1281 transition count 768
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 252 place count 1281 transition count 768
Deduced a syphon composed of 254 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 254 place count 1281 transition count 768
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 255 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 1281 transition count 768
Deduced a syphon composed of 255 places in 1 ms
Applied a total of 255 rules in 312 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:42:40] [INFO ] Redundant transitions in 39 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-06-01 01:42:40] [INFO ] Computed 514 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 01:43:00] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 29 ms to minimize.
[2024-06-01 01:43:00] [INFO ] Deduced a trap composed of 2 places in 137 ms of which 3 ms to minimize.
[2024-06-01 01:43:00] [INFO ] Deduced a trap composed of 2 places in 149 ms of which 4 ms to minimize.
[2024-06-01 01:43:00] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 6 ms to minimize.
[2024-06-01 01:43:01] [INFO ] Deduced a trap composed of 2 places in 114 ms of which 2 ms to minimize.
[2024-06-01 01:43:01] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 3 ms to minimize.
[2024-06-01 01:43:01] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-06-01 01:43:01] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 8 ms to minimize.
[2024-06-01 01:43:01] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 2 ms to minimize.
[2024-06-01 01:43:01] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 3 ms to minimize.
[2024-06-01 01:43:01] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 2 ms to minimize.
[2024-06-01 01:43:01] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 2 ms to minimize.
[2024-06-01 01:43:02] [INFO ] Deduced a trap composed of 2 places in 114 ms of which 2 ms to minimize.
[2024-06-01 01:43:02] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 2 ms to minimize.
[2024-06-01 01:43:02] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 3 ms to minimize.
[2024-06-01 01:43:02] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 2 ms to minimize.
[2024-06-01 01:43:02] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 2 ms to minimize.
[2024-06-01 01:43:02] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-06-01 01:43:02] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 1 ms to minimize.
[2024-06-01 01:43:03] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/532 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-06-01 01:43:06] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-06-01 01:43:06] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-06-01 01:43:06] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
[2024-06-01 01:43:06] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 2 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 2 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 2 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 2 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD388 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/552 constraints. Problems are: Problem set: 40 solved, 472 unsolved
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-06-01 01:43:08] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 2 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-06-01 01:43:09] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-06-01 01:43:10] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 2 ms to minimize.
[2024-06-01 01:43:10] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 01:43:10] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-06-01 01:43:10] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD504 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s82 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 (/ 1.0 2.0))
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 1.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 (/ 1.0 2.0))
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 1.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 (/ 1.0 2.0))
(s718 1.0)
(s719 0.0)
(s720 1.0)
(s721 1.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 1.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 0.0)
(s751 1.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 1.0)
(s766 0.0)
(s767 1.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 1.0)
(s772 0.0)
(s773 0.0)
(s774 1.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 1.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 0.0)
(s787 0.0)
(s788 1.0)
(s789 0.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 1.0)
(s805 0.0)
(s806 1.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 1.0)
(s824 1.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 1.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 1.0)
(s838 0.0)
(s839 1.0)
(s840 0.0)
(s841 1.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 1.0)
(s846 0.0)
(s847 1.0)
(s848 0.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 1.0)
(s858 0.0)
(s859 0.0)
(s860 1.0)
(s861 0.0)
(s862 0.0)
(s863 1.0)
(s864 1.0)
(s865 0.0)
(s866 (/ 1.0 2.0))
(s867 1.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 1.0)
(s874 1.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 1.0)
(s895 1.0)
(s896 0.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 0.0)
(s902 0.0)
(s903 1.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 1.0)
(s908 1.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 1.0)
(s913 0.0)
(s914 1.0)
(s915 0.0)
(s916 1.0)
(s917 1.0)
(s918 0.0)
(s919 0.0)
(s920 1.0)
(s921 0.0)
(s922 0.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 0.0)
(s927 0.0)
(s928 1.0)
(s929 0.0)
(s930 1.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 1.0)
(s935 0.0)
(s936 0.0)
(s937 1.0)
(s938 0.0)
(s939 0.0)
(s940 1.0)
(s941 0.0)
(s942 0.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 0.0)
(s956 0.0)
(s957 1.0)
(s958 1.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 1.0)
(s963 1.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 1.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 1.0)
(s974 1.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 1.0)
(s979 1.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 0.0)
(s993 1.0)
(s994 0.0)
(s995 0.0)
(s996 1.0)
(s997 0.0)
(s998 1.0)
(s999 1.0)
(s1000 0.0)
(s1001 0.0)
(s1002 1.0)
(s1003 1.0)
(s1004 0.0)
(s1005 1.0)
(s1006 1.0)
(s1007 0.0)
(s1008 0.0)
(s1009 1.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 1.0)
(s1016 1.0)
(s1017 0.0)
(s1018 1.0)
(s1019 0.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 0.0)
(s1024 0.0)
(s1025 1.0)
(s1026 0.0)
(s1027 1.0)
(s1028 0.0)
(s1029 0.0)
(s1030 1.0)
(s1031 0.0)
(s1032 1.0)
(s1033 0.0)
(s1034 0.0)
(s1035 1.0)
(s1036 1.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 1.0)
(s1041 1.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 1.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 1.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 (/ 1.0 2.0))
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 1.0)
(s1065 1.0)
(s1066 0.0)
(s1067 1.0)
(s1068 0.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 (/ 1.0 2.0))
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 1.0)
(s1082 0.0)
(s1083 1.0)
(s1084 1.0)
(s1085 0.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 0.0)
(s1090 0.0)
(s1091 1.0)
(s1092 0.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 1.0)
(s1103 1.0)
(s1104 0.0)
(s1105 1.0)
(s1106 0.0)
(s1107 0.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 0.0)
(s1113 1.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 1.0)
(s1119 0.0)
(s1120 1.0)
(s1121 0.0)
(s1122 0.0)
(s1123 1.0)
(s1124 0.0)
(s1125 1.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 1.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 1.0)
(s1137 0.0)
(s1138 1.0)
(s1139 1.0)
(s1140 0.0)
(s1141 1.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/572 constraints. Problems are: Problem set: 60 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2049 variables, and 572 constraints, problems are : Problem set: 60 solved, 452 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/4 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 60 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/709 variables, 1/1 constraints. Problems are: Problem set: 60 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/709 variables, 0/1 constraints. Problems are: Problem set: 60 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 570/1279 variables, 510/511 constraints. Problems are: Problem set: 60 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 60 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 60/572 constraints. Problems are: Problem set: 60 solved, 452 unsolved
[2024-06-01 01:43:15] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 2 ms to minimize.
[2024-06-01 01:43:15] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-06-01 01:43:15] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-06-01 01:43:15] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-06-01 01:43:15] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-06-01 01:43:15] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-06-01 01:43:15] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 2 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 2 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD509 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
[2024-06-01 01:43:16] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-06-01 01:43:17] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD501 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/612 constraints. Problems are: Problem set: 100 solved, 412 unsolved
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 01:43:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1279 variables, 20/632 constraints. Problems are: Problem set: 120 solved, 392 unsolved
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 01:43:19] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 01:43:20] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1279 variables, 20/652 constraints. Problems are: Problem set: 140 solved, 372 unsolved
[2024-06-01 01:43:21] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 01:43:21] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 01:43:21] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 3 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 01:43:21] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 01:43:21] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-06-01 01:43:22] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 01:43:23] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-06-01 01:43:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1279 variables, 20/672 constraints. Problems are: Problem set: 160 solved, 352 unsolved
[2024-06-01 01:43:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD140 is UNSAT
[2024-06-01 01:43:24] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-06-01 01:43:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-06-01 01:43:24] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD181 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD193 is UNSAT
[2024-06-01 01:43:25] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD197 is UNSAT
[2024-06-01 01:43:26] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-06-01 01:43:26] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD204 is UNSAT
[2024-06-01 01:43:26] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-06-01 01:43:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
[2024-06-01 01:43:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1279 variables, 20/692 constraints. Problems are: Problem set: 180 solved, 332 unsolved
[2024-06-01 01:43:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-06-01 01:43:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD228 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD234 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD236 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD240 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD243 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD247 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD250 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD253 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD255 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-06-01 01:43:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/1279 variables, 20/712 constraints. Problems are: Problem set: 200 solved, 312 unsolved
[2024-06-01 01:43:32] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
[2024-06-01 01:43:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD277 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD283 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD295 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD304 is UNSAT
[2024-06-01 01:43:33] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD306 is UNSAT
[2024-06-01 01:43:34] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD309 is UNSAT
[2024-06-01 01:43:34] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD310 is UNSAT
[2024-06-01 01:43:34] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1279 variables, 20/732 constraints. Problems are: Problem set: 220 solved, 292 unsolved
[2024-06-01 01:43:37] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD313 is UNSAT
[2024-06-01 01:43:37] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD315 is UNSAT
[2024-06-01 01:43:37] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD323 is UNSAT
[2024-06-01 01:43:37] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD327 is UNSAT
[2024-06-01 01:43:37] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD331 is UNSAT
[2024-06-01 01:43:37] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-06-01 01:43:37] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD334 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD340 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD347 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD351 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD357 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD360 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD365 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD366 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD368 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD372 is UNSAT
[2024-06-01 01:43:38] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/1279 variables, 20/752 constraints. Problems are: Problem set: 240 solved, 272 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 Int declared 1279/2049 variables, and 752 constraints, problems are : Problem set: 240 solved, 272 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/4 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 240/240 constraints]
After SMT, in 60114ms problems are : Problem set: 240 solved, 272 unsolved
Search for dead transitions found 240 dead transitions in 60121ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 528/768 transitions.
Graph (complete) has 2082 edges and 1281 vertex of which 1041 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.5 ms
Discarding 240 places :
Also discarding 0 output transitions
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 1 rules in 49 ms. Remains 1041 /1281 variables (removed 240) and now considering 528/528 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1041/1281 places, 528/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60531 ms. Remains : 1041/1281 places, 528/768 transitions.
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 42 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-06-01 01:43:40] [INFO ] Computed 514 invariants in 18 ms
[2024-06-01 01:43:41] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-06-01 01:43:41] [INFO ] Invariant cache hit.
[2024-06-01 01:43:42] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1939 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:43:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2049 variables, and 512 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/4 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 2/1281 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2049 variables, 1281/1795 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2049 variables, 512/2307 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2049/2049 variables, and 2307 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1281/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in LTL mode , in 1 iterations and 62104 ms. Remains : 1281/1281 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 235908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(p0)) U p1))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1048 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 480 place count 1047 transition count 519
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 139 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-06-01 01:44:42] [INFO ] Computed 520 invariants in 6 ms
[2024-06-01 01:44:43] [INFO ] Implicit Places using invariants in 713 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 719 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 894 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 2695 ms.
Product exploration explored 100000 steps with 0 reset in 3059 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 317 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 7357 steps (1 resets) in 342 ms. (21 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 499 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 512 rows 1024 cols
[2024-06-01 01:44:51] [INFO ] Computed 513 invariants in 7 ms
[2024-06-01 01:44:51] [INFO ] [Real]Absence check using 511 positive place invariants in 250 ms returned sat
[2024-06-01 01:44:52] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 31 ms returned sat
[2024-06-01 01:44:57] [INFO ] [Real]Absence check using state equation in 5612 ms returned sat
[2024-06-01 01:44:57] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 28 ms.
[2024-06-01 01:45:03] [INFO ] Added : 15 causal constraints over 3 iterations in 5396 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 33 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 01:45:03] [INFO ] Invariant cache hit.
[2024-06-01 01:45:03] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-06-01 01:45:03] [INFO ] Invariant cache hit.
[2024-06-01 01:45:04] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
[2024-06-01 01:45:04] [INFO ] Redundant transitions in 5 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 01:45:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 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 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61670 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 582 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 3655 steps (0 resets) in 164 ms. (22 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 766 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
[2024-06-01 01:46:07] [INFO ] Invariant cache hit.
[2024-06-01 01:46:07] [INFO ] [Real]Absence check using 511 positive place invariants in 209 ms returned sat
[2024-06-01 01:46:07] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 50 ms returned sat
[2024-06-01 01:46:13] [INFO ] [Real]Absence check using state equation in 5651 ms returned sat
[2024-06-01 01:46:13] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 01:46:18] [INFO ] Added : 15 causal constraints over 3 iterations in 5254 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2786 ms.
Product exploration explored 100000 steps with 0 reset in 3094 ms.
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 32 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 01:46:24] [INFO ] Invariant cache hit.
[2024-06-01 01:46:25] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-06-01 01:46:25] [INFO ] Invariant cache hit.
[2024-06-01 01:46:26] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2024-06-01 01:46:26] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 01:46:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61694 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-04 finished in 163718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (F(p1) U G(p2))))))'
Support contains 8 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-06-01 01:47:26] [INFO ] Computed 520 invariants in 9 ms
[2024-06-01 01:47:27] [INFO ] Implicit Places using invariants in 802 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 805 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 883 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-05
Product exploration explored 100000 steps with 153 reset in 3354 ms.
Product exploration explored 100000 steps with 150 reset in 3604 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
RANDOM walk for 6772 steps (1 resets) in 244 ms. (27 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 434 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 01:47:36] [INFO ] Computed 513 invariants in 10 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p1)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 4 factoid took 477 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-768-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-768-LTLFireability-05 finished in 11069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 52 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-06-01 01:47:37] [INFO ] Computed 520 invariants in 17 ms
[2024-06-01 01:47:38] [INFO ] Implicit Places using invariants in 798 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 800 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 891 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-07
Product exploration explored 100000 steps with 20577 reset in 3243 ms.
Product exploration explored 100000 steps with 18253 reset in 3515 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 641 steps (0 resets) in 42 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 01:47:46] [INFO ] Computed 513 invariants in 14 ms
[2024-06-01 01:47:47] [INFO ] Implicit Places using invariants in 768 ms returned []
[2024-06-01 01:47:47] [INFO ] Invariant cache hit.
[2024-06-01 01:47:48] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:47:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 1.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 1.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 1.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 0.0)
(s786 1.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 1.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 1.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 1.0)
(s823 1.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 1.0)
(s837 1.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 0.0)
(s853 1.0)
(s854 1.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 1.0)
(s861 0.0)
(s862 1.0)
(s863 1.0)
(s864 0.0)
(s865 0.0)
(s866 1.0)
(s867 0.0)
(s868 1.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 0.0)
(s877 0.0)
(s878 1.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 1.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 1.0)
(s894 0.0)
(s895 0.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 0.0)
(s901 0.0)
(s902 1.0)
(s903 0.0)
(s904 0.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 1.0)
(s912 0.0)
(s913 1.0)
(s914 1.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 0.0)
(s926 0.0)
(s927 1.0)
(s928 0.0)
(s929 1.0)
(s930 1.0)
(s931 0.0)
(s932 0.0)
(s933 1.0)
(s934 1.0)
(s935 0.0)
(s936 1.0)
(s937 1.0)
(s938 0.0)
(s939 1.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 0.0)
(s955 0.0)
(s956 1.0)
(s957 0.0)
(s958 1.0)
(s959 1.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 1.0)
(s965 0.0)
(s966 0.0)
(s967 1.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 1.0)
(s974 1.0)
(s975 0.0)
(s976 0.0)
(s977 1.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 1.0)
(s982 1.0)
(s983 0.0)
(s984 0.0)
(s985 1.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 1.0)
(s991 0.0)
(s992 1.0)
(s993 0.0)
(s994 0.0)
(s995 1.0)
(s996 0.0)
(s997 1.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 1.0)
(s1002 0.0)
(s1003 0.0)
(s1004 1.0)
(s1005 1.0)
(s1006 0.0)
(s1007 0.0)
(s1008 1.0)
(s1009 0.0)
(s1010 0.0)
(s1011 1.0)
(s1012 0.0)
(s1013 0.0)
(s1014 1.0)
(s1015 1.0)
(s1016 0.0)
(s1017 1.0)
(s1018 0.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 0.0)
(s1023 0.0)
(s1024 1.0)
(s1025 0.0)
(s1026 1.0)
(s1027 0.0)
(s1028 0.0)
(s1029 1.0)
(s1030 1.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 1.0)
(s1035 1.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 1.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 1.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 1.0)
(s1058 0.0)
(s1059 1.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 1.0)
(s1064 0.0)
(s1065 0.0)
(s1066 1.0)
(s1067 0.0)
(s1068 1.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 1.0)
(s1075 0.0)
(s1076 1.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 1.0)
(s1081 0.0)
(s1082 0.0)
(s1083 1.0)
(s1084 0.0)
(s1085 1.0)
(s1086 0.0)
(s1087 1.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 1.0)
(s1093 1.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 1.0)
(s1105 0.0)
(s1106 0.0)
(s1107 1.0)
(s1108 0.0)
(s1109 1.0)
(s1110 1.0)
(s1111 0.0)
(s1112 1.0)
(s1113 0.0)
(s1114 1.0)
(s1115 0.0)
(s1116 0.0)
(s1117 1.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 1.0)
(s1123 0.0)
(s1124 1.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 1.0)
(s1132 1.0)
(s1133 0.0)
(s1134 0.0)
(s1135 1.0)
(s1136 0.0)
(s1137 1.0)
(s1138 1.0)
(s1139 0.0)
(s1140 1.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 1.0)
(s1145 1.0)
(s1146 0.0)
(s1147 0.0)
(s1148 1.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 0.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 0.0)
(s1163 0.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 1.0)
(s1175 0.0)
(s1176 1.0)
(s1177 0.0)
(s1178 1.0)
(s1179 0.0)
(s1180 1.0)
(s1181 0.0)
(s1182 0.0)
(s1183 1.0)
(s1184 0.0)
(s1185 0.0)
(s1186 1.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 1.0)
(s1191 1.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 1.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 1.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 1.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 1.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 1.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 1.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 1.0)
(s1234 1.0)
(s1235 0.0)
(s1236 1.0)
(s1237 0.0)
(s1238 0.0)
(s1239 1.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 0.0)
(s1252 0.0)
(s1253 1.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 1.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 1.0)
(s1263 1.0)
(s1264 0.0)
(s1265 1.0)
(s1266 0.0)
(s1267 1.0)
(s1268 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30083ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30090ms
Finished structural reductions in LTL mode , in 1 iterations and 31977 ms. Remains : 1280/1280 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1224 steps (0 resets) in 60 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20104 reset in 3106 ms.
Product exploration explored 100000 steps with 20686 reset in 3403 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 256 rules applied. Total rules applied 256 place count 1280 transition count 768
Deduced a syphon composed of 256 places in 0 ms
Applied a total of 256 rules in 88 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:48:26] [INFO ] Redundant transitions in 7 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 01:48:26] [INFO ] Computed 513 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 3 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 3 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 3 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 3 ms to minimize.
[2024-06-01 01:48:39] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 3 ms to minimize.
[2024-06-01 01:48:39] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-06-01 01:48:39] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-06-01 01:48:39] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-06-01 01:48:39] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD503 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 20/532 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-06-01 01:48:48] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-06-01 01:48:48] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 2 ms to minimize.
[2024-06-01 01:48:48] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-06-01 01:48:50] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-06-01 01:48:50] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-06-01 01:48:50] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 01:48:50] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-06-01 01:48:50] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-06-01 01:48:50] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-06-01 01:48:50] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-06-01 01:48:50] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/552 constraints. Problems are: Problem set: 40 solved, 472 unsolved
[2024-06-01 01:48:51] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-06-01 01:48:51] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-06-01 01:48:51] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 4 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-06-01 01:48:52] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 2 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD502 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/572 constraints. Problems are: Problem set: 60 solved, 452 unsolved
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 2 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:48:54] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD488 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2048 variables, and 592 constraints, problems are : Problem set: 80 solved, 432 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 80 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 0/0 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 591/1279 variables, 511/511 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 80/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
[2024-06-01 01:49:00] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 01:49:00] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-06-01 01:49:00] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 01:49:00] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:49:00] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 01:49:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD508 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/612 constraints. Problems are: Problem set: 100 solved, 412 unsolved
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 01:49:01] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 01:49:03] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 01:49:03] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 01:49:03] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 01:49:03] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 01:49:03] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD153 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/632 constraints. Problems are: Problem set: 120 solved, 392 unsolved
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 01:49:05] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-06-01 01:49:05] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 01:49:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 01:49:05] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 01:49:05] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/652 constraints. Problems are: Problem set: 140 solved, 372 unsolved
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 01:49:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 01:49:07] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-06-01 01:49:07] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-06-01 01:49:07] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 01:49:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-06-01 01:49:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-06-01 01:49:07] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-06-01 01:49:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-06-01 01:49:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1279 variables, 20/672 constraints. Problems are: Problem set: 160 solved, 352 unsolved
[2024-06-01 01:49:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-06-01 01:49:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-06-01 01:49:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-06-01 01:49:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-06-01 01:49:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-06-01 01:49:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-06-01 01:49:09] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-06-01 01:49:10] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-06-01 01:49:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1279 variables, 20/692 constraints. Problems are: Problem set: 180 solved, 332 unsolved
[2024-06-01 01:49:13] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-06-01 01:49:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
[2024-06-01 01:49:13] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-06-01 01:49:13] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-06-01 01:49:13] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-06-01 01:49:13] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-06-01 01:49:13] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-06-01 01:49:13] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD242 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-06-01 01:49:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1279 variables, 20/712 constraints. Problems are: Problem set: 200 solved, 312 unsolved
[2024-06-01 01:49:17] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD255 is UNSAT
[2024-06-01 01:49:17] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
[2024-06-01 01:49:17] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-06-01 01:49:17] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
[2024-06-01 01:49:17] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-06-01 01:49:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-06-01 01:49:17] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-06-01 01:49:17] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD273 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD282 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD290 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD294 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD303 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD305 is UNSAT
[2024-06-01 01:49:18] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1279 variables, 20/732 constraints. Problems are: Problem set: 220 solved, 292 unsolved
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD309 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD311 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD312 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD314 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD322 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD326 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD330 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD339 is UNSAT
[2024-06-01 01:49:22] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD345 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD350 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD354 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD359 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD364 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD365 is UNSAT
[2024-06-01 01:49:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/1279 variables, 20/752 constraints. Problems are: Problem set: 240 solved, 272 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 1)
(s75 1)
(s76 0)
(s77 1)
(s78 1)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 1)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 1)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 1)
(s237 0)
(s238 0)
(s239 1)
(s240 1)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 1)
(s247 1)
(s248 0)
(s249 1)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 1)
(s280 0)
(s281 1)
(s282 1)
(s283 0)
(s284 0)
(s285 1)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 1)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 1)
(s332 1)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 0)
(s338 1)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 1)
(s351 1)
(s352 0)
(s353 1)
(s354 1)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 1)
(s363 1)
(s364 0)
(s365 1)
(s366 0)
(s367 1)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 1)
(s382 1)
(s383 1)
(s384 0)
(s385 1)
(s386 0)
(s387 0)
(s388 1)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 1)
(s414 1)
(s415 0)
(s416 0)
(s417 1)
(s418 1)
(s419 1)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 0)
(s433 0)
(s434 1)
(s435 1)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 1)
(s441 1)
(s442 0)
(s443 0)
(s444 1)
(s445 1)
(s446 0)
(s447 1)
(s448 0)
(s449 1)
(s450 1)
(s451 1)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 1)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 1)
(s478 1)
(s479 0)
(s480 1)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 1)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 1)
(s497 1)
(s498 1)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 0)
(s504 1)
(s505 1)
(s506 0)
(s507 1)
(s508 1)
(s509 1)
(s510 0)
(s511 0)
(s512 1)
(s513 1)
(s514 1)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1279/2048 variables, and 752 constraints, problems are : Problem set: 240 solved, 272 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 240/240 constraints]
After SMT, in 60112ms problems are : Problem set: 240 solved, 272 unsolved
Search for dead transitions found 240 dead transitions in 60116ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1280/1280 places, 528/768 transitions.
Graph (complete) has 2080 edges and 1280 vertex of which 1040 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.2 ms
Discarding 240 places :
Also discarding 0 output transitions
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 1 rules in 40 ms. Remains 1040 /1280 variables (removed 240) and now considering 528/528 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1040/1280 places, 528/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60261 ms. Remains : 1040/1280 places, 528/768 transitions.
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 01:49:26] [INFO ] Computed 513 invariants in 17 ms
[2024-06-01 01:49:27] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-06-01 01:49:27] [INFO ] Invariant cache hit.
[2024-06-01 01:49:28] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:49:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 1.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 1.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 1.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 0.0)
(s786 1.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 1.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 1.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 1.0)
(s823 1.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 1.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 0.0)
(s853 1.0)
(s854 1.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 1.0)
(s861 0.0)
(s862 1.0)
(s863 1.0)
(s864 0.0)
(s865 0.0)
(s866 1.0)
(s867 0.0)
(s868 1.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 0.0)
(s877 0.0)
(s878 1.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 1.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 1.0)
(s894 0.0)
(s895 0.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 0.0)
(s901 0.0)
(s902 1.0)
(s903 0.0)
(s904 0.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 1.0)
(s912 0.0)
(s913 1.0)
(s914 1.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 0.0)
(s926 0.0)
(s927 1.0)
(s928 0.0)
(s929 1.0)
(s930 1.0)
(s931 0.0)
(s932 0.0)
(s933 1.0)
(s934 1.0)
(s935 0.0)
(s936 1.0)
(s937 1.0)
(s938 0.0)
(s939 1.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 0.0)
(s955 0.0)
(s956 1.0)
(s957 0.0)
(s958 1.0)
(s959 1.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 1.0)
(s965 0.0)
(s966 0.0)
(s967 1.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 1.0)
(s974 1.0)
(s975 0.0)
(s976 0.0)
(s977 1.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 1.0)
(s982 1.0)
(s983 0.0)
(s984 0.0)
(s985 1.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 1.0)
(s990 1.0)
(s991 0.0)
(s992 1.0)
(s993 0.0)
(s994 0.0)
(s995 1.0)
(s996 0.0)
(s997 1.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 1.0)
(s1002 1.0)
(s1003 0.0)
(s1004 1.0)
(s1005 1.0)
(s1006 0.0)
(s1007 0.0)
(s1008 1.0)
(s1009 0.0)
(s1010 0.0)
(s1011 1.0)
(s1012 0.0)
(s1013 0.0)
(s1014 1.0)
(s1015 1.0)
(s1016 0.0)
(s1017 1.0)
(s1018 0.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 0.0)
(s1023 0.0)
(s1024 1.0)
(s1025 0.0)
(s1026 1.0)
(s1027 0.0)
(s1028 0.0)
(s1029 1.0)
(s1030 1.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 1.0)
(s1035 1.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 1.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 1.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 1.0)
(s1058 0.0)
(s1059 1.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 1.0)
(s1064 0.0)
(s1065 0.0)
(s1066 1.0)
(s1067 0.0)
(s1068 1.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 1.0)
(s1075 0.0)
(s1076 1.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 1.0)
(s1084 0.0)
(s1085 1.0)
(s1086 0.0)
(s1087 1.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 1.0)
(s1093 1.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 1.0)
(s1105 0.0)
(s1106 0.0)
(s1107 1.0)
(s1108 0.0)
(s1109 1.0)
(s1110 1.0)
(s1111 0.0)
(s1112 1.0)
(s1113 0.0)
(s1114 1.0)
(s1115 0.0)
(s1116 0.0)
(s1117 1.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 1.0)
(s1123 0.0)
(s1124 1.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 1.0)
(s1132 1.0)
(s1133 0.0)
(s1134 0.0)
(s1135 1.0)
(s1136 0.0)
(s1137 1.0)
(s1138 1.0)
(s1139 0.0)
(s1140 1.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 1.0)
(s1145 1.0)
(s1146 0.0)
(s1147 0.0)
(s1148 1.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 0.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 0.0)
(s1163 0.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 1.0)
(s1175 0.0)
(s1176 1.0)
(s1177 0.0)
(s1178 1.0)
(s1179 0.0)
(s1180 1.0)
(s1181 0.0)
(s1182 0.0)
(s1183 1.0)
(s1184 0.0)
(s1185 0.0)
(s1186 1.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 1.0)
(s1191 1.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 1.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 1.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 1.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30087ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30092ms
Finished structural reductions in LTL mode , in 1 iterations and 31961 ms. Remains : 1280/1280 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-07 finished in 140805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(p1)))&&G(F(p2)))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-06-01 01:49:58] [INFO ] Computed 520 invariants in 17 ms
[2024-06-01 01:49:59] [INFO ] Implicit Places using invariants in 791 ms returned [92, 285, 304, 743, 794, 968]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 792 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1287 places, 768/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 871 ms. Remains : 1281/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 2602 ms.
Product exploration explored 100000 steps with 3 reset in 2991 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 436 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1305 steps (0 resets) in 80 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 575 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
// Phase 1: matrix 768 rows 1281 cols
[2024-06-01 01:50:07] [INFO ] Computed 514 invariants in 16 ms
[2024-06-01 01:50:08] [INFO ] [Real]Absence check using 511 positive place invariants in 260 ms returned sat
[2024-06-01 01:50:08] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 134 ms returned sat
[2024-06-01 01:50:14] [INFO ] [Real]Absence check using state equation in 6431 ms returned sat
[2024-06-01 01:50:14] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 43 ms.
[2024-06-01 01:50:20] [INFO ] Added : 15 causal constraints over 3 iterations in 5248 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-06-01 01:50:20] [INFO ] Invariant cache hit.
[2024-06-01 01:50:20] [INFO ] [Real]Absence check using 511 positive place invariants in 259 ms returned sat
[2024-06-01 01:50:21] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 133 ms returned sat
[2024-06-01 01:50:31] [INFO ] [Real]Absence check using state equation in 9984 ms returned sat
[2024-06-01 01:50:31] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 35 ms.
[2024-06-01 01:50:35] [INFO ] Added : 10 causal constraints over 2 iterations in 3958 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 43 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:50:35] [INFO ] Invariant cache hit.
[2024-06-01 01:50:35] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-06-01 01:50:35] [INFO ] Invariant cache hit.
[2024-06-01 01:50:36] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:50:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 510/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 1.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 1.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 1.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 0.0)
(s786 1.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 1.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)timeout
(s827 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30082ms
Finished structural reductions in LTL mode , in 1 iterations and 31929 ms. Remains : 1281/1281 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 329 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1355 steps (0 resets) in 80 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 421 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2024-06-01 01:51:08] [INFO ] Invariant cache hit.
[2024-06-01 01:51:09] [INFO ] [Real]Absence check using 511 positive place invariants in 264 ms returned sat
[2024-06-01 01:51:09] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 125 ms returned sat
[2024-06-01 01:51:23] [INFO ] [Real]Absence check using state equation in 14045 ms returned unknown
Could not prove EG (NOT p0)
[2024-06-01 01:51:23] [INFO ] Invariant cache hit.
[2024-06-01 01:51:24] [INFO ] [Real]Absence check using 511 positive place invariants in 268 ms returned sat
[2024-06-01 01:51:24] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 131 ms returned sat
[2024-06-01 01:51:35] [INFO ] [Real]Absence check using state equation in 10479 ms returned sat
[2024-06-01 01:51:35] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 40 ms.
[2024-06-01 01:51:38] [INFO ] Added : 10 causal constraints over 2 iterations in 3442 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2547 ms.
Product exploration explored 100000 steps with 6 reset in 2920 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 254 rules applied. Total rules applied 254 place count 1281 transition count 768
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 1281 transition count 768
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 255 rules in 124 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:51:45] [INFO ] Redundant transitions in 8 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-06-01 01:51:45] [INFO ] Computed 514 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 510/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 01:51:55] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 2 ms to minimize.
[2024-06-01 01:51:56] [INFO ] Deduced a trap composed of 2 places in 109 ms of which 3 ms to minimize.
[2024-06-01 01:51:56] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 2 ms to minimize.
[2024-06-01 01:51:56] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 3 ms to minimize.
[2024-06-01 01:51:56] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2024-06-01 01:51:56] [INFO ] Deduced a trap composed of 2 places in 114 ms of which 3 ms to minimize.
[2024-06-01 01:51:56] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-06-01 01:51:56] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-06-01 01:51:56] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-06-01 01:51:57] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 3 ms to minimize.
[2024-06-01 01:51:57] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-06-01 01:51:57] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-06-01 01:51:57] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-06-01 01:51:57] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 3 ms to minimize.
[2024-06-01 01:51:57] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-06-01 01:51:57] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-06-01 01:51:57] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-06-01 01:51:58] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-06-01 01:51:58] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-06-01 01:51:58] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 20/532 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-06-01 01:52:07] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 2 ms to minimize.
[2024-06-01 01:52:07] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-06-01 01:52:07] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-06-01 01:52:07] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 2 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 3 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-06-01 01:52:08] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD486 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/552 constraints. Problems are: Problem set: 40 solved, 472 unsolved
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-06-01 01:52:09] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 2 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 2 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-06-01 01:52:10] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD509 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/572 constraints. Problems are: Problem set: 60 solved, 452 unsolved
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 01:52:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-06-01 01:52:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD504 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2049 variables, and 592 constraints, problems are : Problem set: 80 solved, 432 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/3 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 80 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 0/0 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 590/1279 variables, 511/511 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 80/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
[2024-06-01 01:52:19] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-06-01 01:52:19] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-06-01 01:52:19] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 01:52:19] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-06-01 01:52:19] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 01:52:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 01:52:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD503 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/612 constraints. Problems are: Problem set: 100 solved, 412 unsolved
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 01:52:21] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 01:52:22] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 01:52:22] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 01:52:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 01:52:22] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 01:52:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/632 constraints. Problems are: Problem set: 120 solved, 392 unsolved
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-06-01 01:52:23] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 01:52:24] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 01:52:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 01:52:24] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 01:52:24] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 01:52:24] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/652 constraints. Problems are: Problem set: 140 solved, 372 unsolved
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 01:52:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-06-01 01:52:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-06-01 01:52:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-06-01 01:52:26] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-06-01 01:52:26] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-06-01 01:52:26] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-06-01 01:52:26] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-06-01 01:52:26] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-06-01 01:52:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1279 variables, 20/672 constraints. Problems are: Problem set: 160 solved, 352 unsolved
[2024-06-01 01:52:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-06-01 01:52:28] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-06-01 01:52:28] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-06-01 01:52:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-06-01 01:52:28] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-06-01 01:52:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-06-01 01:52:28] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-06-01 01:52:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD192 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-06-01 01:52:29] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1279 variables, 20/692 constraints. Problems are: Problem set: 180 solved, 332 unsolved
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD214 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-06-01 01:52:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD242 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-06-01 01:52:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1279 variables, 20/712 constraints. Problems are: Problem set: 200 solved, 312 unsolved
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD277 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
[2024-06-01 01:52:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD283 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD295 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD304 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD306 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD309 is UNSAT
[2024-06-01 01:52:37] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1279 variables, 20/732 constraints. Problems are: Problem set: 220 solved, 292 unsolved
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD312 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD313 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD315 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD323 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD327 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD331 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD334 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD340 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-06-01 01:52:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD347 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD351 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD357 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD360 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD365 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD366 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD368 is UNSAT
[2024-06-01 01:52:42] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/1279 variables, 20/752 constraints. Problems are: Problem set: 240 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1279/2049 variables, and 752 constraints, problems are : Problem set: 240 solved, 272 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/3 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 240/240 constraints]
After SMT, in 60109ms problems are : Problem set: 240 solved, 272 unsolved
Search for dead transitions found 240 dead transitions in 60116ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 528/768 transitions.
Graph (complete) has 2082 edges and 1281 vertex of which 1041 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.3 ms
Discarding 240 places :
Also discarding 0 output transitions
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 1 rules in 31 ms. Remains 1041 /1281 variables (removed 240) and now considering 528/528 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1041/1281 places, 528/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60289 ms. Remains : 1041/1281 places, 528/768 transitions.
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 34 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-06-01 01:52:45] [INFO ] Computed 514 invariants in 14 ms
[2024-06-01 01:52:46] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 01:52:46] [INFO ] Invariant cache hit.
[2024-06-01 01:52:47] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:52:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 510/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30072ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30077ms
Finished structural reductions in LTL mode , in 1 iterations and 31911 ms. Remains : 1281/1281 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 198913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1287 transition count 528
Reduce places removed 240 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 242 rules applied. Total rules applied 482 place count 1047 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 76 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-06-01 01:53:17] [INFO ] Computed 520 invariants in 7 ms
[2024-06-01 01:53:18] [INFO ] Implicit Places using invariants in 663 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 667 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 769 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-10
Product exploration explored 100000 steps with 343 reset in 3634 ms.
Product exploration explored 100000 steps with 349 reset in 3984 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 634 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 1565 ms. (25 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 1/1 properties
// Phase 1: matrix 512 rows 1024 cols
[2024-06-01 01:53:27] [INFO ] Computed 513 invariants in 9 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/1536 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/511 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/1024 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p0), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 837 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
[2024-06-01 01:53:28] [INFO ] Invariant cache hit.
[2024-06-01 01:53:29] [INFO ] [Real]Absence check using 511 positive place invariants in 236 ms returned sat
[2024-06-01 01:53:29] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 81 ms returned sat
[2024-06-01 01:53:32] [INFO ] [Real]Absence check using state equation in 3070 ms returned sat
[2024-06-01 01:53:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:53:33] [INFO ] [Nat]Absence check using 511 positive place invariants in 229 ms returned sat
[2024-06-01 01:53:33] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 68 ms returned sat
[2024-06-01 01:53:41] [INFO ] [Nat]Absence check using state equation in 8600 ms returned sat
[2024-06-01 01:53:41] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 01:53:44] [INFO ] Added : 5 causal constraints over 1 iterations in 2550 ms. Result :sat
Could not prove EG (AND (NOT p2) p1 (NOT p0))
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 39 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 01:53:44] [INFO ] Invariant cache hit.
[2024-06-01 01:53:45] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-06-01 01:53:45] [INFO ] Invariant cache hit.
[2024-06-01 01:53:45] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2024-06-01 01:53:45] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 01:53:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61693 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 649 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 1730 steps (0 resets) in 85 ms. (20 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (F (NOT p1)), (F p0), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 2 factoid took 780 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
[2024-06-01 01:54:48] [INFO ] Invariant cache hit.
[2024-06-01 01:54:48] [INFO ] [Real]Absence check using 511 positive place invariants in 231 ms returned sat
[2024-06-01 01:54:48] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 72 ms returned sat
[2024-06-01 01:54:51] [INFO ] [Real]Absence check using state equation in 2982 ms returned sat
[2024-06-01 01:54:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:54:52] [INFO ] [Nat]Absence check using 511 positive place invariants in 233 ms returned sat
[2024-06-01 01:54:52] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 70 ms returned sat
[2024-06-01 01:55:01] [INFO ] [Nat]Absence check using state equation in 8672 ms returned sat
[2024-06-01 01:55:01] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 01:55:04] [INFO ] Added : 5 causal constraints over 1 iterations in 3116 ms. Result :sat
Could not prove EG (AND (NOT p2) p1 (NOT p0))
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
Product exploration explored 100000 steps with 325 reset in 3655 ms.
Product exploration explored 100000 steps with 358 reset in 4005 ms.
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 01:55:12] [INFO ] Invariant cache hit.
[2024-06-01 01:55:12] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-06-01 01:55:12] [INFO ] Invariant cache hit.
[2024-06-01 01:55:13] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
[2024-06-01 01:55:13] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 01:55:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61622 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-10 finished in 176471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1287 transition count 526
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 484 place count 1045 transition count 520
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 69 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-06-01 01:56:13] [INFO ] Computed 520 invariants in 15 ms
[2024-06-01 01:56:14] [INFO ] Implicit Places using invariants in 681 ms returned [76, 227, 242, 594, 775, 947]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 682 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1287 places, 513/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 778 ms. Remains : 1026/1287 places, 513/768 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-11
Product exploration explored 100000 steps with 536 reset in 3664 ms.
Product exploration explored 100000 steps with 562 reset in 4044 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 704 steps (0 resets) in 40 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 513 rows 1026 cols
[2024-06-01 01:56:23] [INFO ] Computed 514 invariants in 6 ms
[2024-06-01 01:56:23] [INFO ] [Real]Absence check using 510 positive place invariants in 233 ms returned sat
[2024-06-01 01:56:23] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 70 ms returned sat
[2024-06-01 01:56:33] [INFO ] [Real]Absence check using state equation in 9622 ms returned sat
[2024-06-01 01:56:33] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 01:56:38] [INFO ] Added : 30 causal constraints over 6 iterations in 4624 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 31 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 01:56:38] [INFO ] Invariant cache hit.
[2024-06-01 01:56:38] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-06-01 01:56:38] [INFO ] Invariant cache hit.
[2024-06-01 01:56:39] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2024-06-01 01:56:39] [INFO ] Redundant transitions in 4 ms returned []
Running 257 sub problems to find dead transitions.
[2024-06-01 01:56:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61571 ms. Remains : 1026/1026 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 811 steps (0 resets) in 44 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 01:57:40] [INFO ] Invariant cache hit.
[2024-06-01 01:57:41] [INFO ] [Real]Absence check using 510 positive place invariants in 248 ms returned sat
[2024-06-01 01:57:41] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 100 ms returned sat
[2024-06-01 01:57:45] [INFO ] [Real]Absence check using state equation in 4044 ms returned sat
[2024-06-01 01:57:45] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 01:57:55] [INFO ] Added : 45 causal constraints over 9 iterations in 10124 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 542 reset in 3681 ms.
Product exploration explored 100000 steps with 550 reset in 4042 ms.
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 01:58:03] [INFO ] Invariant cache hit.
[2024-06-01 01:58:04] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-06-01 01:58:04] [INFO ] Invariant cache hit.
[2024-06-01 01:58:05] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2024-06-01 01:58:05] [INFO ] Redundant transitions in 8 ms returned []
Running 257 sub problems to find dead transitions.
[2024-06-01 01:58:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 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 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61630 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-11 finished in 171510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(F((p2||G(!p1)))))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 42 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-06-01 01:59:05] [INFO ] Computed 520 invariants in 13 ms
[2024-06-01 01:59:06] [INFO ] Implicit Places using invariants in 760 ms returned [92, 743, 794, 968, 1183]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 761 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1287 places, 768/768 transitions.
Applied a total of 0 rules in 35 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 838 ms. Remains : 1282/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12
Product exploration explored 100000 steps with 183 reset in 3302 ms.
Product exploration explored 100000 steps with 200 reset in 3603 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 678 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
RANDOM walk for 12956 steps (2 resets) in 421 ms. (30 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 3 factoid took 735 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
// Phase 1: matrix 768 rows 1282 cols
[2024-06-01 01:59:15] [INFO ] Computed 515 invariants in 13 ms
[2024-06-01 01:59:16] [INFO ] [Real]Absence check using 511 positive place invariants in 268 ms returned sat
[2024-06-01 01:59:16] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 102 ms returned sat
[2024-06-01 01:59:30] [INFO ] [Real]Absence check using state equation in 14038 ms returned unknown
Could not prove EG (AND (NOT p2) p1)
Support contains 4 out of 1282 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1282 transition count 518
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 1032 transition count 518
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 500 place count 1032 transition count 516
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 504 place count 1030 transition count 516
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 508 place count 1028 transition count 514
Applied a total of 508 rules in 58 ms. Remains 1028 /1282 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1028 cols
[2024-06-01 01:59:30] [INFO ] Computed 515 invariants in 15 ms
[2024-06-01 01:59:31] [INFO ] Implicit Places using invariants in 705 ms returned []
[2024-06-01 01:59:31] [INFO ] Invariant cache hit.
[2024-06-01 01:59:32] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2024-06-01 01:59:32] [INFO ] Redundant transitions in 4 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 01:59:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1027 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1542 variables, 1028/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1542 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1542/1542 variables, and 1543 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1028/1028 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1027 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1542 variables, 1028/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1542 variables, 258/1801 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1542 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1542/1542 variables, and 1801 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1028/1028 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1028/1282 places, 514/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61763 ms. Remains : 1028/1282 places, 514/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 536 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
RANDOM walk for 11447 steps (1 resets) in 481 ms. (23 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 691 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 117 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
[2024-06-01 02:00:34] [INFO ] Invariant cache hit.
[2024-06-01 02:00:35] [INFO ] [Real]Absence check using 511 positive place invariants in 222 ms returned sat
[2024-06-01 02:00:35] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 72 ms returned sat
[2024-06-01 02:00:41] [INFO ] [Real]Absence check using state equation in 5715 ms returned sat
[2024-06-01 02:00:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:00:41] [INFO ] [Nat]Absence check using 511 positive place invariants in 240 ms returned sat
[2024-06-01 02:00:41] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 42 ms returned sat
[2024-06-01 02:00:53] [INFO ] [Nat]Absence check using state equation in 11144 ms returned sat
[2024-06-01 02:00:53] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 02:00:56] [INFO ] Added : 20 causal constraints over 4 iterations in 3168 ms. Result :unknown
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 137 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 341 reset in 3640 ms.
Product exploration explored 100000 steps with 354 reset in 3946 ms.
Support contains 4 out of 1028 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1028/1028 places, 514/514 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1028 transition count 513
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1027 transition count 513
Applied a total of 2 rules in 30 ms. Remains 1027 /1028 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1027 cols
[2024-06-01 02:01:03] [INFO ] Computed 515 invariants in 11 ms
[2024-06-01 02:01:04] [INFO ] Implicit Places using invariants in 663 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 664 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1028 places, 513/514 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 721 ms. Remains : 1026/1028 places, 513/514 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 119452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1||F(p2))))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-06-01 02:01:04] [INFO ] Computed 520 invariants in 14 ms
[2024-06-01 02:01:05] [INFO ] Implicit Places using invariants in 755 ms returned [285, 304, 743, 794, 1183]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 765 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1287 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 842 ms. Remains : 1282/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-13
Product exploration explored 100000 steps with 21811 reset in 3845 ms.
Product exploration explored 100000 steps with 21856 reset in 4127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 374 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 2147 steps (0 resets) in 98 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 487 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 1282 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-06-01 02:01:15] [INFO ] Computed 515 invariants in 17 ms
[2024-06-01 02:01:16] [INFO ] Implicit Places using invariants in 743 ms returned []
[2024-06-01 02:01:16] [INFO ] Invariant cache hit.
[2024-06-01 02:01:17] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 02:01:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/2050 variables, and 514 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 1/1282 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2050 variables, 1282/1797 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2050 variables, 512/2309 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 2309 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1282/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in LTL mode , in 1 iterations and 61950 ms. Remains : 1282/1282 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 334 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 5651 steps (0 resets) in 223 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 355 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 21711 reset in 3793 ms.
Product exploration explored 100000 steps with 20625 reset in 4060 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 1282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1282 transition count 768
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 254 place count 1282 transition count 768
Deduced a syphon composed of 254 places in 0 ms
Applied a total of 254 rules in 101 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 02:02:27] [INFO ] Redundant transitions in 7 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-06-01 02:02:27] [INFO ] Computed 515 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-06-01 02:02:47] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-06-01 02:02:47] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
[2024-06-01 02:02:47] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-06-01 02:02:48] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 3 ms to minimize.
[2024-06-01 02:02:48] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-06-01 02:02:48] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 3 ms to minimize.
[2024-06-01 02:02:48] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-06-01 02:02:48] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-06-01 02:02:48] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-06-01 02:02:48] [INFO ] Deduced a trap composed of 2 places in 109 ms of which 2 ms to minimize.
[2024-06-01 02:02:48] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 3 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 2 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-06-01 02:02:49] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD504 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 20/534 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-06-01 02:02:50] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 2 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-06-01 02:02:51] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD510 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1281 variables, 20/554 constraints. Problems are: Problem set: 39 solved, 473 unsolved
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 2 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 2 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 2 ms to minimize.
[2024-06-01 02:02:57] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 20/574 constraints. Problems are: Problem set: 48 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/2050 variables, and 574 constraints, problems are : Problem set: 48 solved, 464 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 48 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 1/1 constraints. Problems are: Problem set: 48 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/722 variables, 0/1 constraints. Problems are: Problem set: 48 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 559/1281 variables, 512/513 constraints. Problems are: Problem set: 48 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 48 solved, 464 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 60/574 constraints. Problems are: Problem set: 59 solved, 453 unsolved
[2024-06-01 02:03:02] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-06-01 02:03:02] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-06-01 02:03:02] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-06-01 02:03:02] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-06-01 02:03:02] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 2 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:03:03] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD502 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1281 variables, 20/594 constraints. Problems are: Problem set: 79 solved, 433 unsolved
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD492 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 20/614 constraints. Problems are: Problem set: 99 solved, 413 unsolved
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 02:03:05] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD490 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 20/634 constraints. Problems are: Problem set: 119 solved, 393 unsolved
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 02:03:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1281 variables, 20/654 constraints. Problems are: Problem set: 139 solved, 373 unsolved
[2024-06-01 02:03:08] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 02:03:08] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 02:03:08] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-01 02:03:09] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 02:03:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-06-01 02:03:10] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1281 variables, 20/674 constraints. Problems are: Problem set: 159 solved, 353 unsolved
[2024-06-01 02:03:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-06-01 02:03:11] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-06-01 02:03:11] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-06-01 02:03:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
[2024-06-01 02:03:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD197 is UNSAT
[2024-06-01 02:03:13] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-06-01 02:03:13] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD204 is UNSAT
[2024-06-01 02:03:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-06-01 02:03:13] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1281 variables, 20/694 constraints. Problems are: Problem set: 179 solved, 333 unsolved
[2024-06-01 02:03:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-06-01 02:03:15] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-06-01 02:03:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD237 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD241 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD247 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD250 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/1281 variables, 20/714 constraints. Problems are: Problem set: 199 solved, 313 unsolved
[2024-06-01 02:03:19] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
[2024-06-01 02:03:19] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD260 is UNSAT
[2024-06-01 02:03:19] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-06-01 02:03:19] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-06-01 02:03:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-06-01 02:03:19] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD272 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD280 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD284 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD300 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD305 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD307 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD310 is UNSAT
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1281 variables, 20/734 constraints. Problems are: Problem set: 219 solved, 293 unsolved
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD313 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD314 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD316 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD324 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD328 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD334 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD335 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD341 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD347 is UNSAT
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD348 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD352 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD357 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD358 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD361 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD366 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD367 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD369 is UNSAT
[2024-06-01 02:03:25] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/1281 variables, 20/754 constraints. Problems are: Problem set: 239 solved, 273 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 Int declared 1281/2050 variables, and 754 constraints, problems are : Problem set: 239 solved, 273 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 240/240 constraints]
After SMT, in 60103ms problems are : Problem set: 239 solved, 273 unsolved
Search for dead transitions found 239 dead transitions in 60109ms
Found 239 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 239 transitions
Dead transitions reduction (with SMT) removed 239 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1282/1282 places, 529/768 transitions.
Graph (complete) has 2086 edges and 1282 vertex of which 1043 are kept as prefixes of interest. Removing 239 places using SCC suffix rule.1 ms
Discarding 239 places :
Also discarding 0 output transitions
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 1 rules in 29 ms. Remains 1043 /1282 variables (removed 239) and now considering 529/529 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1043/1282 places, 529/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60254 ms. Remains : 1043/1282 places, 529/768 transitions.
Support contains 4 out of 1282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-06-01 02:03:27] [INFO ] Computed 515 invariants in 13 ms
[2024-06-01 02:03:28] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-06-01 02:03:28] [INFO ] Invariant cache hit.
[2024-06-01 02:03:29] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 02:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 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 1281/2050 variables, and 514 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 1/1282 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2050 variables, 1282/1797 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2050 variables, 512/2309 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 2309 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1282/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LTL mode , in 1 iterations and 61952 ms. Remains : 1282/1282 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-13 finished in 204979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 242 rules applied. Total rules applied 481 place count 1048 transition count 526
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 65 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-06-01 02:04:29] [INFO ] Computed 520 invariants in 15 ms
[2024-06-01 02:04:30] [INFO ] Implicit Places using invariants in 701 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 703 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 25 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 795 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-14
Product exploration explored 100000 steps with 8 reset in 2688 ms.
Product exploration explored 100000 steps with 0 reset in 3005 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 371 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 1197 steps (0 resets) in 84 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 410 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 29 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-06-01 02:04:38] [INFO ] Computed 513 invariants in 12 ms
[2024-06-01 02:04:38] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-06-01 02:04:38] [INFO ] Invariant cache hit.
[2024-06-01 02:04:39] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2024-06-01 02:04:39] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 02:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 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 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61584 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 351 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 1705 steps (0 resets) in 83 ms. (20 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 439 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 3 reset in 2659 ms.
Product exploration explored 100000 steps with 0 reset in 3054 ms.
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 24 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 02:05:47] [INFO ] Invariant cache hit.
[2024-06-01 02:05:47] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-06-01 02:05:47] [INFO ] Invariant cache hit.
[2024-06-01 02:05:48] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2024-06-01 02:05:48] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 02:05:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61604 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-14 finished in 139156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0))||G((p0||(F(p2)&&p1)))))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 35 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-06-01 02:06:48] [INFO ] Computed 520 invariants in 16 ms
[2024-06-01 02:06:49] [INFO ] Implicit Places using invariants in 713 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 716 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 34 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 788 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-15
Product exploration explored 100000 steps with 191 reset in 3252 ms.
Product exploration explored 100000 steps with 182 reset in 3505 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 1549 ms. (25 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 1/1 properties
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 02:06:57] [INFO ] Computed 513 invariants in 9 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 4/2048 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/511 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 13 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 02:06:58] [INFO ] Invariant cache hit.
[2024-06-01 02:06:59] [INFO ] [Real]Absence check using 511 positive place invariants in 272 ms returned sat
[2024-06-01 02:06:59] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 44 ms returned sat
[2024-06-01 02:07:13] [INFO ] [Real]Absence check using state equation in 14083 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1280 transition count 516
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 504 place count 1028 transition count 516
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 504 place count 1028 transition count 512
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 512 place count 1024 transition count 512
Applied a total of 512 rules in 35 ms. Remains 1024 /1280 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-06-01 02:07:13] [INFO ] Computed 513 invariants in 15 ms
[2024-06-01 02:07:14] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-06-01 02:07:14] [INFO ] Invariant cache hit.
[2024-06-01 02:07:14] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2024-06-01 02:07:14] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 02:07:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1280 places, 512/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61579 ms. Remains : 1024/1280 places, 512/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 1111 steps (0 resets) in 78 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 02:08:15] [INFO ] Invariant cache hit.
[2024-06-01 02:08:16] [INFO ] [Real]Absence check using 511 positive place invariants in 225 ms returned sat
[2024-06-01 02:08:16] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 25 ms returned sat
[2024-06-01 02:08:22] [INFO ] [Real]Absence check using state equation in 5932 ms returned sat
[2024-06-01 02:08:22] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 02:08:30] [INFO ] Added : 30 causal constraints over 6 iterations in 8219 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 361 reset in 3675 ms.
Product exploration explored 100000 steps with 386 reset in 3894 ms.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 25 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 02:08:38] [INFO ] Invariant cache hit.
[2024-06-01 02:08:39] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-06-01 02:08:39] [INFO ] Invariant cache hit.
[2024-06-01 02:08:39] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
[2024-06-01 02:08:39] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 02:08:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 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 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61519 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 171094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||F(p1)))'
Found a Lengthening insensitive property : CircularTrains-PT-768-LTLFireability-03
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1048 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 480 place count 1047 transition count 520
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 69 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-06-01 02:09:40] [INFO ] Computed 520 invariants in 14 ms
[2024-06-01 02:09:40] [INFO ] Implicit Places using invariants in 678 ms returned [76, 227, 242, 636, 775, 947]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 679 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1026/1287 places, 513/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 774 ms. Remains : 1026/1287 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-03
Product exploration explored 100000 steps with 526 reset in 3586 ms.
Product exploration explored 100000 steps with 551 reset in 3966 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 5335 steps (0 resets) in 249 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 263 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 513 rows 1026 cols
[2024-06-01 02:09:50] [INFO ] Computed 514 invariants in 6 ms
[2024-06-01 02:09:50] [INFO ] [Real]Absence check using 510 positive place invariants in 237 ms returned sat
[2024-06-01 02:09:50] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 96 ms returned sat
[2024-06-01 02:09:55] [INFO ] [Real]Absence check using state equation in 4561 ms returned sat
[2024-06-01 02:09:55] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 02:10:03] [INFO ] Added : 35 causal constraints over 7 iterations in 8231 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 24 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 02:10:03] [INFO ] Invariant cache hit.
[2024-06-01 02:10:04] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-06-01 02:10:04] [INFO ] Invariant cache hit.
[2024-06-01 02:10:05] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-01 02:10:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 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 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in LTL mode , in 1 iterations and 61510 ms. Remains : 1026/1026 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 8285 steps (1 resets) in 284 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 271 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-06-01 02:11:06] [INFO ] Invariant cache hit.
[2024-06-01 02:11:07] [INFO ] [Real]Absence check using 510 positive place invariants in 235 ms returned sat
[2024-06-01 02:11:07] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 72 ms returned sat
[2024-06-01 02:11:12] [INFO ] [Real]Absence check using state equation in 4833 ms returned sat
[2024-06-01 02:11:12] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 02:11:21] [INFO ] Added : 45 causal constraints over 9 iterations in 9391 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 540 reset in 3768 ms.
Product exploration explored 100000 steps with 558 reset in 4103 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 31 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 02:11:30] [INFO ] Redundant transitions in 4 ms returned []
Running 257 sub problems to find dead transitions.
[2024-06-01 02:11:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60115 ms. Remains : 1026/1026 places, 513/513 transitions.
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 23 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 02:12:30] [INFO ] Invariant cache hit.
[2024-06-01 02:12:30] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-06-01 02:12:30] [INFO ] Invariant cache hit.
[2024-06-01 02:12:31] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-01 02:12:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 61539 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 231907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(p0)) U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLFireability-07
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1287 transition count 527
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 483 place count 1046 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 71 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-06-01 02:13:32] [INFO ] Computed 520 invariants in 13 ms
[2024-06-01 02:13:32] [INFO ] Implicit Places using invariants in 676 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 678 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 776 ms. Remains : 1024/1287 places, 512/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-07
Product exploration explored 100000 steps with 24638 reset in 3191 ms.
Product exploration explored 100000 steps with 26842 reset in 3475 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 449 steps (0 resets) in 31 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 20 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-06-01 02:13:40] [INFO ] Computed 513 invariants in 12 ms
[2024-06-01 02:13:41] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-06-01 02:13:41] [INFO ] Invariant cache hit.
[2024-06-01 02:13:42] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 02:13:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 61612 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 971 steps (0 resets) in 51 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23917 reset in 3183 ms.
Product exploration explored 100000 steps with 27625 reset in 3481 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 29 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 02:14:50] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 02:14:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60109 ms. Remains : 1024/1024 places, 512/512 transitions.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 20 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 02:15:50] [INFO ] Invariant cache hit.
[2024-06-01 02:15:50] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-06-01 02:15:50] [INFO ] Invariant cache hit.
[2024-06-01 02:15:51] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-06-01 02:15:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in LTL mode , in 1 iterations and 61542 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-07 finished in 199834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(p1)))&&G(F(p2)))))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLFireability-09
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1287 transition count 528
Reduce places removed 240 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 242 rules applied. Total rules applied 482 place count 1047 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 484 place count 1045 transition count 520
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 65 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-06-01 02:16:52] [INFO ] Computed 520 invariants in 14 ms
[2024-06-01 02:16:52] [INFO ] Implicit Places using invariants in 691 ms returned [76, 227, 242, 593, 635, 774]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 692 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1026/1287 places, 513/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 783 ms. Remains : 1026/1287 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-09
Product exploration explored 100000 steps with 3 reset in 2644 ms.
Product exploration explored 100000 steps with 0 reset in 3035 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 436 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1667 steps (0 resets) in 69 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 564 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
// Phase 1: matrix 513 rows 1026 cols
[2024-06-01 02:17:00] [INFO ] Computed 514 invariants in 16 ms
[2024-06-01 02:17:01] [INFO ] [Real]Absence check using 511 positive place invariants in 233 ms returned sat
[2024-06-01 02:17:01] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 30 ms returned sat
[2024-06-01 02:17:08] [INFO ] [Real]Absence check using state equation in 7060 ms returned sat
[2024-06-01 02:17:08] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 02:17:13] [INFO ] Added : 15 causal constraints over 3 iterations in 5145 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-06-01 02:17:13] [INFO ] Invariant cache hit.
[2024-06-01 02:17:14] [INFO ] [Real]Absence check using 511 positive place invariants in 236 ms returned sat
[2024-06-01 02:17:14] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 90 ms returned sat
[2024-06-01 02:17:19] [INFO ] [Real]Absence check using state equation in 4769 ms returned sat
[2024-06-01 02:17:19] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 02:17:27] [INFO ] Added : 35 causal constraints over 7 iterations in 7905 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 20 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 02:17:27] [INFO ] Invariant cache hit.
[2024-06-01 02:17:27] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-01 02:17:27] [INFO ] Invariant cache hit.
[2024-06-01 02:17:28] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-01 02:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 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 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Finished structural reductions in LTL mode , in 1 iterations and 61571 ms. Remains : 1026/1026 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 334 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1689 steps (0 resets) in 80 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 422 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2024-06-01 02:18:30] [INFO ] Invariant cache hit.
[2024-06-01 02:18:31] [INFO ] [Real]Absence check using 511 positive place invariants in 232 ms returned sat
[2024-06-01 02:18:31] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 87 ms returned sat
[2024-06-01 02:18:37] [INFO ] [Real]Absence check using state equation in 5753 ms returned sat
[2024-06-01 02:18:37] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 02:18:44] [INFO ] Added : 25 causal constraints over 5 iterations in 7239 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 02:18:44] [INFO ] Invariant cache hit.
[2024-06-01 02:18:45] [INFO ] [Real]Absence check using 511 positive place invariants in 243 ms returned sat
[2024-06-01 02:18:45] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 89 ms returned sat
[2024-06-01 02:18:49] [INFO ] [Real]Absence check using state equation in 4598 ms returned sat
[2024-06-01 02:18:49] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 02:18:59] [INFO ] Added : 40 causal constraints over 8 iterations in 9578 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 2686 ms.
Product exploration explored 100000 steps with 1 reset in 3061 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 29 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 02:19:05] [INFO ] Redundant transitions in 3 ms returned []
Running 257 sub problems to find dead transitions.
[2024-06-01 02:19:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 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 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60097 ms. Remains : 1026/1026 places, 513/513 transitions.
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 24 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 02:20:05] [INFO ] Invariant cache hit.
[2024-06-01 02:20:06] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-06-01 02:20:06] [INFO ] Invariant cache hit.
[2024-06-01 02:20:07] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-01 02:20:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 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 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in LTL mode , in 1 iterations and 61519 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 255595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(!p1 U (p2||G(!p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(F((p2||G(!p1)))))))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLFireability-12
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1287 transition count 528
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 480 place count 1047 transition count 521
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 494 place count 1040 transition count 521
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 508 place count 1033 transition count 514
Applied a total of 508 rules in 59 ms. Remains 1033 /1287 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1033 cols
[2024-06-01 02:21:07] [INFO ] Computed 520 invariants in 15 ms
[2024-06-01 02:21:08] [INFO ] Implicit Places using invariants in 670 ms returned [76, 594, 636, 775, 947]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 675 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1028/1287 places, 514/768 transitions.
Applied a total of 0 rules in 30 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 765 ms. Remains : 1028/1287 places, 514/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12
Product exploration explored 100000 steps with 380 reset in 3657 ms.
Product exploration explored 100000 steps with 369 reset in 3945 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 568 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
RANDOM walk for 2293 steps (0 resets) in 123 ms. (18 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 2 factoid took 759 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
// Phase 1: matrix 514 rows 1028 cols
[2024-06-01 02:21:18] [INFO ] Computed 515 invariants in 7 ms
[2024-06-01 02:21:19] [INFO ] [Real]Absence check using 511 positive place invariants in 232 ms returned sat
[2024-06-01 02:21:19] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 98 ms returned sat
[2024-06-01 02:21:22] [INFO ] [Real]Absence check using state equation in 3437 ms returned sat
[2024-06-01 02:21:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:21:23] [INFO ] [Nat]Absence check using 511 positive place invariants in 230 ms returned sat
[2024-06-01 02:21:23] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 39 ms returned sat
[2024-06-01 02:21:28] [INFO ] [Nat]Absence check using state equation in 5450 ms returned sat
[2024-06-01 02:21:28] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 02:21:35] [INFO ] Added : 20 causal constraints over 4 iterations in 6743 ms. Result :unknown
Could not prove EG (AND (NOT p2) p1)
Support contains 4 out of 1028 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1028/1028 places, 514/514 transitions.
Applied a total of 0 rules in 24 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-06-01 02:21:35] [INFO ] Invariant cache hit.
[2024-06-01 02:21:36] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-06-01 02:21:36] [INFO ] Invariant cache hit.
[2024-06-01 02:21:36] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2024-06-01 02:21:36] [INFO ] Redundant transitions in 3 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 02:21:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1027 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1542 variables, 1028/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1542 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1542/1542 variables, and 1543 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1028/1028 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1027 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1542 variables, 1028/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1542 variables, 258/1801 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1542 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1542/1542 variables, and 1801 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1028/1028 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61508 ms. Remains : 1028/1028 places, 514/514 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 452 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
RANDOM walk for 5876 steps (0 resets) in 241 ms. (24 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 582 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 124 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
[2024-06-01 02:22:38] [INFO ] Invariant cache hit.
[2024-06-01 02:22:39] [INFO ] [Real]Absence check using 511 positive place invariants in 210 ms returned sat
[2024-06-01 02:22:39] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 65 ms returned sat
[2024-06-01 02:22:43] [INFO ] [Real]Absence check using state equation in 3764 ms returned sat
[2024-06-01 02:22:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:22:44] [INFO ] [Nat]Absence check using 511 positive place invariants in 229 ms returned sat
[2024-06-01 02:22:44] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 70 ms returned sat
[2024-06-01 02:22:47] [INFO ] [Nat]Absence check using state equation in 3554 ms returned sat
[2024-06-01 02:22:47] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 02:22:54] [INFO ] Added : 25 causal constraints over 5 iterations in 6687 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 199 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 369 reset in 3571 ms.
Product exploration explored 100000 steps with 365 reset in 3856 ms.
Support contains 4 out of 1028 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1028/1028 places, 514/514 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1028 transition count 513
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1027 transition count 513
Applied a total of 2 rules in 28 ms. Remains 1027 /1028 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1027 cols
[2024-06-01 02:23:02] [INFO ] Computed 515 invariants in 14 ms
[2024-06-01 02:23:02] [INFO ] Implicit Places using invariants in 651 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 652 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1028 places, 513/514 transitions.
Applied a total of 0 rules in 24 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 705 ms. Remains : 1026/1028 places, 513/514 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 115173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0))||G((p0||(F(p2)&&p1)))))))'
Found a Lengthening insensitive property : CircularTrains-PT-768-LTLFireability-15
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1287 transition count 530
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 1049 transition count 530
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 476 place count 1049 transition count 519
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 65 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-06-01 02:23:03] [INFO ] Computed 520 invariants in 6 ms
[2024-06-01 02:23:03] [INFO ] Implicit Places using invariants in 635 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 635 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 727 ms. Remains : 1024/1287 places, 512/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-15
Product exploration explored 100000 steps with 375 reset in 3532 ms.
Product exploration explored 100000 steps with 351 reset in 3799 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 363 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 1484 ms. (26 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 1/1 properties
// Phase 1: matrix 512 rows 1024 cols
[2024-06-01 02:23:12] [INFO ] Computed 513 invariants in 6 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 4/1536 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[Positive P Invariants (semi-flows): 0/511 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/1024 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 524 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 02:23:13] [INFO ] Invariant cache hit.
[2024-06-01 02:23:14] [INFO ] [Real]Absence check using 511 positive place invariants in 232 ms returned sat
[2024-06-01 02:23:14] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 57 ms returned sat
[2024-06-01 02:23:18] [INFO ] [Real]Absence check using state equation in 4695 ms returned sat
[2024-06-01 02:23:18] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 02:23:23] [INFO ] Added : 20 causal constraints over 4 iterations in 5131 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 24 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 02:23:24] [INFO ] Invariant cache hit.
[2024-06-01 02:23:24] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-06-01 02:23:24] [INFO ] Invariant cache hit.
[2024-06-01 02:23:25] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
[2024-06-01 02:23:25] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 02:23:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 1.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 1.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61562 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 979 steps (0 resets) in 63 ms. (15 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 02:24:26] [INFO ] Invariant cache hit.
[2024-06-01 02:24:27] [INFO ] [Real]Absence check using 511 positive place invariants in 229 ms returned sat
[2024-06-01 02:24:27] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 55 ms returned sat
[2024-06-01 02:24:32] [INFO ] [Real]Absence check using state equation in 4882 ms returned sat
[2024-06-01 02:24:32] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 02:24:37] [INFO ] Added : 20 causal constraints over 4 iterations in 5163 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 370 reset in 3528 ms.
Product exploration explored 100000 steps with 360 reset in 3828 ms.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 23 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 02:24:44] [INFO ] Invariant cache hit.
[2024-06-01 02:24:45] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 02:24:45] [INFO ] Invariant cache hit.
[2024-06-01 02:24:46] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2024-06-01 02:24:46] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 02:24:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61566 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 163567 ms.
[2024-06-01 02:25:46] [INFO ] Flatten gal took : 38 ms
[2024-06-01 02:25:46] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 02:25:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1287 places, 768 transitions and 2574 arcs took 7 ms.
Total runtime 2703296 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-03
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-04
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-07
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-09
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-10
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-11
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-12
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-13
FORMULA CircularTrains-PT-768-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-15
BK_STOP 1717208975718
--------------------
content from stderr:
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CircularTrains-PT-768-LTLFireability-03
ltl formula formula --ltl=/tmp/8145/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1289 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 777 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1376 levels ~10000 states ~658788 transitions
pnml2lts-mc( 0/ 4): ~2725 levels ~20000 states ~876068 transitions
pnml2lts-mc( 0/ 4): ~5449 levels ~40000 states ~1119636 transitions
pnml2lts-mc( 0/ 4): ~10869 levels ~80000 states ~1371248 transitions
pnml2lts-mc( 0/ 4): ~21774 levels ~160000 states ~1701676 transitions
pnml2lts-mc( 0/ 4): ~43484 levels ~320000 states ~2050104 transitions
pnml2lts-mc( 0/ 4): ~49013 levels ~640000 states ~2660576 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 669528
pnml2lts-mc( 0/ 4): unique states count: 864966
pnml2lts-mc( 0/ 4): unique transitions count: 3389400
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 619393
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 865184
pnml2lts-mc( 0/ 4): - cum. max stack depth: 196075
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 865184 states 3390810 transitions, fanout: 3.919
pnml2lts-mc( 0/ 4): Total exploration time 30.790 sec (30.780 sec minimum, 30.788 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28100, Transitions per second: 110127
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 85.1MB, 32.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 85.1MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-04
ltl formula formula --ltl=/tmp/8145/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1288 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 783 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~1726932 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~2171836 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~2639300 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~3157944 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 118914
pnml2lts-mc( 0/ 4): unique transitions count: 4155939
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 118917
pnml2lts-mc( 0/ 4): - cum. max stack depth: 118917
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 118917 states 4158230 transitions, fanout: 34.967
pnml2lts-mc( 0/ 4): Total exploration time 7.960 sec (7.920 sec minimum, 7.935 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14939, Transitions per second: 522391
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 90.7MB, 27.1 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 10.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 90.7MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-07
ltl formula formula --ltl=/tmp/8145/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1289 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 771 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1757 levels ~10000 states ~1108672 transitions
pnml2lts-mc( 3/ 4): ~3071 levels ~20000 states ~1310888 transitions
pnml2lts-mc( 3/ 4): ~5674 levels ~40000 states ~1535436 transitions
pnml2lts-mc( 1/ 4): ~11608 levels ~80000 states ~1772584 transitions
pnml2lts-mc( 3/ 4): ~21583 levels ~160000 states ~2057972 transitions
pnml2lts-mc( 3/ 4): ~42723 levels ~320000 states ~2392260 transitions
pnml2lts-mc( 3/ 4): ~49404 levels ~640000 states ~3011076 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 477015
pnml2lts-mc( 0/ 4): unique states count: 674060
pnml2lts-mc( 0/ 4): unique transitions count: 3236154
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 389824
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 674078
pnml2lts-mc( 0/ 4): - cum. max stack depth: 197626
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 674078 states 3238459 transitions, fanout: 4.804
pnml2lts-mc( 0/ 4): Total exploration time 23.840 sec (23.830 sec minimum, 23.838 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28275, Transitions per second: 135841
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 83.4MB, 34.4 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 83.4MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-09
ltl formula formula --ltl=/tmp/8145/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 1288 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 796 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~1552948 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~2153436 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~2650932 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~3097348 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 124502
pnml2lts-mc( 0/ 4): unique transitions count: 3927192
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 124505
pnml2lts-mc( 0/ 4): - cum. max stack depth: 124505
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 124505 states 3927952 transitions, fanout: 31.549
pnml2lts-mc( 0/ 4): Total exploration time 7.650 sec (7.550 sec minimum, 7.585 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16275, Transitions per second: 513458
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 90.6MB, 27.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 10.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 90.6MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-10
ltl formula formula --ltl=/tmp/8145/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1288 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 787 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1921 levels ~10000 states ~851724 transitions
pnml2lts-mc( 2/ 4): ~3804 levels ~20000 states ~1155308 transitions
pnml2lts-mc( 0/ 4): ~7044 levels ~40000 states ~1615600 transitions
pnml2lts-mc( 0/ 4): ~14105 levels ~80000 states ~1866864 transitions
pnml2lts-mc( 0/ 4): ~28572 levels ~160000 states ~2146904 transitions
pnml2lts-mc( 0/ 4): ~48972 levels ~320000 states ~2484268 transitions
pnml2lts-mc( 0/ 4): ~49019 levels ~640000 states ~3111108 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 542400
pnml2lts-mc( 0/ 4): unique states count: 737798
pnml2lts-mc( 0/ 4): unique transitions count: 3542275
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 389203
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 737801
pnml2lts-mc( 0/ 4): - cum. max stack depth: 196093
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 737801 states 3544581 transitions, fanout: 4.804
pnml2lts-mc( 0/ 4): Total exploration time 26.420 sec (26.410 sec minimum, 26.413 sec on average)
pnml2lts-mc( 0/ 4): States per second: 27926, Transitions per second: 134163
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 84.1MB, 33.5 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 84.1MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-11
ltl formula formula --ltl=/tmp/8145/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1289 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 770 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1989 levels ~10000 states ~767720 transitions
pnml2lts-mc( 0/ 4): ~3939 levels ~20000 states ~1016708 transitions
pnml2lts-mc( 0/ 4): ~7702 levels ~40000 states ~1257412 transitions
pnml2lts-mc( 0/ 4): ~15552 levels ~80000 states ~1498448 transitions
pnml2lts-mc( 0/ 4): ~31226 levels ~160000 states ~1765844 transitions
pnml2lts-mc( 0/ 4): ~48962 levels ~320000 states ~2124616 transitions
pnml2lts-mc( 0/ 4): ~48962 levels ~640000 states ~2760212 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 521725
pnml2lts-mc( 0/ 4): unique states count: 716900
pnml2lts-mc( 0/ 4): unique transitions count: 3006575
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 384230
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 716903
pnml2lts-mc( 0/ 4): - cum. max stack depth: 195931
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 716903 states 3007345 transitions, fanout: 4.195
pnml2lts-mc( 0/ 4): Total exploration time 31.590 sec (31.570 sec minimum, 31.580 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22694, Transitions per second: 95199
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 84.0MB, 33.6 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 84.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-12
ltl formula formula --ltl=/tmp/8145/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1288 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 786 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1739 levels ~10000 states ~990844 transitions
pnml2lts-mc( 2/ 4): ~3360 levels ~20000 states ~1210952 transitions
pnml2lts-mc( 2/ 4): ~6595 levels ~40000 states ~1524356 transitions
pnml2lts-mc( 0/ 4): ~13327 levels ~80000 states ~1953980 transitions
pnml2lts-mc( 0/ 4): ~24896 levels ~160000 states ~2394204 transitions
pnml2lts-mc( 0/ 4): ~47513 levels ~320000 states ~3020900 transitions
pnml2lts-mc( 0/ 4): ~49023 levels ~640000 states ~4243276 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 538052
pnml2lts-mc( 0/ 4): unique states count: 733329
pnml2lts-mc( 0/ 4): unique transitions count: 5173287
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1482203
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 764570
pnml2lts-mc( 0/ 4): - cum. max stack depth: 196044
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 764570 states 5409199 transitions, fanout: 7.075
pnml2lts-mc( 0/ 4): Total exploration time 27.730 sec (27.700 sec minimum, 27.715 sec on average)
pnml2lts-mc( 0/ 4): States per second: 27572, Transitions per second: 195067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 84.0MB, 33.6 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 84.0MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-13
ltl formula formula --ltl=/tmp/8145/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1289 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 784 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1220 levels ~10000 states ~654556 transitions
pnml2lts-mc( 1/ 4): ~2766 levels ~20000 states ~880076 transitions
pnml2lts-mc( 1/ 4): ~5571 levels ~40000 states ~1083452 transitions
pnml2lts-mc( 1/ 4): ~11158 levels ~80000 states ~1303472 transitions
pnml2lts-mc( 1/ 4): ~22262 levels ~160000 states ~1586324 transitions
pnml2lts-mc( 1/ 4): ~44449 levels ~320000 states ~2001220 transitions
pnml2lts-mc( 1/ 4): ~48956 levels ~640000 states ~2574264 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 713657
pnml2lts-mc( 0/ 4): unique states count: 908851
pnml2lts-mc( 0/ 4): unique transitions count: 3287262
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 525721
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 916673
pnml2lts-mc( 0/ 4): - cum. max stack depth: 195953
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 916673 states 3311277 transitions, fanout: 3.612
pnml2lts-mc( 0/ 4): Total exploration time 31.470 sec (31.460 sec minimum, 31.462 sec on average)
pnml2lts-mc( 0/ 4): States per second: 29128, Transitions per second: 105220
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 85.1MB, 32.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 85.1MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-14
ltl formula formula --ltl=/tmp/8145/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 1288 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 785 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~903008 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~1161644 transitions
pnml2lts-mc( 2/ 4): ~9144 levels ~40000 states ~1390704 transitions
pnml2lts-mc( 2/ 4): ~15162 levels ~80000 states ~1563360 transitions
pnml2lts-mc( 2/ 4): ~27431 levels ~160000 states ~1818688 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~50044!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 41186
pnml2lts-mc( 0/ 4): unique states count: 199834
pnml2lts-mc( 0/ 4): unique transitions count: 2365046
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 199837
pnml2lts-mc( 0/ 4): - cum. max stack depth: 158651
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 199837 states 2365818 transitions, fanout: 11.839
pnml2lts-mc( 0/ 4): Total exploration time 8.370 sec (8.370 sec minimum, 8.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23875, Transitions per second: 282654
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 70.9MB, 36.3 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/86.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 70.9MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLFireability-15
ltl formula formula --ltl=/tmp/8145/ltl_9_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1287 places, 768 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8145/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8145/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8145/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8145/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1289 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1288, there are 773 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1610 levels ~10000 states ~803776 transitions
pnml2lts-mc( 3/ 4): ~3179 levels ~20000 states ~1058672 transitions
pnml2lts-mc( 3/ 4): ~6273 levels ~40000 states ~1269576 transitions
pnml2lts-mc( 3/ 4): ~12684 levels ~80000 states ~1501196 transitions
pnml2lts-mc( 3/ 4): ~25474 levels ~160000 states ~1770940 transitions
pnml2lts-mc( 3/ 4): ~49023 levels ~320000 states ~2129484 transitions
pnml2lts-mc( 3/ 4): ~49023 levels ~640000 states ~2674560 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 557160
pnml2lts-mc( 0/ 4): unique states count: 752535
pnml2lts-mc( 0/ 4): unique transitions count: 3368369
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 427572
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 752573
pnml2lts-mc( 0/ 4): - cum. max stack depth: 196098
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 752573 states 3370777 transitions, fanout: 4.479
pnml2lts-mc( 0/ 4): Total exploration time 26.560 sec (26.540 sec minimum, 26.550 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28335, Transitions per second: 126912
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 84.4MB, 33.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 84.4MB (~256.0MB paged-in)
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="CircularTrains-PT-768"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CircularTrains-PT-768, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505700372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-768.tgz
mv CircularTrains-PT-768 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;