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.r069-tall-171620504400372.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 greatspnxred
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 r069-tall-171620504400372
=====================================================================

--------------------
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 1716432513029

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:48:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:48:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:48:34] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-23 02:48:34] [INFO ] Transformed 1536 places.
[2024-05-23 02:48:34] [INFO ] Transformed 768 transitions.
[2024-05-23 02:48:34] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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 177 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2024-05-23 02:48:34] [INFO ] Computed 769 invariants in 94 ms
[2024-05-23 02:48:37] [INFO ] Implicit Places using invariants in 2407 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 2486 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 202 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 2896 ms. Remains : 1287/1536 places, 768/768 transitions.
Support contains 56 out of 1287 places after structural reductions.
[2024-05-23 02:48:38] [INFO ] Flatten gal took : 216 ms
[2024-05-23 02:48:38] [INFO ] Flatten gal took : 104 ms
[2024-05-23 02:48:38] [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 20932 steps (4 resets) in 2800 ms. (7 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 50 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-23 02:48:40] [INFO ] Computed 520 invariants in 44 ms
[2024-05-23 02:48:41] [INFO ] Implicit Places using invariants in 1150 ms returned [92, 285, 304, 794, 968, 1183]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1154 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 76 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 1281 ms. Remains : 1281/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 302 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 472 reset in 4169 ms.
Product exploration explored 100000 steps with 467 reset in 4278 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 176 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 157 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 15061 steps (3 resets) in 914 ms. (16 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 241 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 167 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-05-23 02:48:51] [INFO ] Computed 514 invariants in 9 ms
[2024-05-23 02:48:52] [INFO ] [Real]Absence check using 510 positive place invariants in 244 ms returned sat
[2024-05-23 02:48:52] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 107 ms returned sat
[2024-05-23 02:49:01] [INFO ] [Real]Absence check using state equation in 8944 ms returned sat
[2024-05-23 02:49:02] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 138 ms.
[2024-05-23 02:49:06] [INFO ] Added : 15 causal constraints over 3 iterations in 4774 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 62 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:49:06] [INFO ] Invariant cache hit.
[2024-05-23 02:49:08] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2024-05-23 02:49:08] [INFO ] Invariant cache hit.
[2024-05-23 02:49:09] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 2604 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:49:09] [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
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 1279/2049 variables, and 512 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30027 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 30040 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 60351ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Finished structural reductions in LTL mode , in 1 iterations and 63048 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 160 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 168 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 9565 steps (1 resets) in 698 ms. (13 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 232 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 168 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 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-23 02:50:11] [INFO ] Invariant cache hit.
[2024-05-23 02:50:12] [INFO ] [Real]Absence check using 510 positive place invariants in 370 ms returned sat
[2024-05-23 02:50:12] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 116 ms returned sat
[2024-05-23 02:50:21] [INFO ] [Real]Absence check using state equation in 8840 ms returned sat
[2024-05-23 02:50:21] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 49 ms.
[2024-05-23 02:50:26] [INFO ] Added : 15 causal constraints over 3 iterations in 4975 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 165 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 464 reset in 3869 ms.
Product exploration explored 100000 steps with 459 reset in 4076 ms.
Applying partial POR strategy [true, false, true, false, false]
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))]
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 0 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 3 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 368 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:50:35] [INFO ] Redundant transitions in 77 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-23 02:50:35] [INFO ] Computed 514 invariants in 9 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-05-23 02:50:56] [INFO ] Deduced a trap composed of 2 places in 210 ms of which 28 ms to minimize.
[2024-05-23 02:50:56] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 8 ms to minimize.
[2024-05-23 02:50:57] [INFO ] Deduced a trap composed of 2 places in 217 ms of which 17 ms to minimize.
[2024-05-23 02:50:57] [INFO ] Deduced a trap composed of 2 places in 148 ms of which 6 ms to minimize.
[2024-05-23 02:50:57] [INFO ] Deduced a trap composed of 2 places in 221 ms of which 3 ms to minimize.
[2024-05-23 02:50:57] [INFO ] Deduced a trap composed of 2 places in 147 ms of which 3 ms to minimize.
[2024-05-23 02:50:57] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 3 ms to minimize.
[2024-05-23 02:50:58] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 3 ms to minimize.
[2024-05-23 02:50:58] [INFO ] Deduced a trap composed of 2 places in 157 ms of which 2 ms to minimize.
[2024-05-23 02:50:58] [INFO ] Deduced a trap composed of 2 places in 137 ms of which 3 ms to minimize.
[2024-05-23 02:50:58] [INFO ] Deduced a trap composed of 2 places in 136 ms of which 2 ms to minimize.
[2024-05-23 02:50:58] [INFO ] Deduced a trap composed of 2 places in 148 ms of which 2 ms to minimize.
[2024-05-23 02:50:58] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 2 ms to minimize.
[2024-05-23 02:50:59] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 02:50:59] [INFO ] Deduced a trap composed of 2 places in 198 ms of which 2 ms to minimize.
[2024-05-23 02:50:59] [INFO ] Deduced a trap composed of 2 places in 214 ms of which 4 ms to minimize.
[2024-05-23 02:50:59] [INFO ] Deduced a trap composed of 2 places in 198 ms of which 4 ms to minimize.
[2024-05-23 02:50:59] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 4 ms to minimize.
[2024-05-23 02:51:00] [INFO ] Deduced a trap composed of 2 places in 820 ms of which 2 ms to minimize.
[2024-05-23 02:51:00] [INFO ] Deduced a trap composed of 2 places in 111 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-05-23 02:51:04] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 2 ms to minimize.
[2024-05-23 02:51:04] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 3 ms to minimize.
[2024-05-23 02:51:04] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 2 ms to minimize.
[2024-05-23 02:51:04] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 2 ms to minimize.
[2024-05-23 02:51:04] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2024-05-23 02:51:05] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 2 ms to minimize.
[2024-05-23 02:51:05] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-05-23 02:51:05] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
[2024-05-23 02:51:05] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 1 ms to minimize.
[2024-05-23 02:51:05] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-23 02:51:05] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
SMT process timed out in 30200ms, After SMT, problems are : Problem set: 20 solved, 492 unsolved
Search for dead transitions found 20 dead transitions in 30214ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 748/768 transitions.
Graph (complete) has 2522 edges and 1281 vertex of which 1261 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.6 ms
Discarding 20 places :
Also discarding 0 output transitions
Deduced a syphon composed of 235 places in 1 ms
Applied a total of 1 rules in 61 ms. Remains 1261 /1281 variables (removed 20) and now considering 748/748 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1261/1281 places, 748/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30759 ms. Remains : 1261/1281 places, 748/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 39 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-23 02:51:05] [INFO ] Computed 514 invariants in 8 ms
[2024-05-23 02:51:06] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2024-05-23 02:51:06] [INFO ] Invariant cache hit.
[2024-05-23 02:51:08] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 2190 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:51:08] [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 30041 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 30029 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 60190ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Finished structural reductions in LTL mode , in 1 iterations and 62428 ms. Remains : 1281/1281 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 208603 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 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 101 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-23 02:52:08] [INFO ] Computed 520 invariants in 7 ms
[2024-05-23 02:52:09] [INFO ] Implicit Places using invariants in 790 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 793 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 32 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 927 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 124 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 2862 ms.
Product exploration explored 100000 steps with 0 reset in 3255 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 458 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 117 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 2180 steps (0 resets) in 116 ms. (18 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 632 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 123 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 512 rows 1024 cols
[2024-05-23 02:52:17] [INFO ] Computed 513 invariants in 11 ms
[2024-05-23 02:52:18] [INFO ] [Real]Absence check using 511 positive place invariants in 230 ms returned sat
[2024-05-23 02:52:18] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-23 02:52:24] [INFO ] [Real]Absence check using state equation in 5649 ms returned sat
[2024-05-23 02:52:24] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-23 02:52:29] [INFO ] Added : 15 causal constraints over 3 iterations in 5294 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 37 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 02:52:29] [INFO ] Invariant cache hit.
[2024-05-23 02:52:30] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-23 02:52:30] [INFO ] Invariant cache hit.
[2024-05-23 02:52:31] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
[2024-05-23 02:52:31] [INFO ] Redundant transitions in 6 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 02:52:31] [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 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 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]
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 30024 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 60079ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61768 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 598 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 113 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 1993 steps (0 resets) in 109 ms. (18 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 801 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 101 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
[2024-05-23 02:53:33] [INFO ] Invariant cache hit.
[2024-05-23 02:53:34] [INFO ] [Real]Absence check using 511 positive place invariants in 243 ms returned sat
[2024-05-23 02:53:34] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 53 ms returned sat
[2024-05-23 02:53:39] [INFO ] [Real]Absence check using state equation in 5689 ms returned sat
[2024-05-23 02:53:39] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-23 02:53:45] [INFO ] Added : 15 causal constraints over 3 iterations in 5224 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2943 ms.
Product exploration explored 100000 steps with 0 reset in 3267 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 33 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 02:53:51] [INFO ] Invariant cache hit.
[2024-05-23 02:53:52] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-23 02:53:52] [INFO ] Invariant cache hit.
[2024-05-23 02:53:53] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
[2024-05-23 02:53:53] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 02:53:53] [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 30040 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 60092ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61807 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-04 finished in 164896 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 35 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-23 02:54:53] [INFO ] Computed 520 invariants in 8 ms
[2024-05-23 02:54:54] [INFO ] Implicit Places using invariants in 777 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 790 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 49 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 882 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 212 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 164 reset in 3508 ms.
Product exploration explored 100000 steps with 150 reset in 3634 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 280 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 182 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
RANDOM walk for 22453 steps (5 resets) in 991 ms. (22 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 390 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 177 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 02:55:03] [INFO ] Computed 513 invariants in 9 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 419 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 11398 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 35 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-23 02:55:04] [INFO ] Computed 520 invariants in 8 ms
[2024-05-23 02:55:05] [INFO ] Implicit Places using invariants in 860 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 875 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 44 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 957 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-07
Product exploration explored 100000 steps with 22174 reset in 3296 ms.
Product exploration explored 100000 steps with 21638 reset in 3575 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 157 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 669 steps (0 resets) in 49 ms. (13 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 165 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 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 34 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 02:55:13] [INFO ] Computed 513 invariants in 16 ms
[2024-05-23 02:55:14] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-23 02:55:14] [INFO ] Invariant cache hit.
[2024-05-23 02:55:15] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:55:15] [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 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 0.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 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 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 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 0.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)
(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)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 30086ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30094ms
Finished structural reductions in LTL mode , in 1 iterations and 31963 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 152 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 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 773 steps (0 resets) in 49 ms. (15 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 155 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22219 reset in 3259 ms.
Product exploration explored 100000 steps with 22370 reset in 3489 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 63 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 95 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:55:53] [INFO ] Redundant transitions in 9 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 02:55:53] [INFO ] Computed 513 invariants in 7 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-05-23 02:56:04] [INFO ] Deduced a trap composed of 2 places in 149 ms of which 3 ms to minimize.
[2024-05-23 02:56:04] [INFO ] Deduced a trap composed of 2 places in 136 ms of which 3 ms to minimize.
[2024-05-23 02:56:04] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 3 ms to minimize.
[2024-05-23 02:56:05] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 5 ms to minimize.
[2024-05-23 02:56:05] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 2 ms to minimize.
[2024-05-23 02:56:05] [INFO ] Deduced a trap composed of 2 places in 132 ms of which 2 ms to minimize.
[2024-05-23 02:56:05] [INFO ] Deduced a trap composed of 2 places in 126 ms of which 2 ms to minimize.
[2024-05-23 02:56:05] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 2 ms to minimize.
[2024-05-23 02:56:05] [INFO ] Deduced a trap composed of 2 places in 137 ms of which 2 ms to minimize.
[2024-05-23 02:56:06] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 2 ms to minimize.
[2024-05-23 02:56:06] [INFO ] Deduced a trap composed of 2 places in 144 ms of which 2 ms to minimize.
[2024-05-23 02:56:06] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-23 02:56:06] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 2 ms to minimize.
[2024-05-23 02:56:06] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 02:56:06] [INFO ] Deduced a trap composed of 2 places in 114 ms of which 3 ms to minimize.
[2024-05-23 02:56:06] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 2 ms to minimize.
[2024-05-23 02:56:07] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 2 ms to minimize.
[2024-05-23 02:56:07] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 2 ms to minimize.
[2024-05-23 02:56:07] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-05-23 02:56:07] [INFO ] Deduced a trap composed of 2 places in 114 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-05-23 02:56:18] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 2 ms to minimize.
[2024-05-23 02:56:18] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 02:56:18] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 02:56:18] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-23 02:56:18] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 10 ms to minimize.
[2024-05-23 02:56:18] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
[2024-05-23 02:56:19] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 1 ms to minimize.
[2024-05-23 02:56:19] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-05-23 02:56:19] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 1 ms to minimize.
[2024-05-23 02:56:19] [INFO ] Deduced a trap composed of 2 places in 133 ms of which 2 ms to minimize.
[2024-05-23 02:56:19] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2024-05-23 02:56:19] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-23 02:56:19] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-05-23 02:56:19] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-23 02:56:20] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-23 02:56:20] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-05-23 02:56:20] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 1 ms to minimize.
[2024-05-23 02:56:20] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-23 02:56:20] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-23 02:56:20] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 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-05-23 02:56:21] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-23 02:56:21] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-05-23 02:56:21] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 1 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-05-23 02:56:22] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-05-23 02:56:23] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-05-23 02:56:23] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 ms to minimize.
[2024-05-23 02:56:23] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-23 02:56:23] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-23 02:56:23] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-05-23 02:56:23] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-23 02:56:23] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-05-23 02:56:23] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 4 ms to minimize.
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 40 solved, 472 unsolved
Search for dead transitions found 40 dead transitions in 30127ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1280/1280 places, 728/768 transitions.
Graph (complete) has 2480 edges and 1280 vertex of which 1240 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 0 output transitions
Deduced a syphon composed of 216 places in 0 ms
Applied a total of 1 rules in 47 ms. Remains 1240 /1280 variables (removed 40) and now considering 728/728 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1240/1280 places, 728/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30298 ms. Remains : 1240/1280 places, 728/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 33 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 02:56:23] [INFO ] Computed 513 invariants in 8 ms
[2024-05-23 02:56:24] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-23 02:56:24] [INFO ] Invariant cache hit.
[2024-05-23 02:56:25] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:56:25] [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
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 30080ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30086ms
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 111097 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 35 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-23 02:56:55] [INFO ] Computed 520 invariants in 10 ms
[2024-05-23 02:56:56] [INFO ] Implicit Places using invariants in 797 ms returned [92, 285, 304, 743, 794, 968]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 799 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 269 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 2697 ms.
Product exploration explored 100000 steps with 0 reset in 3080 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 439 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 2956 steps (0 resets) in 159 ms. (18 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 494 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 210 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 199 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-05-23 02:57:04] [INFO ] Computed 514 invariants in 10 ms
[2024-05-23 02:57:05] [INFO ] [Real]Absence check using 511 positive place invariants in 248 ms returned sat
[2024-05-23 02:57:05] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 128 ms returned sat
[2024-05-23 02:57:12] [INFO ] [Real]Absence check using state equation in 6488 ms returned sat
[2024-05-23 02:57:12] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-23 02:57:17] [INFO ] Added : 15 causal constraints over 3 iterations in 5274 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-23 02:57:17] [INFO ] Invariant cache hit.
[2024-05-23 02:57:18] [INFO ] [Real]Absence check using 511 positive place invariants in 278 ms returned sat
[2024-05-23 02:57:18] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 140 ms returned sat
[2024-05-23 02:57:29] [INFO ] [Real]Absence check using state equation in 10588 ms returned sat
[2024-05-23 02:57:29] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-23 02:57:32] [INFO ] Added : 10 causal constraints over 2 iterations in 3323 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 39 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:57:32] [INFO ] Invariant cache hit.
[2024-05-23 02:57:33] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-05-23 02:57:33] [INFO ] Invariant cache hit.
[2024-05-23 02:57:34] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:57:34] [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 30087ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30091ms
Finished structural reductions in LTL mode , in 1 iterations and 31939 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 368 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 225 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 1217 steps (0 resets) in 63 ms. (19 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 412 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 215 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 206 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-05-23 02:58:06] [INFO ] Invariant cache hit.
[2024-05-23 02:58:07] [INFO ] [Real]Absence check using 511 positive place invariants in 254 ms returned sat
[2024-05-23 02:58:07] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 128 ms returned sat
[2024-05-23 02:58:21] [INFO ] [Real]Absence check using state equation in 14024 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-23 02:58:21] [INFO ] Invariant cache hit.
[2024-05-23 02:58:22] [INFO ] [Real]Absence check using 511 positive place invariants in 257 ms returned sat
[2024-05-23 02:58:22] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 132 ms returned sat
[2024-05-23 02:58:32] [INFO ] [Real]Absence check using state equation in 10239 ms returned sat
[2024-05-23 02:58:33] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-23 02:58:36] [INFO ] Added : 10 causal constraints over 2 iterations in 3695 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 215 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 2799 ms.
Product exploration explored 100000 steps with 0 reset in 3067 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 210 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 120 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:58:43] [INFO ] Redundant transitions in 9 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-23 02:58:43] [INFO ] Computed 514 invariants in 9 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-05-23 02:58:54] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 3 ms to minimize.
[2024-05-23 02:58:54] [INFO ] Deduced a trap composed of 2 places in 136 ms of which 2 ms to minimize.
[2024-05-23 02:58:54] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 2 ms to minimize.
[2024-05-23 02:58:54] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 3 ms to minimize.
[2024-05-23 02:58:54] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 2 ms to minimize.
[2024-05-23 02:58:54] [INFO ] Deduced a trap composed of 2 places in 131 ms of which 2 ms to minimize.
[2024-05-23 02:58:55] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 3 ms to minimize.
[2024-05-23 02:58:55] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 2 ms to minimize.
[2024-05-23 02:58:55] [INFO ] Deduced a trap composed of 2 places in 126 ms of which 2 ms to minimize.
[2024-05-23 02:58:55] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 2 ms to minimize.
[2024-05-23 02:58:55] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 3 ms to minimize.
[2024-05-23 02:58:55] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 2 ms to minimize.
[2024-05-23 02:58:55] [INFO ] Deduced a trap composed of 2 places in 132 ms of which 2 ms to minimize.
[2024-05-23 02:58:56] [INFO ] Deduced a trap composed of 2 places in 132 ms of which 2 ms to minimize.
[2024-05-23 02:58:56] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 2 ms to minimize.
[2024-05-23 02:58:56] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
[2024-05-23 02:58:56] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-23 02:58:56] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 2 ms to minimize.
[2024-05-23 02:58:56] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-23 02:58:56] [INFO ] Deduced a trap composed of 2 places in 116 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-05-23 02:59:07] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-05-23 02:59:07] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 2 ms to minimize.
[2024-05-23 02:59:07] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-23 02:59:07] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 02:59:08] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 02:59:08] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-05-23 02:59:08] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-23 02:59:08] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2024-05-23 02:59:08] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 1 ms to minimize.
[2024-05-23 02:59:08] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-23 02:59:08] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-23 02:59:08] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-23 02:59:09] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-23 02:59:09] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-05-23 02:59:09] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 1 ms to minimize.
[2024-05-23 02:59:09] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-05-23 02:59:09] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-23 02:59:09] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 1 ms to minimize.
[2024-05-23 02:59:09] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 1 ms to minimize.
[2024-05-23 02:59:09] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 1 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-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 1 ms to minimize.
[2024-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-23 02:59:10] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 2 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-23 02:59:11] [INFO ] Deduced a trap composed of 2 places in 64 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-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 3 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-23 02:59:12] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 02:59:13] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:59:13] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 0 ms to minimize.
[2024-05-23 02:59:13] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 60 solved, 452 unsolved
Search for dead transitions found 60 dead transitions in 30107ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 708/768 transitions.
Graph (complete) has 2442 edges and 1281 vertex of which 1221 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.2 ms
Discarding 60 places :
Also discarding 0 output transitions
Deduced a syphon composed of 195 places in 0 ms
Applied a total of 1 rules in 37 ms. Remains 1221 /1281 variables (removed 60) and now considering 708/708 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1221/1281 places, 708/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30298 ms. Remains : 1221/1281 places, 708/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 40 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-23 02:59:13] [INFO ] Computed 514 invariants in 9 ms
[2024-05-23 02:59:14] [INFO ] Implicit Places using invariants in 790 ms returned []
[2024-05-23 02:59:14] [INFO ] Invariant cache hit.
[2024-05-23 02:59:15] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:59:15] [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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30084ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30089ms
Finished structural reductions in LTL mode , in 1 iterations and 31989 ms. Remains : 1281/1281 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 169614 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 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 82 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-23 02:59:45] [INFO ] Computed 520 invariants in 7 ms
[2024-05-23 02:59:46] [INFO ] Implicit Places using invariants in 716 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 742 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 34 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 859 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 87 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 319 reset in 3873 ms.
Product exploration explored 100000 steps with 342 reset in 4163 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 641 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 65 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 2651 ms. (15 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 778 ms. (51 steps per ms) remains 1/1 properties
// Phase 1: matrix 512 rows 1024 cols
[2024-05-23 02:59:56] [INFO ] Computed 513 invariants in 6 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 12 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 24ms 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 782 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 68 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 75 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
[2024-05-23 02:59:57] [INFO ] Invariant cache hit.
[2024-05-23 02:59:58] [INFO ] [Real]Absence check using 511 positive place invariants in 231 ms returned sat
[2024-05-23 02:59:58] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 78 ms returned sat
[2024-05-23 03:00:01] [INFO ] [Real]Absence check using state equation in 3170 ms returned sat
[2024-05-23 03:00:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:00:02] [INFO ] [Nat]Absence check using 511 positive place invariants in 247 ms returned sat
[2024-05-23 03:00:02] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 63 ms returned sat
[2024-05-23 03:00:10] [INFO ] [Nat]Absence check using state equation in 8636 ms returned sat
[2024-05-23 03:00:10] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-23 03:00:13] [INFO ] Added : 5 causal constraints over 1 iterations in 2995 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 38 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 03:00:13] [INFO ] Invariant cache hit.
[2024-05-23 03:00:14] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-23 03:00:14] [INFO ] Invariant cache hit.
[2024-05-23 03:00:15] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2024-05-23 03:00:15] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:00:15] [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 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 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 60066ms 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 61895 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 614 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 87 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 2446 steps (0 resets) in 112 ms. (21 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 884 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 90 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 81 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
[2024-05-23 03:01:18] [INFO ] Invariant cache hit.
[2024-05-23 03:01:18] [INFO ] [Real]Absence check using 511 positive place invariants in 226 ms returned sat
[2024-05-23 03:01:18] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-23 03:01:21] [INFO ] [Real]Absence check using state equation in 2951 ms returned sat
[2024-05-23 03:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:01:22] [INFO ] [Nat]Absence check using 511 positive place invariants in 213 ms returned sat
[2024-05-23 03:01:22] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 59 ms returned sat
[2024-05-23 03:01:30] [INFO ] [Nat]Absence check using state equation in 8222 ms returned sat
[2024-05-23 03:01:30] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-23 03:01:34] [INFO ] Added : 10 causal constraints over 2 iterations in 4211 ms. Result :sat
Could not prove EG (AND (NOT p2) p1 (NOT p0))
Stuttering acceptance computed with spot in 75 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 343 reset in 3983 ms.
Product exploration explored 100000 steps with 353 reset in 4152 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-05-23 03:01:43] [INFO ] Invariant cache hit.
[2024-05-23 03:01:43] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-05-23 03:01:43] [INFO ] Invariant cache hit.
[2024-05-23 03:01:44] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2024-05-23 03:01:44] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:01:44] [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 timeout
1.0)
(s586 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 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 30027 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 60074ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61690 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-10 finished in 179312 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 68 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-05-23 03:02:44] [INFO ] Computed 520 invariants in 13 ms
[2024-05-23 03:02:45] [INFO ] Implicit Places using invariants in 714 ms returned [76, 227, 242, 594, 775, 947]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 716 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 25 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 810 ms. Remains : 1026/1287 places, 513/768 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-11
Product exploration explored 100000 steps with 536 reset in 3815 ms.
Product exploration explored 100000 steps with 579 reset in 4109 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 183 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 40 ms :[(NOT p0)]
RANDOM walk for 196 steps (0 resets) in 25 ms. (7 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 191 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 513 rows 1026 cols
[2024-05-23 03:02:54] [INFO ] Computed 514 invariants in 10 ms
[2024-05-23 03:02:55] [INFO ] [Real]Absence check using 510 positive place invariants in 245 ms returned sat
[2024-05-23 03:02:55] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 79 ms returned sat
[2024-05-23 03:03:05] [INFO ] [Real]Absence check using state equation in 9724 ms returned sat
[2024-05-23 03:03:05] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-23 03:03:09] [INFO ] Added : 25 causal constraints over 5 iterations in 4486 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 28 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 03:03:09] [INFO ] Invariant cache hit.
[2024-05-23 03:03:10] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-05-23 03:03:10] [INFO ] Invariant cache hit.
[2024-05-23 03:03:11] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
[2024-05-23 03:03:11] [INFO ] Redundant transitions in 5 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-23 03:03:11] [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 30014 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 60068ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61825 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 153 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 39 ms :[(NOT p0)]
RANDOM walk for 865 steps (0 resets) in 49 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 203 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-23 03:04:12] [INFO ] Invariant cache hit.
[2024-05-23 03:04:13] [INFO ] [Real]Absence check using 510 positive place invariants in 244 ms returned sat
[2024-05-23 03:04:13] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 103 ms returned sat
[2024-05-23 03:04:17] [INFO ] [Real]Absence check using state equation in 4260 ms returned sat
[2024-05-23 03:04:17] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-23 03:04:27] [INFO ] Added : 45 causal constraints over 9 iterations in 9896 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 562 reset in 3856 ms.
Product exploration explored 100000 steps with 506 reset in 4058 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 46 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 03:04:35] [INFO ] Invariant cache hit.
[2024-05-23 03:04:36] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-23 03:04:36] [INFO ] Invariant cache hit.
[2024-05-23 03:04:36] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
[2024-05-23 03:04:37] [INFO ] Redundant transitions in 4 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-23 03:04:37] [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 "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 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, 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 30017 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 60068ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61678 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-11 finished in 172320 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 38 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-23 03:05:37] [INFO ] Computed 520 invariants in 14 ms
[2024-05-23 03:05:37] [INFO ] Implicit Places using invariants in 793 ms returned [92, 743, 794, 968, 1183]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 814 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 34 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 888 ms. Remains : 1282/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 131 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 180 reset in 3484 ms.
Product exploration explored 100000 steps with 191 reset in 3725 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 659 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 143 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
RANDOM walk for 5624 steps (1 resets) in 213 ms. (26 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 777 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 139 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
// Phase 1: matrix 768 rows 1282 cols
[2024-05-23 03:05:47] [INFO ] Computed 515 invariants in 13 ms
[2024-05-23 03:05:48] [INFO ] [Real]Absence check using 511 positive place invariants in 265 ms returned sat
[2024-05-23 03:05:48] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 105 ms returned sat
[2024-05-23 03:06:03] [INFO ] [Real]Absence check using state equation in 14051 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 70 ms. Remains 1028 /1282 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1028 cols
[2024-05-23 03:06:03] [INFO ] Computed 515 invariants in 15 ms
[2024-05-23 03:06:03] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-23 03:06:03] [INFO ] Invariant cache hit.
[2024-05-23 03:06:04] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2024-05-23 03:06:04] [INFO ] Redundant transitions in 6 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 03:06:04] [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 30015 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 30021 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 60068ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
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 61782 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 518 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 157 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
RANDOM walk for 4915 steps (0 resets) in 190 ms. (25 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 638 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 174 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 151 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
[2024-05-23 03:07:06] [INFO ] Invariant cache hit.
[2024-05-23 03:07:07] [INFO ] [Real]Absence check using 511 positive place invariants in 243 ms returned sat
[2024-05-23 03:07:07] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 81 ms returned sat
[2024-05-23 03:07:13] [INFO ] [Real]Absence check using state equation in 6129 ms returned sat
[2024-05-23 03:07:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:07:14] [INFO ] [Nat]Absence check using 511 positive place invariants in 232 ms returned sat
[2024-05-23 03:07:14] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 34 ms returned sat
[2024-05-23 03:07:25] [INFO ] [Nat]Absence check using state equation in 10976 ms returned sat
[2024-05-23 03:07:25] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-23 03:07:28] [INFO ] Added : 20 causal constraints over 4 iterations in 3342 ms. Result :unknown
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 144 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 375 reset in 3747 ms.
Product exploration explored 100000 steps with 367 reset in 3995 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 27 ms. Remains 1027 /1028 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1027 cols
[2024-05-23 03:07:36] [INFO ] Computed 515 invariants in 7 ms
[2024-05-23 03:07:37] [INFO ] Implicit Places using invariants in 749 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 751 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 806 ms. Remains : 1026/1028 places, 513/514 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 120541 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 47 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-23 03:07:37] [INFO ] Computed 520 invariants in 17 ms
[2024-05-23 03:07:38] [INFO ] Implicit Places using invariants in 818 ms returned [285, 304, 743, 794, 1183]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 820 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 903 ms. Remains : 1282/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 255 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 22158 reset in 3796 ms.
Product exploration explored 100000 steps with 21757 reset in 4035 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 447 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 151 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 3990 steps (0 resets) in 157 ms. (25 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 529 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 168 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 175 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-05-23 03:07:48] [INFO ] Computed 515 invariants in 14 ms
[2024-05-23 03:07:49] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-05-23 03:07:49] [INFO ] Invariant cache hit.
[2024-05-23 03:07:50] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 03:07:50] [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 30016 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
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 30040 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 60118ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 62073 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 347 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 3053 steps (0 resets) in 128 ms. (23 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 415 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 175 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 20636 reset in 3887 ms.
Product exploration explored 100000 steps with 23186 reset in 4136 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 168 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 110 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 03:09:01] [INFO ] Redundant transitions in 8 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-05-23 03:09:01] [INFO ] Computed 515 invariants in 12 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-05-23 03:09:22] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 3 ms to minimize.
[2024-05-23 03:09:22] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 3 ms to minimize.
[2024-05-23 03:09:22] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 03:09:22] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 3 ms to minimize.
[2024-05-23 03:09:22] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2024-05-23 03:09:22] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 2 ms to minimize.
[2024-05-23 03:09:23] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 2 ms to minimize.
[2024-05-23 03:09:23] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 2 ms to minimize.
[2024-05-23 03:09:23] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 03:09:23] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 03:09:23] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 3 ms to minimize.
[2024-05-23 03:09:23] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-23 03:09:23] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2024-05-23 03:09:24] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-05-23 03:09:24] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-05-23 03:09:24] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 2 ms to minimize.
[2024-05-23 03:09:24] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-05-23 03:09:24] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-23 03:09:24] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-05-23 03:09:24] [INFO ] Deduced a trap composed of 2 places in 95 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-05-23 03:09:24] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 4 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-05-23 03:09:25] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-23 03:09:26] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/2050 variables, and 554 constraints, problems are : Problem set: 39 solved, 473 unsolved in 30016 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: 40/40 constraints]
Escalating to Integer solving :Problem set: 39 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/731 variables, 1/1 constraints. Problems are: Problem set: 39 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/731 variables, 0/1 constraints. Problems are: Problem set: 39 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 550/1281 variables, 512/513 constraints. Problems are: Problem set: 39 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 39 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 40/554 constraints. Problems are: Problem set: 39 solved, 473 unsolved
[2024-05-23 03:09:36] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-05-23 03:09:36] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-05-23 03:09:36] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-23 03:09:37] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 2 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1281 variables, 20/574 constraints. Problems are: Problem set: 59 solved, 453 unsolved
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 2 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-23 03:09:38] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD502 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 20/594 constraints. Problems are: Problem set: 79 solved, 433 unsolved
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-23 03:09:39] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 4 ms to minimize.
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-23 03:09:40] [INFO ] Deduced a trap composed of 2 places in 24 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 TDEAD11 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD493 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 20/614 constraints. Problems are: Problem set: 99 solved, 413 unsolved
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-23 03:09:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-23 03:09:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-23 03:09:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-23 03:09:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-23 03:09:42] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-23 03:09:42] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-23 03:09:42] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-23 03:09:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-23 03:09:42] [INFO ] Deduced a trap composed of 2 places in 22 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 8 (INCLUDED_ONLY) 0/1281 variables, 20/634 constraints. Problems are: Problem set: 119 solved, 393 unsolved
[2024-05-23 03:09:43] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-23 03:09:43] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-23 03:09:43] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-23 03:09:43] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-23 03:09:43] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-23 03:09:43] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-23 03:09:43] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-23 03:09:43] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-23 03:09:44] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 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 9 (INCLUDED_ONLY) 0/1281 variables, 20/654 constraints. Problems are: Problem set: 139 solved, 373 unsolved
[2024-05-23 03:09:45] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-23 03:09:46] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-23 03:09:47] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-23 03:09:47] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-23 03:09:47] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-23 03:09:47] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-23 03:09:47] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-05-23 03:09:47] [INFO ] Deduced a trap composed of 2 places in 23 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 10 (INCLUDED_ONLY) 0/1281 variables, 20/674 constraints. Problems are: Problem set: 159 solved, 353 unsolved
[2024-05-23 03:09:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-23 03:09:49] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-23 03:09:49] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-23 03:09:49] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-23 03:09:49] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-23 03:09:49] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD193 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD197 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-05-23 03:09:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD204 is UNSAT
[2024-05-23 03:09:51] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-05-23 03:09:51] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD210 is UNSAT
[2024-05-23 03:09:51] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 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 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 11 (INCLUDED_ONLY) 0/1281 variables, 20/694 constraints. Problems are: Problem set: 179 solved, 333 unsolved
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD237 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD241 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-23 03:09:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD247 is UNSAT
[2024-05-23 03:09:55] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-05-23 03:09:55] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD250 is UNSAT
[2024-05-23 03:09:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-05-23 03:09:55] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-05-23 03:09:55] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-05-23 03:09:55] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 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 12 (INCLUDED_ONLY) 0/1281 variables, 20/714 constraints. Problems are: Problem set: 199 solved, 313 unsolved
[2024-05-23 03:09:58] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
[2024-05-23 03:09:58] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD260 is UNSAT
[2024-05-23 03:09:58] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD272 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD280 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD284 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD300 is UNSAT
[2024-05-23 03:09:59] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD305 is UNSAT
[2024-05-23 03:10:00] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD307 is UNSAT
[2024-05-23 03:10:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD310 is UNSAT
[2024-05-23 03:10:00] [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 13 (INCLUDED_ONLY) 0/1281 variables, 20/734 constraints. Problems are: Problem set: 219 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1281/2050 variables, and 734 constraints, problems are : Problem set: 219 solved, 293 unsolved in 30016 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: 220/220 constraints]
After SMT, in 60122ms problems are : Problem set: 219 solved, 293 unsolved
Search for dead transitions found 219 dead transitions in 60129ms
Found 219 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 219 transitions
Dead transitions reduction (with SMT) removed 219 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1282/1282 places, 549/768 transitions.
Graph (complete) has 2126 edges and 1282 vertex of which 1063 are kept as prefixes of interest. Removing 219 places using SCC suffix rule.7 ms
Discarding 219 places :
Also discarding 0 output transitions
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 1 rules in 44 ms. Remains 1063 /1282 variables (removed 219) and now considering 549/549 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1063/1282 places, 549/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60302 ms. Remains : 1063/1282 places, 549/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 32 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-05-23 03:10:01] [INFO ] Computed 515 invariants in 13 ms
[2024-05-23 03:10:02] [INFO ] Implicit Places using invariants in 806 ms returned []
[2024-05-23 03:10:02] [INFO ] Invariant cache hit.
[2024-05-23 03:10:03] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 03:10:03] [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 30022 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 30017 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 60104ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in LTL mode , in 1 iterations and 62058 ms. Remains : 1282/1282 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-13 finished in 205738 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 69 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-23 03:11:03] [INFO ] Computed 520 invariants in 11 ms
[2024-05-23 03:11:04] [INFO ] Implicit Places using invariants in 726 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 728 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 24 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 822 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 157 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 1 reset in 2864 ms.
Product exploration explored 100000 steps with 4 reset in 3301 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 418 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 167 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 587 steps (0 resets) in 45 ms. (12 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 534 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 171 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 167 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-05-23 03:11:12] [INFO ] Computed 513 invariants in 11 ms
[2024-05-23 03:11:13] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-05-23 03:11:13] [INFO ] Invariant cache hit.
[2024-05-23 03:11:14] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
[2024-05-23 03:11:14] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:11: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 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 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 60063ms 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 61773 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 418 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 171 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 776 steps (0 resets) in 51 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 463 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 157 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 2803 ms.
Product exploration explored 100000 steps with 0 reset in 3050 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 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 03:12:22] [INFO ] Invariant cache hit.
[2024-05-23 03:12:22] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-05-23 03:12:22] [INFO ] Invariant cache hit.
[2024-05-23 03:12:23] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-23 03:12:23] [INFO ] Redundant transitions in 5 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:12:23] [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 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 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 60068ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61697 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-14 finished in 140476 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 36 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-23 03:13:23] [INFO ] Computed 520 invariants in 16 ms
[2024-05-23 03:13:24] [INFO ] Implicit Places using invariants in 777 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 778 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 852 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 149 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 190 reset in 3404 ms.
Product exploration explored 100000 steps with 192 reset in 3615 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 124 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 91 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 1581 ms. (25 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 1/1 properties
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 03:13:33] [INFO ] Computed 513 invariants in 7 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 17 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 360 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 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-23 03:13:33] [INFO ] Invariant cache hit.
[2024-05-23 03:13:34] [INFO ] [Real]Absence check using 511 positive place invariants in 233 ms returned sat
[2024-05-23 03:13:34] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-23 03:13:48] [INFO ] [Real]Absence check using state equation in 14141 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 39 ms. Remains 1024 /1280 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-23 03:13:48] [INFO ] Computed 513 invariants in 14 ms
[2024-05-23 03:13:49] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-05-23 03:13:49] [INFO ] Invariant cache hit.
[2024-05-23 03:13:50] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2024-05-23 03:13:50] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:13: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
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 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 30025 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 60072ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
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 61728 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 158 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 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 544 steps (0 resets) in 51 ms. (10 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 168 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 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-23 03:14:51] [INFO ] Invariant cache hit.
[2024-05-23 03:14:52] [INFO ] [Real]Absence check using 511 positive place invariants in 225 ms returned sat
[2024-05-23 03:14:52] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-23 03:14:58] [INFO ] [Real]Absence check using state equation in 6025 ms returned sat
[2024-05-23 03:14:58] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-23 03:15:06] [INFO ] Added : 30 causal constraints over 6 iterations in 8237 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 347 reset in 3673 ms.
Product exploration explored 100000 steps with 367 reset in 4052 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 29 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 03:15:14] [INFO ] Invariant cache hit.
[2024-05-23 03:15:15] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-23 03:15:15] [INFO ] Invariant cache hit.
[2024-05-23 03:15:16] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
[2024-05-23 03:15:16] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:15:16] [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 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]
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 60072ms 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 61762 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 172313 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 178 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 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 66 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-05-23 03:16:16] [INFO ] Computed 520 invariants in 6 ms
[2024-05-23 03:16:17] [INFO ] Implicit Places using invariants in 706 ms returned [76, 227, 242, 636, 775, 947]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 732 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 25 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 825 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 519 reset in 3823 ms.
Product exploration explored 100000 steps with 551 reset in 4100 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 154 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 156 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 12028 steps (1 resets) in 545 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 224 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 168 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 161 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-05-23 03:16:26] [INFO ] Computed 514 invariants in 6 ms
[2024-05-23 03:16:27] [INFO ] [Real]Absence check using 510 positive place invariants in 224 ms returned sat
[2024-05-23 03:16:27] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 101 ms returned sat
[2024-05-23 03:16:32] [INFO ] [Real]Absence check using state equation in 4508 ms returned sat
[2024-05-23 03:16:32] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-23 03:16:40] [INFO ] Added : 35 causal constraints over 7 iterations in 8404 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 19 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 03:16:40] [INFO ] Invariant cache hit.
[2024-05-23 03:16:41] [INFO ] Implicit Places using invariants in 736 ms returned []
[2024-05-23 03:16:41] [INFO ] Invariant cache hit.
[2024-05-23 03:16:42] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 03:16:42] [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 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 30019 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 60068ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in LTL mode , in 1 iterations and 61706 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 163 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 3591 steps (0 resets) in 189 ms. (18 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 214 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 197 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 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-23 03:17:43] [INFO ] Invariant cache hit.
[2024-05-23 03:17:44] [INFO ] [Real]Absence check using 510 positive place invariants in 252 ms returned sat
[2024-05-23 03:17:44] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 85 ms returned sat
[2024-05-23 03:17:50] [INFO ] [Real]Absence check using state equation in 5592 ms returned sat
[2024-05-23 03:17:50] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-23 03:17:58] [INFO ] Added : 45 causal constraints over 9 iterations in 8592 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 209 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 3885 ms.
Product exploration explored 100000 steps with 523 reset in 4119 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 200 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 29 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 03:18:07] [INFO ] Redundant transitions in 4 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-23 03:18:07] [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 "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 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.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 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 0.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 0.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 1.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 1.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 1.0)
(s647 1.0)
(s648 0.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 0.0)
(s653 1.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 1.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 1.0)
(s732 0.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 1.0)
(s739 0.0)
(s740 1.0)
(s741 1.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 1.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 1.0)
(s768 0.0)
(s769 1.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 1.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 1.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 1.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 1.0)
(s799 1.0)
(s800 0.0)
(s801 1.0)
(s802 1.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 1.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 1.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 1.0)
(s835 0.0)
(s836 0.0)
(s837 1.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 1.0)
(s847 1.0)
(s848 0.0)
(s849 1.0)
(s850 0.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 0.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 1.0)
(s877 1.0)
(s878 0.0)
(s879 1.0)
(s880 0.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 1.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 1.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 1.0)
(s902 1.0)
(s903 0.0)
(s904 1.0)
(s905 0.0)
(s906 1.0)
(s907 1.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 0.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 0.0)
(s930 0.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 0.0)
(s936 1.0)
(s937 0.0)
(s938 0.0)
(s939 1.0)
(s940 0.0)
(s941 1.0)
(s942 0.0)
(s943 1.0)
(s944 0.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 0.0)
(s955 1.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 1.0)
(s964 0.0)
(s965 0.0)
(s966 1.0)
(s967 0.0)
(s968 0.0)
(s969 1.0)
(s970 1.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 1.0)
(s975 1.0)
(s976 0.0)
(s977 1.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 0.0)
(s988 1.0)
(s989 0.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 0.0)
(s994 0.0)
(s995 1.0)
(s996 timeout
0.0)
(s997 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 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]
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 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]
After SMT, in 60063ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60106 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 25 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 03:19:07] [INFO ] Invariant cache hit.
[2024-05-23 03:19:08] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-23 03:19:08] [INFO ] Invariant cache hit.
[2024-05-23 03:19:09] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 03:19:09] [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 30014 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 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 60061ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in LTL mode , in 1 iterations and 61716 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 232949 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 75 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 63 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-23 03:20:09] [INFO ] Computed 520 invariants in 13 ms
[2024-05-23 03:20:10] [INFO ] Implicit Places using invariants in 726 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 728 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 24 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 815 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 26174 reset in 3347 ms.
Product exploration explored 100000 steps with 24865 reset in 3616 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 176 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 891 steps (0 resets) in 58 ms. (15 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 190 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 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 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-23 03:20:18] [INFO ] Computed 513 invariants in 12 ms
[2024-05-23 03:20:19] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-23 03:20:19] [INFO ] Invariant cache hit.
[2024-05-23 03:20:19] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 03:20:19] [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
(s211 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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.0timeout
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 30024 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 60083ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Finished structural reductions in LTL mode , in 1 iterations and 61751 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 153 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 644 steps (0 resets) in 57 ms. (11 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 147 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)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25385 reset in 3329 ms.
Product exploration explored 100000 steps with 25284 reset in 3549 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 66 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 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 03:21:28] [INFO ] Redundant transitions in 10 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:21:28] [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 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]
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
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 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]
After SMT, in 60070ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60116 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 19 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 03:22:28] [INFO ] Invariant cache hit.
[2024-05-23 03:22:28] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-05-23 03:22:28] [INFO ] Invariant cache hit.
[2024-05-23 03:22:29] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 03:22:29] [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 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]
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 60064ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in LTL mode , in 1 iterations and 61725 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-07 finished in 200709 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 232 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 0 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 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 68 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-05-23 03:23:30] [INFO ] Computed 520 invariants in 12 ms
[2024-05-23 03:23:31] [INFO ] Implicit Places using invariants in 698 ms returned [76, 227, 242, 593, 635, 774]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 709 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 23 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 800 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 0 reset in 2746 ms.
Product exploration explored 100000 steps with 0 reset in 3072 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 374 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 220 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 1275 steps (0 resets) in 53 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 503 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 197 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-05-23 03:23:38] [INFO ] Computed 514 invariants in 6 ms
[2024-05-23 03:23:39] [INFO ] [Real]Absence check using 511 positive place invariants in 220 ms returned sat
[2024-05-23 03:23:39] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 30 ms returned sat
[2024-05-23 03:23:46] [INFO ] [Real]Absence check using state equation in 7158 ms returned sat
[2024-05-23 03:23:46] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-23 03:23:52] [INFO ] Added : 15 causal constraints over 3 iterations in 5193 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-23 03:23:52] [INFO ] Invariant cache hit.
[2024-05-23 03:23:52] [INFO ] [Real]Absence check using 511 positive place invariants in 239 ms returned sat
[2024-05-23 03:23:52] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 95 ms returned sat
[2024-05-23 03:23:57] [INFO ] [Real]Absence check using state equation in 4982 ms returned sat
[2024-05-23 03:23:57] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-23 03:24:05] [INFO ] Added : 35 causal constraints over 7 iterations in 8153 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-05-23 03:24:06] [INFO ] Invariant cache hit.
[2024-05-23 03:24:06] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-23 03:24:06] [INFO ] Invariant cache hit.
[2024-05-23 03:24:07] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 03:24: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: ((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 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 30020 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 60061ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in LTL mode , in 1 iterations and 61753 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 350 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)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 2224 steps (0 resets) in 110 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 463 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 240 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 236 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-05-23 03:25:09] [INFO ] Invariant cache hit.
[2024-05-23 03:25:10] [INFO ] [Real]Absence check using 511 positive place invariants in 225 ms returned sat
[2024-05-23 03:25:10] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 91 ms returned sat
[2024-05-23 03:25:16] [INFO ] [Real]Absence check using state equation in 6016 ms returned sat
[2024-05-23 03:25:16] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-23 03:25:24] [INFO ] Added : 25 causal constraints over 5 iterations in 7401 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-23 03:25:24] [INFO ] Invariant cache hit.
[2024-05-23 03:25:24] [INFO ] [Real]Absence check using 511 positive place invariants in 243 ms returned sat
[2024-05-23 03:25:24] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 96 ms returned sat
[2024-05-23 03:25:29] [INFO ] [Real]Absence check using state equation in 5049 ms returned sat
[2024-05-23 03:25:29] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-23 03:25:38] [INFO ] Added : 35 causal constraints over 7 iterations in 8277 ms. Result :unknown
Could not prove EG (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)]
Product exploration explored 100000 steps with 1 reset in 2865 ms.
Product exploration explored 100000 steps with 1 reset in 3174 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 250 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 24 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 03:25:44] [INFO ] Redundant transitions in 5 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-23 03:25:44] [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
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): 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 30018 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 60068ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60109 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 19 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 03:26:44] [INFO ] Invariant cache hit.
[2024-05-23 03:26:45] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-23 03:26:45] [INFO ] Invariant cache hit.
[2024-05-23 03:26:46] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 03:26:46] [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
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 30014 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 30016 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 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 61739 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 256727 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 108 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 57 ms. Remains 1033 /1287 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1033 cols
[2024-05-23 03:27:47] [INFO ] Computed 520 invariants in 13 ms
[2024-05-23 03:27:47] [INFO ] Implicit Places using invariants in 737 ms returned [76, 594, 636, 775, 947]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 748 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 24 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 829 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 368 reset in 3899 ms.
Product exploration explored 100000 steps with 384 reset in 4164 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 627 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 140 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
RANDOM walk for 9609 steps (2 resets) in 387 ms. (24 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 714 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 (NOT p2) p1), (AND (NOT p2) p1), false, false]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
// Phase 1: matrix 514 rows 1028 cols
[2024-05-23 03:27:58] [INFO ] Computed 515 invariants in 6 ms
[2024-05-23 03:27:59] [INFO ] [Real]Absence check using 511 positive place invariants in 259 ms returned sat
[2024-05-23 03:27:59] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 99 ms returned sat
[2024-05-23 03:28:03] [INFO ] [Real]Absence check using state equation in 3881 ms returned sat
[2024-05-23 03:28:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:28:03] [INFO ] [Nat]Absence check using 511 positive place invariants in 244 ms returned sat
[2024-05-23 03:28:03] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-23 03:28:09] [INFO ] [Nat]Absence check using state equation in 5924 ms returned sat
[2024-05-23 03:28:09] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-23 03:28:15] [INFO ] Added : 15 causal constraints over 3 iterations in 5250 ms. Result :sat
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-05-23 03:28:15] [INFO ] Invariant cache hit.
[2024-05-23 03:28:15] [INFO ] Implicit Places using invariants in 705 ms returned []
[2024-05-23 03:28:15] [INFO ] Invariant cache hit.
[2024-05-23 03:28:16] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2024-05-23 03:28:16] [INFO ] Redundant transitions in 3 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 03:28:16] [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 30010 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
Finished structural reductions in SI_LTL mode , in 1 iterations and 61792 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 430 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 199 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
RANDOM walk for 3556 steps (0 resets) in 193 ms. (18 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 631 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 130 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 119 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
[2024-05-23 03:29:18] [INFO ] Invariant cache hit.
[2024-05-23 03:29:19] [INFO ] [Real]Absence check using 511 positive place invariants in 231 ms returned sat
[2024-05-23 03:29:19] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 68 ms returned sat
[2024-05-23 03:29:23] [INFO ] [Real]Absence check using state equation in 3907 ms returned sat
[2024-05-23 03:29:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:29:24] [INFO ] [Nat]Absence check using 511 positive place invariants in 229 ms returned sat
[2024-05-23 03:29:24] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 74 ms returned sat
[2024-05-23 03:29:28] [INFO ] [Nat]Absence check using state equation in 3778 ms returned sat
[2024-05-23 03:29:28] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-23 03:29:34] [INFO ] Added : 25 causal constraints over 5 iterations in 6782 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 125 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 348 reset in 3773 ms.
Product exploration explored 100000 steps with 364 reset in 4055 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 26 ms. Remains 1027 /1028 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1027 cols
[2024-05-23 03:29:42] [INFO ] Computed 515 invariants in 13 ms
[2024-05-23 03:29:43] [INFO ] Implicit Places using invariants in 693 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 710 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 23 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 761 ms. Remains : 1026/1028 places, 513/514 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 116741 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 129 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 79 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-23 03:29:44] [INFO ] Computed 520 invariants in 11 ms
[2024-05-23 03:29:44] [INFO ] Implicit Places using invariants in 684 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 LI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 24 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 806 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 372 reset in 3776 ms.
Product exploration explored 100000 steps with 370 reset in 4060 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 344 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 116 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 2406 ms. (16 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 1/1 properties
// Phase 1: matrix 512 rows 1024 cols
[2024-05-23 03:29:54] [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 649 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 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-23 03:29:55] [INFO ] Invariant cache hit.
[2024-05-23 03:29:55] [INFO ] [Real]Absence check using 511 positive place invariants in 232 ms returned sat
[2024-05-23 03:29:55] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 60 ms returned sat
[2024-05-23 03:30:01] [INFO ] [Real]Absence check using state equation in 5102 ms returned sat
[2024-05-23 03:30:01] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-23 03:30:06] [INFO ] Added : 20 causal constraints over 4 iterations in 5458 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 23 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 03:30:06] [INFO ] Invariant cache hit.
[2024-05-23 03:30:07] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-23 03:30:07] [INFO ] Invariant cache hit.
[2024-05-23 03:30:08] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2024-05-23 03:30:08] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:30:08] [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 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 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 60074ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61790 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 161 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 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 722 steps (0 resets) in 57 ms. (12 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 175 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 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-23 03:31:09] [INFO ] Invariant cache hit.
[2024-05-23 03:31:10] [INFO ] [Real]Absence check using 511 positive place invariants in 241 ms returned sat
[2024-05-23 03:31:10] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-23 03:31:15] [INFO ] [Real]Absence check using state equation in 5343 ms returned sat
[2024-05-23 03:31:15] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-23 03:31:20] [INFO ] Added : 20 causal constraints over 4 iterations in 5336 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 363 reset in 3725 ms.
Product exploration explored 100000 steps with 382 reset in 4007 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-05-23 03:31:28] [INFO ] Invariant cache hit.
[2024-05-23 03:31:29] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-23 03:31:29] [INFO ] Invariant cache hit.
[2024-05-23 03:31:30] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2024-05-23 03:31:30] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 03:31:30] [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)timeout

(s629 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 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 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 61695 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 166680 ms.
[2024-05-23 03:32:30] [INFO ] Flatten gal took : 38 ms
[2024-05-23 03:32:30] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-23 03:32:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1287 places, 768 transitions and 2574 arcs took 6 ms.
Total runtime 2636421 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CircularTrains-PT-768

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1287
TRANSITIONS: 768
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.016s, Sys 0.006s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 6446
MODEL NAME: /home/mcc/execution/414/model
1287 places, 768 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r069-tall-171620504400372"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;