About the Execution of LoLa+red for CircularTrains-PT-768
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1064.995 | 842381.00 | 889872.00 | 3710.80 | FTFFTFFFFFFF??TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397700196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r071-smll-167814397700196
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 7.7K Feb 26 04:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 04:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 04:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 04:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 591K Mar 5 18:22 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 1678256018018
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 06:13:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 06:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:13:42] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-03-08 06:13:42] [INFO ] Transformed 1536 places.
[2023-03-08 06:13:42] [INFO ] Transformed 768 transitions.
[2023-03-08 06:13:42] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-768-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 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 351 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2023-03-08 06:13:43] [INFO ] Computed 769 place invariants in 179 ms
[2023-03-08 06:13:46] [INFO ] Implicit Places using invariants in 3246 ms returned [14, 29, 102, 150, 244, 296, 600, 669, 679, 681, 697, 699, 709, 732, 767, 883, 884, 929, 940, 942, 948, 973, 975, 977, 991, 1005, 1071, 1073, 1079, 1088, 1168, 1185, 1198, 1204, 1211, 1229, 1247, 1273, 1299, 1337, 1338, 1339, 1350, 1385, 1391, 1450, 1485, 1487, 1495, 1497, 1513, 1517, 1527, 1531]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 3320 ms to find 54 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1482/1536 places, 768/768 transitions.
Applied a total of 0 rules in 276 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3954 ms. Remains : 1482/1536 places, 768/768 transitions.
Support contains 62 out of 1482 places after structural reductions.
[2023-03-08 06:13:47] [INFO ] Flatten gal took : 336 ms
[2023-03-08 06:13:47] [INFO ] Flatten gal took : 105 ms
[2023-03-08 06:13:47] [INFO ] Input system was already deterministic with 768 transitions.
Finished random walk after 9202 steps, including 2 resets, run visited all 30 properties in 955 ms. (steps per millisecond=9 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X(X(!p0)))))))'
Support contains 4 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 121 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1482 cols
[2023-03-08 06:13:49] [INFO ] Computed 715 place invariants in 60 ms
[2023-03-08 06:13:51] [INFO ] Implicit Places using invariants in 2379 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 108, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 333, 344, 347, 349, 355, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1091, 1098, 1101, 1117, 1120, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1364, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2397 ms to find 202 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1482 places, 768/768 transitions.
Applied a total of 0 rules in 179 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 2698 ms. Remains : 1280/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 382 ms :[false, false, false]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={1} source=1 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(OR (LT s900 1) (LT s1142 1)), p1:(AND (GEQ s498 1) (GEQ s733 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7492 reset in 4631 ms.
Product exploration explored 100000 steps with 6467 reset in 4336 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))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 555 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[false, false, false]
Finished random walk after 287 steps, including 0 resets, run visited all 3 properties in 37 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 594 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[false, false, false]
Stuttering acceptance computed with spot in 165 ms :[false, false, false]
Support contains 4 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 87 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2023-03-08 06:14:03] [INFO ] Computed 513 place invariants in 27 ms
[2023-03-08 06:14:05] [INFO ] Implicit Places using invariants in 1513 ms returned []
[2023-03-08 06:14:05] [INFO ] Invariant cache hit.
[2023-03-08 06:14:07] [INFO ] Implicit Places using invariants and state equation in 2351 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
[2023-03-08 06:14:07] [INFO ] Invariant cache hit.
[2023-03-08 06:14:08] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5081 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 : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 474 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[false, false, false]
Finished random walk after 399 steps, including 0 resets, run visited all 3 properties in 50 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 629 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[false, false, false]
Stuttering acceptance computed with spot in 155 ms :[false, false, false]
Stuttering acceptance computed with spot in 154 ms :[false, false, false]
Product exploration explored 100000 steps with 7835 reset in 4473 ms.
Product exploration explored 100000 steps with 8103 reset in 4316 ms.
Support contains 4 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 51 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:14:20] [INFO ] Invariant cache hit.
[2023-03-08 06:14:21] [INFO ] Implicit Places using invariants in 1525 ms returned []
[2023-03-08 06:14:21] [INFO ] Invariant cache hit.
[2023-03-08 06:14:24] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned []
Implicit Place search using SMT with State Equation took 3667 ms to find 0 implicit places.
[2023-03-08 06:14:24] [INFO ] Invariant cache hit.
[2023-03-08 06:14:25] [INFO ] Dead Transitions using invariants and state equation in 1590 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5316 ms. Remains : 1280/1280 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-00 finished in 36830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1||X(G(p2)))&&p0)))'
Support contains 6 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 69 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1482 cols
[2023-03-08 06:14:25] [INFO ] Computed 715 place invariants in 32 ms
[2023-03-08 06:14:28] [INFO ] Implicit Places using invariants in 2153 ms returned [3, 17, 33, 43, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 108, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 333, 344, 347, 349, 355, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1091, 1098, 1101, 1117, 1120, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1364, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 2161 ms to find 201 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1482 places, 768/768 transitions.
Applied a total of 0 rules in 57 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 2287 ms. Remains : 1281/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s488 1) (GEQ s732 1)), p1:(AND (GEQ s41 1) (GEQ s484 1)), p2:(OR (AND (GEQ s631 1) (GEQ s1039 1)) (AND (GEQ s41 1) (GEQ s484 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 113 steps with 0 reset in 10 ms.
FORMULA CircularTrains-PT-768-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-02 finished in 2531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 6 out of 1482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1482 transition count 755
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1469 transition count 755
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 26 place count 1469 transition count 714
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 108 place count 1428 transition count 714
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 188 place count 1388 transition count 674
Applied a total of 188 rules in 379 ms. Remains 1388 /1482 variables (removed 94) and now considering 674/768 (removed 94) transitions.
// Phase 1: matrix 674 rows 1388 cols
[2023-03-08 06:14:28] [INFO ] Computed 715 place invariants in 29 ms
[2023-03-08 06:14:31] [INFO ] Implicit Places using invariants in 2397 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 102, 106, 107, 121, 124, 134, 140, 145, 147, 150, 152, 157, 166, 173, 180, 186, 189, 190, 191, 213, 217, 230, 233, 234, 236, 239, 243, 256, 259, 283, 290, 295, 302, 307, 310, 315, 325, 327, 329, 335, 342, 353, 354, 361, 374, 381, 386, 391, 392, 393, 410, 423, 425, 434, 435, 442, 444, 450, 467, 477, 484, 487, 498, 499, 501, 503, 511, 516, 521, 522, 525, 541, 542, 544, 567, 573, 583, 591, 594, 617, 619, 622, 623, 625, 626, 635, 644, 645, 649, 650, 652, 659, 664, 668, 669, 678, 701, 712, 719, 725, 729, 742, 753, 755, 757, 758, 764, 767, 784, 788, 791, 801, 817, 819, 828, 830, 847, 875, 880, 888, 889, 906, 928, 938, 941, 944, 945, 946, 947, 968, 972, 983, 995, 1000, 1008, 1014, 1015, 1019, 1037, 1043, 1046, 1059, 1062, 1065, 1069, 1072, 1074, 1075, 1088, 1090, 1112, 1117, 1126, 1138, 1145, 1154, 1155, 1158, 1180, 1186, 1187, 1191, 1192, 1213, 1219, 1232, 1234, 1238, 1240, 1250, 1255, 1256, 1283, 1301, 1308, 1315, 1321, 1329, 1339, 1342, 1349, 1351, 1356, 1367, 1371, 1373, 1379]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 2406 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1187/1482 places, 674/768 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1187 transition count 517
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 314 place count 1030 transition count 517
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 314 place count 1030 transition count 514
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 320 place count 1027 transition count 514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 1026 transition count 513
Applied a total of 322 rules in 104 ms. Remains 1026 /1187 variables (removed 161) and now considering 513/674 (removed 161) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2023-03-08 06:14:31] [INFO ] Computed 514 place invariants in 9 ms
[2023-03-08 06:14:32] [INFO ] Implicit Places using invariants in 1345 ms returned []
[2023-03-08 06:14:32] [INFO ] Invariant cache hit.
[2023-03-08 06:14:34] [INFO ] Implicit Places using invariants and state equation in 1765 ms returned []
Implicit Place search using SMT with State Equation took 3114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1026/1482 places, 513/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6004 ms. Remains : 1026/1482 places, 513/768 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s63 1) (GEQ s383 1) (GEQ s457 1) (GEQ s770 1)), p1:(OR (LT s225 1) (LT s562 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 118 reset in 4110 ms.
Product exploration explored 100000 steps with 153 reset in 4283 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 327 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 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 1007 steps, including 0 resets, run visited all 3 properties in 40 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 484 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 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (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 71 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 06:14:44] [INFO ] Invariant cache hit.
[2023-03-08 06:14:46] [INFO ] Implicit Places using invariants in 1750 ms returned []
[2023-03-08 06:14:46] [INFO ] Invariant cache hit.
[2023-03-08 06:14:48] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned []
Implicit Place search using SMT with State Equation took 3712 ms to find 0 implicit places.
[2023-03-08 06:14:48] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-08 06:14:48] [INFO ] Invariant cache hit.
[2023-03-08 06:14:49] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5026 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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 290 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 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 235 steps, including 0 resets, run visited all 3 properties in 22 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 504 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 97 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 139 reset in 4404 ms.
Product exploration explored 100000 steps with 133 reset in 4043 ms.
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 57 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 06:15:00] [INFO ] Invariant cache hit.
[2023-03-08 06:15:01] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2023-03-08 06:15:01] [INFO ] Invariant cache hit.
[2023-03-08 06:15:04] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 3863 ms to find 0 implicit places.
[2023-03-08 06:15:04] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-08 06:15:04] [INFO ] Invariant cache hit.
[2023-03-08 06:15:05] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5038 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 37073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(p1)))))'
Support contains 4 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 82 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1482 cols
[2023-03-08 06:15:05] [INFO ] Computed 715 place invariants in 32 ms
[2023-03-08 06:15:08] [INFO ] Implicit Places using invariants in 2783 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 108, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 333, 344, 347, 349, 355, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1091, 1098, 1101, 1117, 1120, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1364, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2794 ms to find 202 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1482 places, 768/768 transitions.
Applied a total of 0 rules in 82 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 2960 ms. Remains : 1280/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s50 1) (LT s1083 1)), p1:(OR (LT s285 1) (LT s1069 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4981 ms.
Product exploration explored 100000 steps with 33333 reset in 4918 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), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-768-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-768-LTLFireability-04 finished in 13833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((G(!p1) U p2)))))'
Support contains 8 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 98 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:15:19] [INFO ] Invariant cache hit.
[2023-03-08 06:15:22] [INFO ] Implicit Places using invariants in 2948 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 108, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 333, 344, 347, 349, 355, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1091, 1098, 1101, 1117, 1120, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1364, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2955 ms to find 202 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1482 places, 768/768 transitions.
Applied a total of 0 rules in 82 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 3135 ms. Remains : 1280/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s213 1) (GEQ s881 1)), p2:(AND (GEQ s89 1) (GEQ s439 1)), p1:(AND (GEQ s930 1) (GEQ s1210 1) (GEQ s254 1) (GEQ s1262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4182 steps with 243 reset in 255 ms.
FORMULA CircularTrains-PT-768-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-05 finished in 3719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1&&X((p1 U (X(p2)||G(p1))))))&&p0)))'
Support contains 4 out of 1482 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 101 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:15:23] [INFO ] Invariant cache hit.
[2023-03-08 06:15:25] [INFO ] Implicit Places using invariants in 2743 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 108, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 333, 344, 347, 349, 355, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1091, 1098, 1101, 1117, 1120, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1364, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2747 ms to find 202 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1482 places, 768/768 transitions.
Applied a total of 0 rules in 79 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 2928 ms. Remains : 1280/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s774 1) (GEQ s1274 1)), p1:(OR (LT s627 1) (LT s864 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-768-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-06 finished in 3127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(p1)))&&G(F(p2)))))'
Support contains 6 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 101 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:15:26] [INFO ] Invariant cache hit.
[2023-03-08 06:15:29] [INFO ] Implicit Places using invariants in 2907 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 108, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 333, 344, 347, 349, 355, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1091, 1098, 1101, 1117, 1120, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 2911 ms to find 201 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1482 places, 768/768 transitions.
Applied a total of 0 rules in 77 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 3091 ms. Remains : 1281/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 297 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s396 1) (LT s426 1)), p1:(AND (GEQ s1022 1) (GEQ s1177 1)), p2:(OR (AND (GEQ s396 1) (GEQ s426 1)) (AND (GEQ s928 1) (GEQ s1180 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 3490 ms.
Product exploration explored 100000 steps with 3 reset in 3803 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 (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 532 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 660 steps, including 0 resets, run visited all 4 properties in 58 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 683 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 266 ms :[(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
[2023-03-08 06:15:39] [INFO ] Computed 514 place invariants in 22 ms
[2023-03-08 06:15:41] [INFO ] [Real]Absence check using 511 positive place invariants in 727 ms returned sat
[2023-03-08 06:15:42] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 227 ms returned sat
[2023-03-08 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:15:54] [INFO ] [Real]Absence check using state equation in 12008 ms returned sat
[2023-03-08 06:15:54] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 95 ms.
[2023-03-08 06:15:54] [INFO ] Added : 0 causal constraints over 0 iterations in 194 ms. Result :unknown
Could not prove EG (NOT p1)
[2023-03-08 06:15:54] [INFO ] Invariant cache hit.
[2023-03-08 06:15:56] [INFO ] [Real]Absence check using 511 positive place invariants in 452 ms returned sat
[2023-03-08 06:15:56] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 210 ms returned sat
[2023-03-08 06:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:15:59] [INFO ] [Real]Absence check using state equation in 2591 ms returned sat
[2023-03-08 06:15:59] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-08 06:16:09] [INFO ] Added : 90 causal constraints over 18 iterations in 10358 ms. Result :unknown
Could not prove EG (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 72 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:16:09] [INFO ] Invariant cache hit.
[2023-03-08 06:16:11] [INFO ] Implicit Places using invariants in 1664 ms returned []
[2023-03-08 06:16:11] [INFO ] Invariant cache hit.
[2023-03-08 06:16:13] [INFO ] Implicit Places using invariants and state equation in 2247 ms returned []
Implicit Place search using SMT with State Equation took 3914 ms to find 0 implicit places.
[2023-03-08 06:16:13] [INFO ] Invariant cache hit.
[2023-03-08 06:16:14] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5198 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), (X (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 541 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 551 steps, including 0 resets, run visited all 4 properties in 71 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 675 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-08 06:16:17] [INFO ] Invariant cache hit.
[2023-03-08 06:16:19] [INFO ] [Real]Absence check using 511 positive place invariants in 690 ms returned sat
[2023-03-08 06:16:20] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 202 ms returned sat
[2023-03-08 06:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:16:25] [INFO ] [Real]Absence check using state equation in 5076 ms returned sat
[2023-03-08 06:16:25] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 73 ms.
[2023-03-08 06:16:34] [INFO ] Deduced a trap composed of 3 places in 1450 ms of which 7 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 06:16:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2023-03-08 06:16:34] [INFO ] Invariant cache hit.
[2023-03-08 06:16:36] [INFO ] [Real]Absence check using 511 positive place invariants in 487 ms returned sat
[2023-03-08 06:16:36] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 358 ms returned sat
[2023-03-08 06:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:16:39] [INFO ] [Real]Absence check using state equation in 2984 ms returned sat
[2023-03-08 06:16:40] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 84 ms.
[2023-03-08 06:16:49] [INFO ] Added : 80 causal constraints over 16 iterations in 9482 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 202 ms :[(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 3514 ms.
Product exploration explored 100000 steps with 1 reset in 3567 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 273 ms :[(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 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 1281 transition count 768
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 255 rules in 415 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:16:57] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2023-03-08 06:16:57] [INFO ] Computed 514 place invariants in 22 ms
[2023-03-08 06:16:59] [INFO ] Dead Transitions using invariants and state equation in 1679 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 768/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2139 ms. Remains : 1281/1281 places, 768/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 83 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2023-03-08 06:16:59] [INFO ] Computed 514 place invariants in 22 ms
[2023-03-08 06:17:01] [INFO ] Implicit Places using invariants in 2109 ms returned []
[2023-03-08 06:17:01] [INFO ] Invariant cache hit.
[2023-03-08 06:17:03] [INFO ] Implicit Places using invariants and state equation in 2527 ms returned []
Implicit Place search using SMT with State Equation took 4643 ms to find 0 implicit places.
[2023-03-08 06:17:04] [INFO ] Invariant cache hit.
[2023-03-08 06:17:05] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6057 ms. Remains : 1281/1281 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 99290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 1482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1482 transition count 756
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 1470 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 1469 transition count 755
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 26 place count 1469 transition count 714
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 108 place count 1428 transition count 714
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 190 place count 1387 transition count 673
Applied a total of 190 rules in 218 ms. Remains 1387 /1482 variables (removed 95) and now considering 673/768 (removed 95) transitions.
// Phase 1: matrix 673 rows 1387 cols
[2023-03-08 06:17:05] [INFO ] Computed 715 place invariants in 28 ms
[2023-03-08 06:17:08] [INFO ] Implicit Places using invariants in 2640 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 102, 106, 107, 121, 124, 134, 140, 145, 147, 150, 152, 157, 166, 173, 180, 186, 189, 190, 191, 213, 217, 230, 233, 234, 236, 239, 243, 256, 259, 283, 290, 295, 302, 307, 310, 315, 325, 327, 329, 335, 342, 353, 354, 361, 374, 381, 386, 391, 392, 393, 410, 423, 425, 434, 435, 442, 444, 450, 467, 477, 484, 487, 498, 499, 501, 503, 511, 516, 521, 522, 525, 541, 542, 544, 567, 573, 583, 591, 594, 617, 619, 622, 623, 625, 626, 630, 635, 644, 645, 649, 650, 652, 659, 664, 668, 669, 678, 701, 712, 719, 725, 729, 742, 753, 755, 757, 758, 764, 767, 784, 788, 791, 801, 817, 819, 828, 830, 847, 875, 880, 888, 889, 906, 928, 938, 941, 944, 945, 946, 947, 968, 972, 982, 994, 999, 1007, 1013, 1014, 1018, 1036, 1042, 1045, 1058, 1061, 1064, 1068, 1071, 1073, 1074, 1087, 1089, 1111, 1116, 1125, 1137, 1144, 1153, 1154, 1157, 1179, 1185, 1186, 1190, 1191, 1212, 1218, 1231, 1233, 1237, 1239, 1249, 1254, 1255, 1282, 1300, 1307, 1314, 1320, 1328, 1338, 1341, 1348, 1350, 1355, 1366, 1370, 1372, 1378]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2643 ms to find 202 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1185/1482 places, 673/768 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1185 transition count 513
Reduce places removed 160 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 321 place count 1025 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 1024 transition count 512
Applied a total of 322 rules in 80 ms. Remains 1024 /1185 variables (removed 161) and now considering 512/673 (removed 161) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2023-03-08 06:17:08] [INFO ] Computed 513 place invariants in 10 ms
[2023-03-08 06:17:10] [INFO ] Implicit Places using invariants in 1980 ms returned []
[2023-03-08 06:17:10] [INFO ] Invariant cache hit.
[2023-03-08 06:17:12] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 4134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1024/1482 places, 512/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7079 ms. Remains : 1024/1482 places, 512/768 transitions.
Stuttering acceptance computed with spot in 104 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s299 1) (GEQ s498 1))) (NOT (AND (GEQ s195 1) (GEQ s991 1)))), p1:(AND (GEQ s195 1) (GEQ s991 1)), p0:(OR (LT s299 1) (LT s498 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 335 reset in 4380 ms.
Product exploration explored 100000 steps with 346 reset in 4525 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 (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (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 (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 599 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 114 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 06:17:23] [INFO ] Invariant cache hit.
[2023-03-08 06:17:23] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (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 (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 848 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 115 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Stuttering acceptance computed with spot in 115 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
[2023-03-08 06:17:24] [INFO ] Invariant cache hit.
[2023-03-08 06:17:26] [INFO ] [Real]Absence check using 511 positive place invariants in 586 ms returned sat
[2023-03-08 06:17:26] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 154 ms returned sat
[2023-03-08 06:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:17:34] [INFO ] [Real]Absence check using state equation in 8157 ms returned sat
[2023-03-08 06:17:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:17:36] [INFO ] [Nat]Absence check using 511 positive place invariants in 588 ms returned sat
[2023-03-08 06:17:36] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 207 ms returned sat
[2023-03-08 06:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:17:39] [INFO ] [Nat]Absence check using state equation in 3361 ms returned sat
[2023-03-08 06:17:40] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 55 ms.
[2023-03-08 06:17:45] [INFO ] Added : 254 causal constraints over 51 iterations in 5625 ms. Result :sat
Could not prove EG (AND p1 (NOT p2) (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 62 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-08 06:17:45] [INFO ] Invariant cache hit.
[2023-03-08 06:17:47] [INFO ] Implicit Places using invariants in 1875 ms returned []
[2023-03-08 06:17:47] [INFO ] Invariant cache hit.
[2023-03-08 06:17:49] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned []
Implicit Place search using SMT with State Equation took 3879 ms to find 0 implicit places.
[2023-03-08 06:17:49] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 06:17:49] [INFO ] Invariant cache hit.
[2023-03-08 06:17:50] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4793 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 p1 (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge based reduction with 1 factoid took 343 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 82 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Finished random walk after 968 steps, including 0 resets, run visited all 4 properties in 78 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND p0 (NOT p1) (NOT p2))))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 1 factoid took 505 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 110 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Stuttering acceptance computed with spot in 134 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
[2023-03-08 06:17:52] [INFO ] Invariant cache hit.
[2023-03-08 06:17:54] [INFO ] [Real]Absence check using 511 positive place invariants in 477 ms returned sat
[2023-03-08 06:17:54] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 94 ms returned sat
[2023-03-08 06:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:18:01] [INFO ] [Real]Absence check using state equation in 7298 ms returned sat
[2023-03-08 06:18:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:18:03] [INFO ] [Nat]Absence check using 511 positive place invariants in 576 ms returned sat
[2023-03-08 06:18:03] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 215 ms returned sat
[2023-03-08 06:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:18:06] [INFO ] [Nat]Absence check using state equation in 3580 ms returned sat
[2023-03-08 06:18:07] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-08 06:18:12] [INFO ] Added : 254 causal constraints over 51 iterations in 5775 ms. Result :sat
Could not prove EG (AND p1 (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 126 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Product exploration explored 100000 steps with 321 reset in 4821 ms.
Product exploration explored 100000 steps with 333 reset in 4474 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 35 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-08 06:18:22] [INFO ] Invariant cache hit.
[2023-03-08 06:18:23] [INFO ] Implicit Places using invariants in 1399 ms returned []
[2023-03-08 06:18:23] [INFO ] Invariant cache hit.
[2023-03-08 06:18:25] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 3022 ms to find 0 implicit places.
[2023-03-08 06:18:25] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 06:18:25] [INFO ] Invariant cache hit.
[2023-03-08 06:18:26] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4281 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-10 finished in 81126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 99 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1482 cols
[2023-03-08 06:18:26] [INFO ] Computed 715 place invariants in 33 ms
[2023-03-08 06:18:29] [INFO ] Implicit Places using invariants in 2902 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 108, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 333, 344, 347, 349, 355, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1098, 1101, 1117, 1120, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1364, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 2905 ms to find 201 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1482 places, 768/768 transitions.
Applied a total of 0 rules in 77 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 3082 ms. Remains : 1281/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s43 1) (GEQ s938 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-768-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-11 finished in 3286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(F((p2||G(!p1)))))))'
Support contains 6 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 100 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:18:29] [INFO ] Invariant cache hit.
[2023-03-08 06:18:32] [INFO ] Implicit Places using invariants in 2240 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 108, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 344, 347, 349, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1091, 1098, 1101, 1117, 1120, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1364, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 2252 ms to find 200 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1482 places, 768/768 transitions.
Applied a total of 0 rules in 48 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 2402 ms. Remains : 1282/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 219 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 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s284 1) (LT s1191 1)), p1:(OR (LT s303 1) (LT s621 1)), p2:(AND (GEQ s271 1) (GEQ s1017 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 196 reset in 4451 ms.
Product exploration explored 100000 steps with 185 reset in 4287 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))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 622 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 97 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 734 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 06:18:43] [INFO ] Computed 515 place invariants in 22 ms
[2023-03-08 06:18:45] [INFO ] [Real]Absence check using 511 positive place invariants in 622 ms returned sat
[2023-03-08 06:18:45] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 52 ms returned sat
[2023-03-08 06:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:18:53] [INFO ] [Real]Absence check using state equation in 8068 ms returned sat
[2023-03-08 06:18:53] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-08 06:18:59] [INFO ] Deduced a trap composed of 3 places in 1415 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 06:18:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p2))
Could not prove EG (AND p1 (NOT p2))
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 72 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:19:00] [INFO ] Invariant cache hit.
[2023-03-08 06:19:02] [INFO ] Implicit Places using invariants in 2196 ms returned []
[2023-03-08 06:19:02] [INFO ] Invariant cache hit.
[2023-03-08 06:19:04] [INFO ] Implicit Places using invariants and state equation in 2557 ms returned []
Implicit Place search using SMT with State Equation took 4760 ms to find 0 implicit places.
[2023-03-08 06:19:04] [INFO ] Invariant cache hit.
[2023-03-08 06:19:06] [INFO ] Dead Transitions using invariants and state equation in 1373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6210 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 p1 (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 1 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 365 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 101 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-08 06:19:08] [INFO ] Invariant cache hit.
[2023-03-08 06:19:10] [INFO ] [Real]Absence check using 511 positive place invariants in 624 ms returned sat
[2023-03-08 06:19:10] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 178 ms returned sat
[2023-03-08 06:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:19:17] [INFO ] [Real]Absence check using state equation in 7697 ms returned sat
[2023-03-08 06:19:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:19:19] [INFO ] [Nat]Absence check using 511 positive place invariants in 500 ms returned sat
[2023-03-08 06:19:20] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 263 ms returned sat
[2023-03-08 06:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:19:22] [INFO ] [Nat]Absence check using state equation in 2184 ms returned sat
[2023-03-08 06:19:22] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 81 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 06:19:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p2))
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 110 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 187 reset in 4336 ms.
Product exploration explored 100000 steps with 189 reset in 4187 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 85 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
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 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1282 transition count 768
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 250 place count 1282 transition count 768
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 253 place count 1282 transition count 768
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 255 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 255 place count 1282 transition count 768
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 255 rules in 232 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:19:42] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 06:19:42] [INFO ] Computed 515 place invariants in 60 ms
[2023-03-08 06:19:43] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1282/1282 places, 768/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1654 ms. Remains : 1282/1282 places, 768/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 46 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 06:19:43] [INFO ] Computed 515 place invariants in 64 ms
[2023-03-08 06:19:45] [INFO ] Implicit Places using invariants in 1698 ms returned [284]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1700 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1282 places, 768/768 transitions.
Applied a total of 0 rules in 77 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 1824 ms. Remains : 1281/1282 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 75566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1||F(p2))))))'
Support contains 6 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Applied a total of 0 rules in 99 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1482 cols
[2023-03-08 06:19:45] [INFO ] Computed 715 place invariants in 28 ms
[2023-03-08 06:19:47] [INFO ] Implicit Places using invariants in 2472 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 103, 107, 122, 125, 135, 141, 146, 148, 151, 154, 159, 169, 176, 183, 189, 192, 193, 194, 220, 224, 239, 242, 243, 245, 250, 254, 268, 271, 298, 306, 312, 319, 324, 327, 333, 344, 347, 349, 355, 362, 374, 375, 383, 396, 403, 408, 413, 414, 415, 432, 445, 447, 457, 458, 465, 467, 474, 493, 503, 510, 513, 524, 525, 527, 529, 538, 543, 551, 552, 555, 571, 572, 574, 599, 605, 615, 623, 626, 649, 651, 654, 655, 658, 659, 663, 669, 678, 679, 683, 684, 686, 693, 698, 702, 703, 712, 736, 747, 755, 761, 765, 778, 789, 792, 795, 796, 802, 805, 824, 828, 831, 841, 857, 859, 868, 870, 888, 916, 923, 931, 932, 949, 972, 983, 987, 991, 992, 993, 994, 1016, 1020, 1033, 1045, 1050, 1058, 1064, 1066, 1071, 1091, 1098, 1101, 1117, 1123, 1127, 1130, 1132, 1133, 1147, 1151, 1175, 1181, 1193, 1208, 1215, 1224, 1225, 1229, 1254, 1261, 1262, 1266, 1267, 1290, 1296, 1311, 1313, 1317, 1319, 1330, 1335, 1336, 1364, 1385, 1393, 1401, 1407, 1415, 1426, 1430, 1438, 1440, 1445, 1457, 1462, 1464, 1473]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 2475 ms to find 200 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1482 places, 768/768 transitions.
Applied a total of 0 rules in 77 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 2652 ms. Remains : 1282/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 317 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 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (LT s186 1) (LT s964 1)), p1:(AND (GEQ s182 1) (GEQ s1158 1)), p0:(OR (LT s92 1) (LT s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21941 reset in 4805 ms.
Product exploration explored 100000 steps with 20864 reset in 4813 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 240 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 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))]
Finished random walk after 187 steps, including 0 resets, run visited all 7 properties in 28 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p2 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 539 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 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))]
Stuttering acceptance computed with spot in 307 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))]
Support contains 6 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 78 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 06:20:00] [INFO ] Computed 515 place invariants in 21 ms
[2023-03-08 06:20:02] [INFO ] Implicit Places using invariants in 1816 ms returned []
[2023-03-08 06:20:02] [INFO ] Invariant cache hit.
[2023-03-08 06:20:04] [INFO ] Implicit Places using invariants and state equation in 2276 ms returned []
Implicit Place search using SMT with State Equation took 4106 ms to find 0 implicit places.
[2023-03-08 06:20:04] [INFO ] Invariant cache hit.
[2023-03-08 06:20:05] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5618 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 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 330 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 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))]
Finished random walk after 483 steps, including 0 resets, run visited all 7 properties in 70 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p2 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 553 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 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))]
Stuttering acceptance computed with spot in 303 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))]
Stuttering acceptance computed with spot in 321 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))]
Product exploration explored 100000 steps with 20188 reset in 4981 ms.
Product exploration explored 100000 steps with 20959 reset in 5319 ms.
Applying partial POR strategy [true, true, false, false, true, true]
Stuttering acceptance computed with spot in 315 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))]
Support contains 6 out of 1282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1282 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 250 place count 1282 transition count 768
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 1 with 2 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 215 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 06:20:19] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 06:20:19] [INFO ] Computed 515 place invariants in 22 ms
[2023-03-08 06:20:21] [INFO ] Dead Transitions using invariants and state equation in 1559 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1282/1282 places, 768/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1798 ms. Remains : 1282/1282 places, 768/768 transitions.
Support contains 6 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 64 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 06:20:21] [INFO ] Computed 515 place invariants in 21 ms
[2023-03-08 06:20:23] [INFO ] Implicit Places using invariants in 1910 ms returned []
[2023-03-08 06:20:23] [INFO ] Invariant cache hit.
[2023-03-08 06:20:25] [INFO ] Implicit Places using invariants and state equation in 2333 ms returned []
Implicit Place search using SMT with State Equation took 4247 ms to find 0 implicit places.
[2023-03-08 06:20:25] [INFO ] Invariant cache hit.
[2023-03-08 06:20:27] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5747 ms. Remains : 1282/1282 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-13 finished in 41946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 4 out of 1482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1482 transition count 755
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1469 transition count 755
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 26 place count 1469 transition count 714
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 108 place count 1428 transition count 714
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 190 place count 1387 transition count 673
Applied a total of 190 rules in 159 ms. Remains 1387 /1482 variables (removed 95) and now considering 673/768 (removed 95) transitions.
// Phase 1: matrix 673 rows 1387 cols
[2023-03-08 06:20:27] [INFO ] Computed 715 place invariants in 28 ms
[2023-03-08 06:20:30] [INFO ] Implicit Places using invariants in 2745 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 102, 106, 107, 121, 124, 134, 140, 145, 147, 150, 152, 157, 166, 173, 180, 186, 189, 190, 191, 213, 217, 230, 233, 234, 236, 239, 243, 256, 259, 283, 290, 295, 302, 307, 310, 315, 325, 327, 329, 335, 342, 353, 354, 361, 374, 381, 386, 391, 392, 393, 410, 423, 425, 434, 435, 442, 444, 450, 467, 477, 484, 487, 498, 499, 501, 503, 511, 516, 521, 522, 525, 541, 542, 544, 567, 573, 583, 591, 594, 617, 619, 622, 623, 625, 626, 630, 635, 644, 645, 649, 650, 652, 659, 664, 668, 669, 678, 701, 712, 719, 725, 729, 742, 753, 755, 757, 758, 764, 767, 784, 788, 791, 801, 817, 819, 828, 830, 847, 875, 880, 888, 889, 906, 928, 938, 941, 944, 945, 946, 947, 968, 972, 982, 994, 999, 1007, 1013, 1014, 1018, 1036, 1042, 1045, 1058, 1061, 1064, 1068, 1071, 1073, 1074, 1087, 1089, 1111, 1116, 1125, 1137, 1144, 1153, 1154, 1157, 1179, 1185, 1186, 1190, 1191, 1212, 1218, 1231, 1233, 1237, 1239, 1249, 1254, 1255, 1282, 1300, 1307, 1314, 1320, 1328, 1338, 1341, 1348, 1350, 1355, 1366, 1370, 1372, 1378]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2747 ms to find 202 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1185/1482 places, 673/768 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 1185 transition count 515
Reduce places removed 158 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 159 rules applied. Total rules applied 317 place count 1027 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 318 place count 1026 transition count 514
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 318 place count 1026 transition count 512
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 322 place count 1024 transition count 512
Applied a total of 322 rules in 46 ms. Remains 1024 /1185 variables (removed 161) and now considering 512/673 (removed 161) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2023-03-08 06:20:30] [INFO ] Computed 513 place invariants in 14 ms
[2023-03-08 06:20:32] [INFO ] Implicit Places using invariants in 1914 ms returned []
[2023-03-08 06:20:32] [INFO ] Invariant cache hit.
[2023-03-08 06:20:34] [INFO ] Implicit Places using invariants and state equation in 2286 ms returned []
Implicit Place search using SMT with State Equation took 4204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1024/1482 places, 512/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7157 ms. Remains : 1024/1482 places, 512/768 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LT s509 1) (LT s775 1)), p0:(AND (GEQ s518 1) (GEQ s786 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 292 reset in 4387 ms.
Product exploration explored 100000 steps with 291 reset in 4585 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)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 362 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 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 344 steps, including 0 resets, run visited all 3 properties in 43 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 496 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 101 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-08 06:20:45] [INFO ] Invariant cache hit.
[2023-03-08 06:20:47] [INFO ] [Real]Absence check using 511 positive place invariants in 546 ms returned sat
[2023-03-08 06:20:47] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 134 ms returned sat
[2023-03-08 06:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:20:52] [INFO ] [Real]Absence check using state equation in 5638 ms returned sat
[2023-03-08 06:20:53] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-08 06:21:00] [INFO ] Added : 100 causal constraints over 20 iterations in 7642 ms. Result :unknown
Could not prove EG (NOT p0)
[2023-03-08 06:21:00] [INFO ] Invariant cache hit.
[2023-03-08 06:21:02] [INFO ] [Real]Absence check using 511 positive place invariants in 523 ms returned sat
[2023-03-08 06:21:02] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 92 ms returned sat
[2023-03-08 06:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:21:04] [INFO ] [Real]Absence check using state equation in 2748 ms returned sat
[2023-03-08 06:21:05] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 53 ms.
[2023-03-08 06:21:15] [INFO ] Added : 120 causal constraints over 24 iterations in 10589 ms. Result :unknown
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 34 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-08 06:21:15] [INFO ] Invariant cache hit.
[2023-03-08 06:21:17] [INFO ] Implicit Places using invariants in 1889 ms returned []
[2023-03-08 06:21:17] [INFO ] Invariant cache hit.
[2023-03-08 06:21:19] [INFO ] Implicit Places using invariants and state equation in 2121 ms returned []
Implicit Place search using SMT with State Equation took 4024 ms to find 0 implicit places.
[2023-03-08 06:21:19] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 06:21:19] [INFO ] Invariant cache hit.
[2023-03-08 06:21:20] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5065 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 p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 3 factoid took 384 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 104 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 968 steps, including 0 resets, run visited all 3 properties in 70 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 488 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 101 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-08 06:21:22] [INFO ] Invariant cache hit.
[2023-03-08 06:21:24] [INFO ] [Real]Absence check using 511 positive place invariants in 418 ms returned sat
[2023-03-08 06:21:24] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 132 ms returned sat
[2023-03-08 06:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:21:29] [INFO ] [Real]Absence check using state equation in 5399 ms returned sat
[2023-03-08 06:21:30] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-08 06:21:37] [INFO ] Added : 105 causal constraints over 21 iterations in 8021 ms. Result :unknown
Could not prove EG (NOT p0)
[2023-03-08 06:21:38] [INFO ] Invariant cache hit.
[2023-03-08 06:21:39] [INFO ] [Real]Absence check using 511 positive place invariants in 477 ms returned sat
[2023-03-08 06:21:39] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 107 ms returned sat
[2023-03-08 06:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:21:42] [INFO ] [Real]Absence check using state equation in 2738 ms returned sat
[2023-03-08 06:21:42] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-08 06:21:53] [INFO ] Added : 120 causal constraints over 24 iterations in 10743 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 292 reset in 4607 ms.
Product exploration explored 100000 steps with 318 reset in 4826 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.
[2023-03-08 06:22:02] [INFO ] Invariant cache hit.
[2023-03-08 06:22:03] [INFO ] Implicit Places using invariants in 1397 ms returned []
[2023-03-08 06:22:03] [INFO ] Invariant cache hit.
[2023-03-08 06:22:06] [INFO ] Implicit Places using invariants and state equation in 2462 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
[2023-03-08 06:22:06] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 06:22:06] [INFO ] Invariant cache hit.
[2023-03-08 06:22:07] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4869 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-14 finished in 100124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X(X(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 331 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 1482 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1482 transition count 755
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1469 transition count 755
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 26 place count 1469 transition count 715
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 106 place count 1429 transition count 715
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 188 place count 1388 transition count 674
Applied a total of 188 rules in 257 ms. Remains 1388 /1482 variables (removed 94) and now considering 674/768 (removed 94) transitions.
// Phase 1: matrix 674 rows 1388 cols
[2023-03-08 06:22:08] [INFO ] Computed 715 place invariants in 28 ms
[2023-03-08 06:22:11] [INFO ] Implicit Places using invariants in 2588 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 102, 106, 107, 121, 124, 134, 140, 145, 147, 150, 152, 157, 166, 173, 180, 186, 189, 190, 191, 213, 217, 230, 233, 234, 236, 239, 243, 256, 259, 283, 290, 295, 302, 307, 310, 315, 325, 327, 329, 335, 342, 353, 354, 361, 374, 381, 386, 391, 392, 393, 410, 423, 425, 434, 435, 442, 444, 450, 467, 477, 484, 487, 498, 499, 501, 503, 511, 516, 521, 522, 525, 541, 542, 544, 567, 573, 583, 591, 594, 617, 619, 622, 623, 625, 626, 630, 635, 644, 645, 649, 650, 652, 659, 664, 668, 669, 678, 701, 712, 719, 725, 729, 742, 753, 755, 757, 758, 764, 767, 784, 788, 791, 801, 817, 819, 828, 830, 847, 875, 880, 888, 889, 906, 928, 938, 941, 944, 945, 946, 947, 968, 972, 982, 994, 999, 1007, 1013, 1014, 1018, 1036, 1042, 1045, 1058, 1061, 1064, 1068, 1071, 1073, 1074, 1087, 1089, 1111, 1116, 1126, 1138, 1145, 1154, 1155, 1158, 1180, 1186, 1187, 1191, 1192, 1213, 1219, 1232, 1234, 1238, 1240, 1250, 1255, 1256, 1301, 1308, 1315, 1321, 1329, 1339, 1342, 1349, 1351, 1356, 1367, 1371, 1373, 1379]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 2594 ms to find 201 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1187/1482 places, 674/768 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 1187 transition count 516
Reduce places removed 158 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 160 rules applied. Total rules applied 318 place count 1029 transition count 514
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 320 place count 1027 transition count 514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 1026 transition count 513
Applied a total of 322 rules in 103 ms. Remains 1026 /1187 variables (removed 161) and now considering 513/674 (removed 161) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2023-03-08 06:22:11] [INFO ] Computed 514 place invariants in 9 ms
[2023-03-08 06:22:12] [INFO ] Implicit Places using invariants in 1578 ms returned []
[2023-03-08 06:22:12] [INFO ] Invariant cache hit.
[2023-03-08 06:22:14] [INFO ] Implicit Places using invariants and state equation in 1919 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1026/1482 places, 513/768 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6468 ms. Remains : 1026/1482 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s318 1) (LT s341 1)), p1:(AND (GEQ s814 1) (GEQ s941 1)), p2:(OR (AND (GEQ s318 1) (GEQ s341 1)) (AND (GEQ s742 1) (GEQ s944 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 3419 ms.
Product exploration explored 100000 steps with 4 reset in 3777 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 (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 391 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 462 steps, including 0 resets, run visited all 4 properties in 50 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 683 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-08 06:22:24] [INFO ] Invariant cache hit.
[2023-03-08 06:22:26] [INFO ] [Real]Absence check using 511 positive place invariants in 602 ms returned sat
[2023-03-08 06:22:26] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 198 ms returned sat
[2023-03-08 06:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:22:31] [INFO ] [Real]Absence check using state equation in 5435 ms returned sat
[2023-03-08 06:22:31] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-08 06:22:39] [INFO ] Added : 105 causal constraints over 21 iterations in 7675 ms. Result :unknown
Could not prove EG (NOT p1)
[2023-03-08 06:22:39] [INFO ] Invariant cache hit.
[2023-03-08 06:22:41] [INFO ] [Real]Absence check using 511 positive place invariants in 542 ms returned sat
[2023-03-08 06:22:41] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 71 ms returned sat
[2023-03-08 06:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:22:50] [INFO ] [Real]Absence check using state equation in 9016 ms returned sat
[2023-03-08 06:22:50] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-08 06:22:54] [INFO ] Added : 50 causal constraints over 10 iterations in 4308 ms. Result :unknown
Could not prove EG (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 27 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 06:22:54] [INFO ] Invariant cache hit.
[2023-03-08 06:22:56] [INFO ] Implicit Places using invariants in 1504 ms returned []
[2023-03-08 06:22:56] [INFO ] Invariant cache hit.
[2023-03-08 06:22:58] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 3768 ms to find 0 implicit places.
[2023-03-08 06:22:58] [INFO ] Invariant cache hit.
[2023-03-08 06:22:59] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4923 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), (X (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 543 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 592 steps, including 0 resets, run visited all 4 properties in 57 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 696 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-08 06:23:02] [INFO ] Invariant cache hit.
[2023-03-08 06:23:04] [INFO ] [Real]Absence check using 511 positive place invariants in 423 ms returned sat
[2023-03-08 06:23:04] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 125 ms returned sat
[2023-03-08 06:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:23:09] [INFO ] [Real]Absence check using state equation in 5471 ms returned sat
[2023-03-08 06:23:09] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-08 06:23:17] [INFO ] Added : 115 causal constraints over 23 iterations in 7962 ms. Result :unknown
Could not prove EG (NOT p1)
[2023-03-08 06:23:17] [INFO ] Invariant cache hit.
[2023-03-08 06:23:19] [INFO ] [Real]Absence check using 511 positive place invariants in 446 ms returned sat
[2023-03-08 06:23:19] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 111 ms returned sat
[2023-03-08 06:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:23:28] [INFO ] [Real]Absence check using state equation in 9356 ms returned sat
[2023-03-08 06:23:28] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-08 06:23:32] [INFO ] Added : 50 causal constraints over 10 iterations in 4114 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 196 ms :[(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 4086 ms.
Product exploration explored 100000 steps with 0 reset in 3631 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(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 41 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 06:23:41] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 06:23:41] [INFO ] Invariant cache hit.
[2023-03-08 06:23:42] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1156 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 51 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 06:23:42] [INFO ] Invariant cache hit.
[2023-03-08 06:23:43] [INFO ] Implicit Places using invariants in 1563 ms returned []
[2023-03-08 06:23:43] [INFO ] Invariant cache hit.
[2023-03-08 06:23:46] [INFO ] Implicit Places using invariants and state equation in 2324 ms returned []
Implicit Place search using SMT with State Equation took 3897 ms to find 0 implicit places.
[2023-03-08 06:23:46] [INFO ] Invariant cache hit.
[2023-03-08 06:23:47] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5068 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 99505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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.202303021504/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 162 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Support contains 6 out of 1482 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1482/1482 places, 768/768 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1482 transition count 755
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1469 transition count 755
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 26 place count 1469 transition count 714
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 108 place count 1428 transition count 714
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 188 place count 1388 transition count 674
Applied a total of 188 rules in 243 ms. Remains 1388 /1482 variables (removed 94) and now considering 674/768 (removed 94) transitions.
// Phase 1: matrix 674 rows 1388 cols
[2023-03-08 06:23:47] [INFO ] Computed 715 place invariants in 27 ms
[2023-03-08 06:23:50] [INFO ] Implicit Places using invariants in 2661 ms returned [3, 17, 33, 43, 45, 57, 73, 77, 79, 81, 83, 88, 92, 94, 102, 106, 107, 121, 124, 134, 140, 145, 147, 150, 152, 157, 166, 173, 180, 186, 189, 190, 191, 213, 217, 230, 233, 234, 236, 239, 243, 256, 259, 283, 290, 295, 302, 307, 310, 325, 327, 329, 342, 353, 354, 361, 374, 381, 386, 391, 392, 393, 410, 423, 425, 434, 435, 442, 444, 450, 467, 477, 484, 487, 498, 499, 501, 503, 511, 516, 521, 522, 525, 541, 542, 544, 567, 573, 583, 591, 594, 617, 619, 622, 623, 625, 626, 630, 636, 645, 646, 650, 651, 653, 660, 665, 669, 670, 679, 702, 713, 720, 726, 730, 743, 754, 756, 758, 759, 765, 768, 785, 789, 792, 802, 818, 820, 829, 831, 848, 876, 881, 889, 890, 907, 929, 939, 942, 945, 946, 947, 948, 969, 973, 983, 995, 1000, 1008, 1014, 1015, 1019, 1037, 1043, 1046, 1059, 1062, 1065, 1069, 1072, 1074, 1075, 1088, 1090, 1112, 1117, 1126, 1138, 1145, 1154, 1155, 1158, 1180, 1186, 1187, 1191, 1192, 1213, 1219, 1232, 1234, 1238, 1240, 1250, 1255, 1256, 1283, 1301, 1308, 1315, 1321, 1329, 1339, 1342, 1349, 1351, 1356, 1367, 1371, 1373, 1379]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 2664 ms to find 200 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1188/1482 places, 674/768 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1188 transition count 517
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 314 place count 1031 transition count 517
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 314 place count 1031 transition count 516
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 316 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 320 place count 1028 transition count 514
Applied a total of 320 rules in 117 ms. Remains 1028 /1188 variables (removed 160) and now considering 514/674 (removed 160) transitions.
// Phase 1: matrix 514 rows 1028 cols
[2023-03-08 06:23:50] [INFO ] Computed 515 place invariants in 15 ms
[2023-03-08 06:23:52] [INFO ] Implicit Places using invariants in 1765 ms returned []
[2023-03-08 06:23:52] [INFO ] Invariant cache hit.
[2023-03-08 06:23:54] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 4033 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1028/1482 places, 514/768 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7058 ms. Remains : 1028/1482 places, 514/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s226 1) (LT s952 1)), p1:(OR (LT s241 1) (LT s502 1)), p2:(AND (GEQ s214 1) (GEQ s810 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 369 reset in 4618 ms.
Product exploration explored 100000 steps with 359 reset in 4653 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))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 651 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 77 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 745 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-08 06:24:06] [INFO ] Invariant cache hit.
[2023-03-08 06:24:07] [INFO ] [Real]Absence check using 511 positive place invariants in 570 ms returned sat
[2023-03-08 06:24:08] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 104 ms returned sat
[2023-03-08 06:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:11] [INFO ] [Real]Absence check using state equation in 2942 ms returned sat
[2023-03-08 06:24:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:12] [INFO ] [Nat]Absence check using 511 positive place invariants in 396 ms returned sat
[2023-03-08 06:24:12] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 149 ms returned sat
[2023-03-08 06:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:15] [INFO ] [Nat]Absence check using state equation in 3092 ms returned sat
[2023-03-08 06:24:15] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-08 06:24:20] [INFO ] Added : 256 causal constraints over 52 iterations in 5178 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
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 LTL mode, iteration 0 : 1028/1028 places, 514/514 transitions.
Applied a total of 0 rules in 48 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2023-03-08 06:24:20] [INFO ] Invariant cache hit.
[2023-03-08 06:24:22] [INFO ] Implicit Places using invariants in 1628 ms returned []
[2023-03-08 06:24:22] [INFO ] Invariant cache hit.
[2023-03-08 06:24:24] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned []
Implicit Place search using SMT with State Equation took 3810 ms to find 0 implicit places.
[2023-03-08 06:24:24] [INFO ] Invariant cache hit.
[2023-03-08 06:24:25] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4981 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 p1 (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 1 factoid took 287 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 92 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 345 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-08 06:24:27] [INFO ] Invariant cache hit.
[2023-03-08 06:24:29] [INFO ] [Real]Absence check using 511 positive place invariants in 702 ms returned sat
[2023-03-08 06:24:29] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 167 ms returned sat
[2023-03-08 06:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:33] [INFO ] [Real]Absence check using state equation in 3830 ms returned sat
[2023-03-08 06:24:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:34] [INFO ] [Nat]Absence check using 511 positive place invariants in 450 ms returned sat
[2023-03-08 06:24:34] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 138 ms returned sat
[2023-03-08 06:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:37] [INFO ] [Nat]Absence check using state equation in 2959 ms returned sat
[2023-03-08 06:24:38] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-08 06:24:43] [INFO ] Added : 256 causal constraints over 52 iterations in 5311 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 115 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 360 reset in 4551 ms.
Product exploration explored 100000 steps with 381 reset in 4455 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 106 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
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 514
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1028 transition count 514
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 68 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2023-03-08 06:24:52] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 514 rows 1028 cols
[2023-03-08 06:24:52] [INFO ] Computed 515 place invariants in 19 ms
[2023-03-08 06:24:53] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1028/1028 places, 514/514 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1309 ms. Remains : 1028/1028 places, 514/514 transitions.
Support contains 4 out of 1028 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1028/1028 places, 514/514 transitions.
Applied a total of 0 rules in 47 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
// Phase 1: matrix 514 rows 1028 cols
[2023-03-08 06:24:54] [INFO ] Computed 515 place invariants in 13 ms
[2023-03-08 06:24:55] [INFO ] Implicit Places using invariants in 1951 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1962 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1027/1028 places, 514/514 transitions.
Applied a total of 0 rules in 46 ms. Remains 1027 /1027 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2057 ms. Remains : 1027/1028 places, 514/514 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 68681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
[2023-03-08 06:24:56] [INFO ] Flatten gal took : 87 ms
[2023-03-08 06:24:56] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-08 06:24:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1482 places, 768 transitions and 2964 arcs took 15 ms.
Total runtime 674716 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircularTrains-PT-768
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability
FORMULA CircularTrains-PT-768-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircularTrains-PT-768-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircularTrains-PT-768-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircularTrains-PT-768-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircularTrains-PT-768-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678256860399
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 14 (type EXCL) for 13 CircularTrains-PT-768-LTLFireability-10
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for CircularTrains-PT-768-LTLFireability-10
lola: result : false
lola: markings : 46292
lola: fired transitions : 46408
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 20 (type EXCL) for 19 CircularTrains-PT-768-LTLFireability-13
lola: time limit : 513 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 4/513 4/32 CircularTrains-PT-768-LTLFireability-13 308963 m, 61792 m/sec, 512908 t fired, .
Time elapsed: 7 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 9/513 8/32 CircularTrains-PT-768-LTLFireability-13 656675 m, 69542 m/sec, 1203196 t fired, .
Time elapsed: 12 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 14/513 12/32 CircularTrains-PT-768-LTLFireability-13 1000411 m, 68747 m/sec, 1884699 t fired, .
Time elapsed: 17 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 19/513 17/32 CircularTrains-PT-768-LTLFireability-13 1355258 m, 70969 m/sec, 2584271 t fired, .
Time elapsed: 22 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 24/513 20/32 CircularTrains-PT-768-LTLFireability-13 1635370 m, 56022 m/sec, 3260353 t fired, .
Time elapsed: 27 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 29/513 23/32 CircularTrains-PT-768-LTLFireability-13 1895430 m, 52012 m/sec, 3906959 t fired, .
Time elapsed: 32 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 34/513 25/32 CircularTrains-PT-768-LTLFireability-13 2137786 m, 48471 m/sec, 4508698 t fired, .
Time elapsed: 37 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 39/513 28/32 CircularTrains-PT-768-LTLFireability-13 2410731 m, 54589 m/sec, 5185260 t fired, .
Time elapsed: 42 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 44/513 32/32 CircularTrains-PT-768-LTLFireability-13 2690817 m, 56017 m/sec, 5866302 t fired, .
Time elapsed: 47 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 20 (type EXCL) for CircularTrains-PT-768-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 52 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 17 (type EXCL) for 16 CircularTrains-PT-768-LTLFireability-12
lola: time limit : 591 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 5/591 3/32 CircularTrains-PT-768-LTLFireability-12 288762 m, 57752 m/sec, 748290 t fired, .
Time elapsed: 57 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 10/591 5/32 CircularTrains-PT-768-LTLFireability-12 486587 m, 39565 m/sec, 1536166 t fired, .
Time elapsed: 62 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 15/591 7/32 CircularTrains-PT-768-LTLFireability-12 682972 m, 39277 m/sec, 2318050 t fired, .
Time elapsed: 67 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 20/591 9/32 CircularTrains-PT-768-LTLFireability-12 880806 m, 39566 m/sec, 3106059 t fired, .
Time elapsed: 72 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 25/591 10/32 CircularTrains-PT-768-LTLFireability-12 1078248 m, 39488 m/sec, 3892409 t fired, .
Time elapsed: 77 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 30/591 12/32 CircularTrains-PT-768-LTLFireability-12 1275216 m, 39393 m/sec, 4674086 t fired, .
Time elapsed: 82 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 35/591 14/32 CircularTrains-PT-768-LTLFireability-12 1474061 m, 39769 m/sec, 5466343 t fired, .
Time elapsed: 87 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 40/591 15/32 CircularTrains-PT-768-LTLFireability-12 1671547 m, 39497 m/sec, 6253540 t fired, .
Time elapsed: 92 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 45/591 17/32 CircularTrains-PT-768-LTLFireability-12 1869626 m, 39615 m/sec, 7041923 t fired, .
Time elapsed: 97 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 50/591 19/32 CircularTrains-PT-768-LTLFireability-12 2066188 m, 39312 m/sec, 7822998 t fired, .
Time elapsed: 102 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 55/591 21/32 CircularTrains-PT-768-LTLFireability-12 2264473 m, 39657 m/sec, 8613272 t fired, .
Time elapsed: 107 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 60/591 22/32 CircularTrains-PT-768-LTLFireability-12 2460388 m, 39183 m/sec, 9393784 t fired, .
Time elapsed: 112 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 65/591 24/32 CircularTrains-PT-768-LTLFireability-12 2655683 m, 39059 m/sec, 10170407 t fired, .
Time elapsed: 117 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 70/591 26/32 CircularTrains-PT-768-LTLFireability-12 2852993 m, 39462 m/sec, 10956749 t fired, .
Time elapsed: 122 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 75/591 27/32 CircularTrains-PT-768-LTLFireability-12 3049245 m, 39250 m/sec, 11737007 t fired, .
Time elapsed: 127 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 80/591 29/32 CircularTrains-PT-768-LTLFireability-12 3242893 m, 38729 m/sec, 12508763 t fired, .
Time elapsed: 132 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 85/591 31/32 CircularTrains-PT-768-LTLFireability-12 3438684 m, 39158 m/sec, 13287185 t fired, .
Time elapsed: 137 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 90/591 32/32 CircularTrains-PT-768-LTLFireability-12 3635933 m, 39449 m/sec, 14071918 t fired, .
Time elapsed: 142 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 17 (type EXCL) for CircularTrains-PT-768-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 147 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 9 (type EXCL) for 6 CircularTrains-PT-768-LTLFireability-09
lola: time limit : 690 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for CircularTrains-PT-768-LTLFireability-09
lola: result : false
lola: markings : 49624
lola: fired transitions : 49624
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 CircularTrains-PT-768-LTLFireability-00
lola: time limit : 1150 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CircularTrains-PT-768-LTLFireability-00
lola: result : false
lola: markings : 51861
lola: fired transitions : 51861
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 23 (type EXCL) for 22 CircularTrains-PT-768-LTLFireability-14
lola: time limit : 1726 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-00: LTL false LTL model checker
CircularTrains-PT-768-LTLFireability-09: CONJ false LTL model checker
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
23 LTL EXCL 4/1726 8/32 CircularTrains-PT-768-LTLFireability-14 534937 m, 106987 m/sec, 556118 t fired, .
Time elapsed: 152 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-00: LTL false LTL model checker
CircularTrains-PT-768-LTLFireability-09: CONJ false LTL model checker
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
23 LTL EXCL 9/1726 18/32 CircularTrains-PT-768-LTLFireability-14 1255183 m, 144049 m/sec, 1293127 t fired, .
Time elapsed: 157 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: FINISHED task # 23 (type EXCL) for CircularTrains-PT-768-LTLFireability-14
lola: result : true
lola: markings : 1945213
lola: fired transitions : 1999140
lola: time used : 14.000000
lola: memory pages used : 27
lola: LAUNCH task # 4 (type EXCL) for 3 CircularTrains-PT-768-LTLFireability-03
lola: time limit : 3438 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-00: LTL false LTL model checker
CircularTrains-PT-768-LTLFireability-09: CONJ false LTL model checker
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
CircularTrains-PT-768-LTLFireability-14: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-768-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-768-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-768-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 0/3438 1/32 CircularTrains-PT-768-LTLFireability-03 15647 m, 3129 m/sec, 15646 t fired, .
Time elapsed: 162 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: FINISHED task # 4 (type EXCL) for CircularTrains-PT-768-LTLFireability-03
lola: result : false
lola: markings : 107252
lola: fired transitions : 107252
lola: time used : 1.000000
lola: memory pages used : 2
lola: Portfolio finished: no open tasks 7
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-768-LTLFireability-00: LTL false LTL model checker
CircularTrains-PT-768-LTLFireability-03: LTL false LTL model checker
CircularTrains-PT-768-LTLFireability-09: CONJ false LTL model checker
CircularTrains-PT-768-LTLFireability-10: LTL false LTL model checker
CircularTrains-PT-768-LTLFireability-12: LTL unknown AGGR
CircularTrains-PT-768-LTLFireability-13: LTL unknown AGGR
CircularTrains-PT-768-LTLFireability-14: LTL true LTL model checker
Time elapsed: 163 secs. Pages in use: 32
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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r071-smll-167814397700196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-768.tgz
mv CircularTrains-PT-768 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;