About the Execution of LTSMin+red for CircularTrains-PT-768
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 601.396 | 654489.00 | 696323.00 | 3428.80 | ?TF?TFFFF??F???F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399200196.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 ltsminxred
Input is CircularTrains-PT-768, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399200196
=====================================================================
--------------------
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 1678309245261
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 21:00:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 21:00:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:00:48] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-08 21:00:48] [INFO ] Transformed 1536 places.
[2023-03-08 21:00:48] [INFO ] Transformed 768 transitions.
[2023-03-08 21:00:48] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 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 230 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 21:00:48] [INFO ] Computed 769 place invariants in 123 ms
[2023-03-08 21:00:51] [INFO ] Implicit Places using invariants in 2819 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 2871 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 270 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 3372 ms. Remains : 1482/1536 places, 768/768 transitions.
Support contains 62 out of 1482 places after structural reductions.
[2023-03-08 21:00:52] [INFO ] Flatten gal took : 164 ms
[2023-03-08 21:00:52] [INFO ] Flatten gal took : 90 ms
[2023-03-08 21:00:52] [INFO ] Input system was already deterministic with 768 transitions.
Finished random walk after 993 steps, including 0 resets, run visited all 30 properties in 222 ms. (steps per millisecond=4 )
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 77 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 21:00:53] [INFO ] Computed 715 place invariants in 40 ms
[2023-03-08 21:00:55] [INFO ] Implicit Places using invariants in 1911 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 1915 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 136 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 2128 ms. Remains : 1280/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 253 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 7082 reset in 4467 ms.
Product exploration explored 100000 steps with 7294 reset in 4702 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 p0), (X (NOT p0)), (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 (X p0)), (X (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)))))]
Knowledge based reduction with 1 factoid took 367 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 113 ms :[false, false, false]
Finished random walk after 228 steps, including 0 resets, run visited all 3 properties in 28 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (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 (X p0)), (X (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))))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 420 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 114 ms :[false, false, false]
Stuttering acceptance computed with spot in 113 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 70 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 21:01:06] [INFO ] Computed 513 place invariants in 16 ms
[2023-03-08 21:01:08] [INFO ] Implicit Places using invariants in 1581 ms returned []
[2023-03-08 21:01:08] [INFO ] Invariant cache hit.
[2023-03-08 21:01:10] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
[2023-03-08 21:01:10] [INFO ] Invariant cache hit.
[2023-03-08 21:01:11] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4914 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 p0), (X (NOT p0)), (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 (X p0)), (X (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)))))]
Knowledge based reduction with 1 factoid took 345 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 112 ms :[false, false, false]
Finished random walk after 302 steps, including 0 resets, run visited all 3 properties in 33 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (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 (X p0)), (X (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))))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 411 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 112 ms :[false, false, false]
Stuttering acceptance computed with spot in 115 ms :[false, false, false]
Stuttering acceptance computed with spot in 115 ms :[false, false, false]
Product exploration explored 100000 steps with 7036 reset in 4211 ms.
Product exploration explored 100000 steps with 7580 reset in 4577 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 54 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:01:22] [INFO ] Invariant cache hit.
[2023-03-08 21:01:24] [INFO ] Implicit Places using invariants in 1674 ms returned []
[2023-03-08 21:01:24] [INFO ] Invariant cache hit.
[2023-03-08 21:01:26] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 4007 ms to find 0 implicit places.
[2023-03-08 21:01:26] [INFO ] Invariant cache hit.
[2023-03-08 21:01:27] [INFO ] Dead Transitions using invariants and state equation in 1156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5219 ms. Remains : 1280/1280 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-00 finished in 34729 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 73 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 21:01:28] [INFO ] Computed 715 place invariants in 21 ms
[2023-03-08 21:01:29] [INFO ] Implicit Places using invariants in 1867 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 1870 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 52 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 1996 ms. Remains : 1281/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 181 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 1003 steps with 0 reset in 45 ms.
FORMULA CircularTrains-PT-768-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-02 finished in 2245 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 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 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 259 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 21:01:30] [INFO ] Computed 715 place invariants in 19 ms
[2023-03-08 21:01:32] [INFO ] Implicit Places using invariants in 2337 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 2343 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 0 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 0 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 108 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 21:01:32] [INFO ] Computed 514 place invariants in 10 ms
[2023-03-08 21:01:34] [INFO ] Implicit Places using invariants in 1551 ms returned []
[2023-03-08 21:01:34] [INFO ] Invariant cache hit.
[2023-03-08 21:01:36] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 3582 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 6292 ms. Remains : 1026/1482 places, 513/768 transitions.
Stuttering acceptance computed with spot in 78 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 126 reset in 3964 ms.
Product exploration explored 100000 steps with 138 reset in 4313 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 (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 295 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 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 374 steps, including 0 resets, run visited all 3 properties in 30 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 405 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))]
Stuttering acceptance computed with spot in 80 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 44 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 21:01:46] [INFO ] Invariant cache hit.
[2023-03-08 21:01:48] [INFO ] Implicit Places using invariants in 1618 ms returned []
[2023-03-08 21:01:48] [INFO ] Invariant cache hit.
[2023-03-08 21:01:50] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 3652 ms to find 0 implicit places.
[2023-03-08 21:01:50] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-08 21:01:50] [INFO ] Invariant cache hit.
[2023-03-08 21:01:51] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4589 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 (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 287 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 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 412 steps, including 0 resets, run visited all 3 properties in 31 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 349 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 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 140 reset in 4025 ms.
Product exploration explored 100000 steps with 138 reset in 4391 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 41 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 21:02:01] [INFO ] Invariant cache hit.
[2023-03-08 21:02:02] [INFO ] Implicit Places using invariants in 1633 ms returned []
[2023-03-08 21:02:02] [INFO ] Invariant cache hit.
[2023-03-08 21:02:05] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 3836 ms to find 0 implicit places.
[2023-03-08 21:02:05] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 21:02:05] [INFO ] Invariant cache hit.
[2023-03-08 21:02:06] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4728 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 35840 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 64 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 21:02:06] [INFO ] Computed 715 place invariants in 21 ms
[2023-03-08 21:02:08] [INFO ] Implicit Places using invariants in 2238 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 2244 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 50 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 2361 ms. Remains : 1280/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 120 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 4936 ms.
Product exploration explored 100000 steps with 33333 reset in 5224 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 104 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 13449 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 65 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:02:19] [INFO ] Invariant cache hit.
[2023-03-08 21:02:21] [INFO ] Implicit Places using invariants in 1860 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 1867 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 49 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1983 ms. Remains : 1280/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 234 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 1189 steps with 188 reset in 54 ms.
FORMULA CircularTrains-PT-768-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLFireability-05 finished in 2293 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 68 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:02:21] [INFO ] Invariant cache hit.
[2023-03-08 21:02:23] [INFO ] Implicit Places using invariants in 1793 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 1801 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 51 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 1920 ms. Remains : 1280/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 146 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 2091 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 68 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:02:24] [INFO ] Invariant cache hit.
[2023-03-08 21:02:26] [INFO ] Implicit Places using invariants in 2332 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 2335 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 50 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 2454 ms. Remains : 1281/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 272 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 3337 ms.
Product exploration explored 100000 steps with 0 reset in 3859 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 (NOT (AND p0 p1))), (X p2), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 438 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 208 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 225 steps, including 0 resets, run visited all 4 properties in 20 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X p2), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 497 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 202 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 200 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 21:02:36] [INFO ] Computed 514 place invariants in 15 ms
[2023-03-08 21:02:37] [INFO ] [Real]Absence check using 511 positive place invariants in 608 ms returned sat
[2023-03-08 21:02:37] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 163 ms returned sat
[2023-03-08 21:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:02:50] [INFO ] [Real]Absence check using state equation in 12489 ms returned sat
[2023-03-08 21:02:50] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-08 21:02:51] [INFO ] Added : 10 causal constraints over 2 iterations in 514 ms. Result :unknown
Could not prove EG (NOT p1)
[2023-03-08 21:02:51] [INFO ] Invariant cache hit.
[2023-03-08 21:02:52] [INFO ] [Real]Absence check using 511 positive place invariants in 470 ms returned sat
[2023-03-08 21:02:52] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 225 ms returned sat
[2023-03-08 21:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:02:56] [INFO ] [Real]Absence check using state equation in 3338 ms returned sat
[2023-03-08 21:02:56] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 55 ms.
[2023-03-08 21:03:06] [INFO ] Added : 85 causal constraints over 17 iterations in 9896 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 52 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:03:06] [INFO ] Invariant cache hit.
[2023-03-08 21:03:07] [INFO ] Implicit Places using invariants in 1550 ms returned []
[2023-03-08 21:03:07] [INFO ] Invariant cache hit.
[2023-03-08 21:03:10] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned []
Implicit Place search using SMT with State Equation took 3774 ms to find 0 implicit places.
[2023-03-08 21:03:10] [INFO ] Invariant cache hit.
[2023-03-08 21:03:11] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4990 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 (NOT (AND p0 p1))), (X p2), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 411 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 233 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 203 steps, including 0 resets, run visited all 4 properties in 35 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X p2), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 499 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 197 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 202 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-08 21:03:13] [INFO ] Invariant cache hit.
[2023-03-08 21:03:14] [INFO ] [Real]Absence check using 511 positive place invariants in 483 ms returned sat
[2023-03-08 21:03:15] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 221 ms returned sat
[2023-03-08 21:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:03:20] [INFO ] [Real]Absence check using state equation in 5205 ms returned sat
[2023-03-08 21:03:20] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 55 ms.
[2023-03-08 21:03:28] [INFO ] Added : 90 causal constraints over 18 iterations in 7944 ms. Result :unknown
Could not prove EG (NOT p1)
[2023-03-08 21:03:28] [INFO ] Invariant cache hit.
[2023-03-08 21:03:30] [INFO ] [Real]Absence check using 511 positive place invariants in 492 ms returned sat
[2023-03-08 21:03:30] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 220 ms returned sat
[2023-03-08 21:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:03:33] [INFO ] [Real]Absence check using state equation in 2903 ms returned sat
[2023-03-08 21:03:33] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-08 21:03:43] [INFO ] Added : 95 causal constraints over 19 iterations in 10277 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 204 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 2 reset in 3390 ms.
Product exploration explored 100000 steps with 0 reset in 3759 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 203 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 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 1281 transition count 768
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 255 rules in 262 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:03:51] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 768 rows 1281 cols
[2023-03-08 21:03:51] [INFO ] Computed 514 place invariants in 15 ms
[2023-03-08 21:03:52] [INFO ] Dead Transitions using invariants and state equation in 1135 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 1420 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 54 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 21:03:52] [INFO ] Computed 514 place invariants in 14 ms
[2023-03-08 21:03:54] [INFO ] Implicit Places using invariants in 1646 ms returned []
[2023-03-08 21:03:54] [INFO ] Invariant cache hit.
[2023-03-08 21:03:56] [INFO ] Implicit Places using invariants and state equation in 2430 ms returned []
Implicit Place search using SMT with State Equation took 4079 ms to find 0 implicit places.
[2023-03-08 21:03:56] [INFO ] Invariant cache hit.
[2023-03-08 21:03:57] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5043 ms. Remains : 1281/1281 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 93775 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 1 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 178 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 21:03:58] [INFO ] Computed 715 place invariants in 18 ms
[2023-03-08 21:04:00] [INFO ] Implicit Places using invariants in 2308 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 2313 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 55 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 21:04:00] [INFO ] Computed 513 place invariants in 10 ms
[2023-03-08 21:04:02] [INFO ] Implicit Places using invariants in 1478 ms returned []
[2023-03-08 21:04:02] [INFO ] Invariant cache hit.
[2023-03-08 21:04:04] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 3340 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 5887 ms. Remains : 1024/1482 places, 512/768 transitions.
Stuttering acceptance computed with spot in 90 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 337 reset in 4505 ms.
Product exploration explored 100000 steps with 347 reset in 4914 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 (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge based reduction with 3 factoid took 878 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 651 ms. (steps per millisecond=15 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:04:16] [INFO ] Invariant cache hit.
[2023-03-08 21:04:16] [INFO ] After 151ms 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 (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) 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 662 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 80 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
[2023-03-08 21:04:17] [INFO ] Invariant cache hit.
[2023-03-08 21:04:18] [INFO ] [Real]Absence check using 511 positive place invariants in 434 ms returned sat
[2023-03-08 21:04:18] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 107 ms returned sat
[2023-03-08 21:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:04:26] [INFO ] [Real]Absence check using state equation in 8253 ms returned sat
[2023-03-08 21:04:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:04:28] [INFO ] [Nat]Absence check using 511 positive place invariants in 604 ms returned sat
[2023-03-08 21:04:28] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 131 ms returned sat
[2023-03-08 21:04:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:04:31] [INFO ] [Nat]Absence check using state equation in 2852 ms returned sat
[2023-03-08 21:04:31] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-08 21:04:36] [INFO ] Added : 254 causal constraints over 51 iterations in 5836 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 21:04:37] [INFO ] Invariant cache hit.
[2023-03-08 21:04:38] [INFO ] Implicit Places using invariants in 1481 ms returned []
[2023-03-08 21:04:38] [INFO ] Invariant cache hit.
[2023-03-08 21:04:40] [INFO ] Implicit Places using invariants and state equation in 2053 ms returned []
Implicit Place search using SMT with State Equation took 3542 ms to find 0 implicit places.
[2023-03-08 21:04:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 21:04:40] [INFO ] Invariant cache hit.
[2023-03-08 21:04:41] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4414 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 p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (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 (X (AND p0 p1 (NOT p2)))), (X (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))))))]
Knowledge based reduction with 1 factoid took 384 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 81 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
Finished random walk after 586 steps, including 0 resets, run visited all 4 properties in 29 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (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 (X (AND p0 p1 (NOT p2)))), (X (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)))))), (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 429 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 79 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 78 ms :[(AND p1 (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND p1 (NOT p2) (NOT p0)))]
[2023-03-08 21:04:43] [INFO ] Invariant cache hit.
[2023-03-08 21:04:44] [INFO ] [Real]Absence check using 511 positive place invariants in 440 ms returned sat
[2023-03-08 21:04:44] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 111 ms returned sat
[2023-03-08 21:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:04:52] [INFO ] [Real]Absence check using state equation in 7708 ms returned sat
[2023-03-08 21:04:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:04:53] [INFO ] [Nat]Absence check using 511 positive place invariants in 441 ms returned sat
[2023-03-08 21:04:53] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 135 ms returned sat
[2023-03-08 21:04:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:04:56] [INFO ] [Nat]Absence check using state equation in 3343 ms returned sat
[2023-03-08 21:04:56] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-08 21:05:00] [INFO ] Added : 254 causal constraints over 51 iterations in 3846 ms. Result :sat
Could not prove EG (AND p1 (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 84 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 367 reset in 4546 ms.
Product exploration explored 100000 steps with 346 reset in 4988 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 40 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-08 21:05:10] [INFO ] Invariant cache hit.
[2023-03-08 21:05:11] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2023-03-08 21:05:11] [INFO ] Invariant cache hit.
[2023-03-08 21:05:13] [INFO ] Implicit Places using invariants and state equation in 1731 ms returned []
Implicit Place search using SMT with State Equation took 3270 ms to find 0 implicit places.
[2023-03-08 21:05:13] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 21:05:13] [INFO ] Invariant cache hit.
[2023-03-08 21:05:14] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4101 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-10 finished in 76743 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 66 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 21:05:14] [INFO ] Computed 715 place invariants in 21 ms
[2023-03-08 21:05:16] [INFO ] Implicit Places using invariants in 2477 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 2481 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 62 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 2610 ms. Remains : 1281/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 131 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 2761 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 64 ms. Remains 1482 /1482 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:05:17] [INFO ] Invariant cache hit.
[2023-03-08 21:05:19] [INFO ] Implicit Places using invariants in 2522 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 2525 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 71 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 2661 ms. Remains : 1282/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 155 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 174 reset in 4064 ms.
Product exploration explored 100000 steps with 189 reset in 4562 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 (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (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 (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (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)))))]
Knowledge based reduction with 1 factoid took 505 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 73 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 361 steps, including 0 resets, run visited all 2 properties in 23 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (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 (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (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))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 534 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 75 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 21:05:30] [INFO ] Computed 515 place invariants in 17 ms
[2023-03-08 21:05:32] [INFO ] [Real]Absence check using 511 positive place invariants in 508 ms returned sat
[2023-03-08 21:05:32] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 55 ms returned sat
[2023-03-08 21:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:05:40] [INFO ] [Real]Absence check using state equation in 8397 ms returned sat
[2023-03-08 21:05:40] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 52 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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: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 21:05:45] [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: Broken pipe ... 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 48 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:05:45] [INFO ] Invariant cache hit.
[2023-03-08 21:05:47] [INFO ] Implicit Places using invariants in 1601 ms returned []
[2023-03-08 21:05:47] [INFO ] Invariant cache hit.
[2023-03-08 21:05:49] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 3603 ms to find 0 implicit places.
[2023-03-08 21:05:49] [INFO ] Invariant cache hit.
[2023-03-08 21:05:50] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4775 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 p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 225 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 73 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 261 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 72 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-08 21:05:51] [INFO ] Invariant cache hit.
[2023-03-08 21:05:53] [INFO ] [Real]Absence check using 511 positive place invariants in 461 ms returned sat
[2023-03-08 21:05:53] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 170 ms returned sat
[2023-03-08 21:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:06:02] [INFO ] [Real]Absence check using state equation in 8568 ms returned sat
[2023-03-08 21:06:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:06:03] [INFO ] [Nat]Absence check using 511 positive place invariants in 493 ms returned sat
[2023-03-08 21:06:03] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 314 ms returned sat
[2023-03-08 21:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:06:06] [INFO ] [Nat]Absence check using state equation in 2327 ms returned sat
[2023-03-08 21:06:06] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-08 21:06:18] [INFO ] Deduced a trap composed of 3 places in 1471 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: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 21:06:18] [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 83 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 197 reset in 4258 ms.
Product exploration explored 100000 steps with 183 reset in 4768 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 76 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 1 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 0 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 162 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:06:28] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 21:06:28] [INFO ] Computed 515 place invariants in 38 ms
[2023-03-08 21:06:29] [INFO ] Dead Transitions using invariants and state equation in 1210 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 1387 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 52 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 21:06:29] [INFO ] Computed 515 place invariants in 42 ms
[2023-03-08 21:06:31] [INFO ] Implicit Places using invariants in 1859 ms returned [284]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1861 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 52 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 1965 ms. Remains : 1281/1282 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 74052 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 63 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 21:06:31] [INFO ] Computed 715 place invariants in 21 ms
[2023-03-08 21:06:33] [INFO ] Implicit Places using invariants in 2623 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 2625 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 74 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 2765 ms. Remains : 1282/1482 places, 768/768 transitions.
Stuttering acceptance computed with spot in 222 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 20887 reset in 4998 ms.
Product exploration explored 100000 steps with 21996 reset in 5640 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 (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (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)))))]
Knowledge based reduction with 1 factoid took 248 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 236 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 401 steps, including 0 resets, run visited all 7 properties in 24 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p2 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (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))))), (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 398 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 230 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 236 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 51 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 21:06:47] [INFO ] Computed 515 place invariants in 14 ms
[2023-03-08 21:06:48] [INFO ] Implicit Places using invariants in 1746 ms returned []
[2023-03-08 21:06:48] [INFO ] Invariant cache hit.
[2023-03-08 21:06:51] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 4138 ms to find 0 implicit places.
[2023-03-08 21:06:51] [INFO ] Invariant cache hit.
[2023-03-08 21:06:52] [INFO ] Dead Transitions using invariants and state equation in 1384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5578 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 (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (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)))))]
Knowledge based reduction with 1 factoid took 271 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 227 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 893 steps, including 0 resets, run visited all 7 properties in 68 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p2 (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (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))))), (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 393 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 221 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 240 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 224 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 21622 reset in 4809 ms.
Product exploration explored 100000 steps with 20959 reset in 5292 ms.
Applying partial POR strategy [true, true, false, false, true, true]
Stuttering acceptance computed with spot in 230 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 1 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 146 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-08 21:07:05] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 768 rows 1282 cols
[2023-03-08 21:07:05] [INFO ] Computed 515 place invariants in 14 ms
[2023-03-08 21:07:06] [INFO ] Dead Transitions using invariants and state equation in 1190 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 1354 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 52 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 21:07:06] [INFO ] Computed 515 place invariants in 14 ms
[2023-03-08 21:07:08] [INFO ] Implicit Places using invariants in 1508 ms returned []
[2023-03-08 21:07:08] [INFO ] Invariant cache hit.
[2023-03-08 21:07:10] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 4140 ms to find 0 implicit places.
[2023-03-08 21:07:10] [INFO ] Invariant cache hit.
[2023-03-08 21:07:12] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5524 ms. Remains : 1282/1282 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-13 finished in 41079 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 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 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 190 place count 1387 transition count 673
Applied a total of 190 rules in 237 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 21:07:12] [INFO ] Computed 715 place invariants in 19 ms
[2023-03-08 21:07:14] [INFO ] Implicit Places using invariants in 2347 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 2350 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 76 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 21:07:15] [INFO ] Computed 513 place invariants in 10 ms
[2023-03-08 21:07:16] [INFO ] Implicit Places using invariants in 1683 ms returned []
[2023-03-08 21:07:16] [INFO ] Invariant cache hit.
[2023-03-08 21:07:18] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 3594 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 6259 ms. Remains : 1024/1482 places, 512/768 transitions.
Stuttering acceptance computed with spot in 76 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 300 reset in 4557 ms.
Product exploration explored 100000 steps with 297 reset in 4857 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 p0)), (X (NOT (AND p0 (NOT p1))))]
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 300 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 85 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 1557 steps, including 0 resets, run visited all 3 properties in 68 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 423 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 p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-08 21:07:29] [INFO ] Invariant cache hit.
[2023-03-08 21:07:31] [INFO ] [Real]Absence check using 511 positive place invariants in 588 ms returned sat
[2023-03-08 21:07:31] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 133 ms returned sat
[2023-03-08 21:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:07:37] [INFO ] [Real]Absence check using state equation in 6275 ms returned sat
[2023-03-08 21:07:37] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-08 21:07:44] [INFO ] Added : 105 causal constraints over 21 iterations in 7032 ms. Result :unknown
Could not prove EG (NOT p0)
[2023-03-08 21:07:44] [INFO ] Invariant cache hit.
[2023-03-08 21:07:46] [INFO ] [Real]Absence check using 511 positive place invariants in 626 ms returned sat
[2023-03-08 21:07:46] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 107 ms returned sat
[2023-03-08 21:07:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:07:49] [INFO ] [Real]Absence check using state equation in 2867 ms returned sat
[2023-03-08 21:07:49] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-08 21:07:59] [INFO ] Added : 120 causal constraints over 24 iterations in 10535 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 35 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-08 21:07:59] [INFO ] Invariant cache hit.
[2023-03-08 21:08:01] [INFO ] Implicit Places using invariants in 1640 ms returned []
[2023-03-08 21:08:01] [INFO ] Invariant cache hit.
[2023-03-08 21:08:03] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 3809 ms to find 0 implicit places.
[2023-03-08 21:08:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 21:08:03] [INFO ] Invariant cache hit.
[2023-03-08 21:08:04] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4693 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 p0 (NOT p1))))]
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 300 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 p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 383 steps, including 0 resets, run visited all 3 properties in 22 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 354 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 73 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-08 21:08:06] [INFO ] Invariant cache hit.
[2023-03-08 21:08:07] [INFO ] [Real]Absence check using 511 positive place invariants in 452 ms returned sat
[2023-03-08 21:08:07] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 133 ms returned sat
[2023-03-08 21:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:08:13] [INFO ] [Real]Absence check using state equation in 6202 ms returned sat
[2023-03-08 21:08:13] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-08 21:08:21] [INFO ] Added : 110 causal constraints over 22 iterations in 7442 ms. Result :unknown
Could not prove EG (NOT p0)
[2023-03-08 21:08:21] [INFO ] Invariant cache hit.
[2023-03-08 21:08:22] [INFO ] [Real]Absence check using 511 positive place invariants in 446 ms returned sat
[2023-03-08 21:08:22] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 103 ms returned sat
[2023-03-08 21:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:08:25] [INFO ] [Real]Absence check using state equation in 2983 ms returned sat
[2023-03-08 21:08:25] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-08 21:08:36] [INFO ] Added : 125 causal constraints over 25 iterations in 10700 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 295 reset in 4293 ms.
Product exploration explored 100000 steps with 277 reset in 4837 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 34 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-08 21:08:45] [INFO ] Invariant cache hit.
[2023-03-08 21:08:46] [INFO ] Implicit Places using invariants in 1299 ms returned []
[2023-03-08 21:08:46] [INFO ] Invariant cache hit.
[2023-03-08 21:08:48] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2902 ms to find 0 implicit places.
[2023-03-08 21:08:48] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 21:08:48] [INFO ] Invariant cache hit.
[2023-03-08 21:08:49] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3787 ms. Remains : 1024/1024 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-14 finished in 97001 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 250 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 165 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 21:08:50] [INFO ] Computed 715 place invariants in 21 ms
[2023-03-08 21:08:52] [INFO ] Implicit Places using invariants in 2475 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 2494 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 80 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 21:08:52] [INFO ] Computed 514 place invariants in 10 ms
[2023-03-08 21:08:54] [INFO ] Implicit Places using invariants in 1544 ms returned []
[2023-03-08 21:08:54] [INFO ] Invariant cache hit.
[2023-03-08 21:08:55] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 3265 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 6006 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 3 reset in 3621 ms.
Product exploration explored 100000 steps with 4 reset in 4003 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 (NOT (AND p0 p1))), (X p2), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 552 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 188 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 159 steps, including 0 resets, run visited all 4 properties in 11 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X p2), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 488 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 188 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 188 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-08 21:09:05] [INFO ] Invariant cache hit.
[2023-03-08 21:09:07] [INFO ] [Real]Absence check using 511 positive place invariants in 443 ms returned sat
[2023-03-08 21:09:07] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 145 ms returned sat
[2023-03-08 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:09:13] [INFO ] [Real]Absence check using state equation in 6283 ms returned sat
[2023-03-08 21:09:13] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-08 21:09:20] [INFO ] Added : 110 causal constraints over 22 iterations in 7367 ms. Result :unknown
Could not prove EG (NOT p1)
[2023-03-08 21:09:20] [INFO ] Invariant cache hit.
[2023-03-08 21:09:22] [INFO ] [Real]Absence check using 511 positive place invariants in 474 ms returned sat
[2023-03-08 21:09:22] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 73 ms returned sat
[2023-03-08 21:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:09:31] [INFO ] [Real]Absence check using state equation in 9116 ms returned sat
[2023-03-08 21:09:31] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-08 21:09:35] [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 28 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 21:09:36] [INFO ] Invariant cache hit.
[2023-03-08 21:09:37] [INFO ] Implicit Places using invariants in 1661 ms returned []
[2023-03-08 21:09:37] [INFO ] Invariant cache hit.
[2023-03-08 21:09:39] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 3709 ms to find 0 implicit places.
[2023-03-08 21:09:39] [INFO ] Invariant cache hit.
[2023-03-08 21:09:40] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4598 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 (NOT (AND p0 p1))), (X p2), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 451 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 193 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 853 steps, including 0 resets, run visited all 4 properties in 74 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X p2), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 632 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 244 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 225 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-08 21:09:43] [INFO ] Invariant cache hit.
[2023-03-08 21:09:44] [INFO ] [Real]Absence check using 511 positive place invariants in 473 ms returned sat
[2023-03-08 21:09:44] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 199 ms returned sat
[2023-03-08 21:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:09:51] [INFO ] [Real]Absence check using state equation in 6536 ms returned sat
[2023-03-08 21:09:51] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-08 21:09:58] [INFO ] Added : 100 causal constraints over 20 iterations in 6850 ms. Result :unknown
Could not prove EG (NOT p1)
[2023-03-08 21:09:58] [INFO ] Invariant cache hit.
[2023-03-08 21:09:59] [INFO ] [Real]Absence check using 511 positive place invariants in 441 ms returned sat
[2023-03-08 21:09:59] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 103 ms returned sat
[2023-03-08 21:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:10:09] [INFO ] [Real]Absence check using state equation in 9625 ms returned sat
[2023-03-08 21:10:09] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-08 21:10:13] [INFO ] Added : 45 causal constraints over 9 iterations in 3943 ms. Result :unknown
Could not prove EG (NOT p0)
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)]
Product exploration explored 100000 steps with 2 reset in 3596 ms.
Product exploration explored 100000 steps with 0 reset in 4351 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 191 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 34 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 21:10:21] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 21:10:21] [INFO ] Invariant cache hit.
[2023-03-08 21:10:22] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 906 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 29 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2023-03-08 21:10:22] [INFO ] Invariant cache hit.
[2023-03-08 21:10:24] [INFO ] Implicit Places using invariants in 1385 ms returned []
[2023-03-08 21:10:24] [INFO ] Invariant cache hit.
[2023-03-08 21:10:25] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 3146 ms to find 0 implicit places.
[2023-03-08 21:10:25] [INFO ] Invariant cache hit.
[2023-03-08 21:10:26] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3944 ms. Remains : 1026/1026 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 97128 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 108 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 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 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 246 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 21:10:27] [INFO ] Computed 715 place invariants in 27 ms
[2023-03-08 21:10:29] [INFO ] Implicit Places using invariants in 2628 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 2631 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 120 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 21:10:30] [INFO ] Computed 515 place invariants in 14 ms
[2023-03-08 21:10:31] [INFO ] Implicit Places using invariants in 1793 ms returned []
[2023-03-08 21:10:31] [INFO ] Invariant cache hit.
[2023-03-08 21:10:33] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 3978 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 6976 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 386 reset in 4580 ms.
Product exploration explored 100000 steps with 370 reset in 4977 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 (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (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 (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (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)))))]
Knowledge based reduction with 1 factoid took 533 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 100 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 682 steps, including 0 resets, run visited all 2 properties in 56 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (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 (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (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))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 660 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 95 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-08 21:10:45] [INFO ] Invariant cache hit.
[2023-03-08 21:10:46] [INFO ] [Real]Absence check using 511 positive place invariants in 419 ms returned sat
[2023-03-08 21:10:47] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 106 ms returned sat
[2023-03-08 21:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:10:50] [INFO ] [Real]Absence check using state equation in 3213 ms returned sat
[2023-03-08 21:10:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:10:51] [INFO ] [Nat]Absence check using 511 positive place invariants in 580 ms returned sat
[2023-03-08 21:10:51] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 141 ms returned sat
[2023-03-08 21:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:10:55] [INFO ] [Nat]Absence check using state equation in 4146 ms returned sat
[2023-03-08 21:10:55] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-08 21:10:59] [INFO ] Added : 256 causal constraints over 52 iterations in 3843 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 38 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2023-03-08 21:10:59] [INFO ] Invariant cache hit.
[2023-03-08 21:11:01] [INFO ] Implicit Places using invariants in 1563 ms returned []
[2023-03-08 21:11:01] [INFO ] Invariant cache hit.
[2023-03-08 21:11:03] [INFO ] Implicit Places using invariants and state equation in 2190 ms returned []
Implicit Place search using SMT with State Equation took 3755 ms to find 0 implicit places.
[2023-03-08 21:11:03] [INFO ] Invariant cache hit.
[2023-03-08 21:11:04] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4506 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 p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 214 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 72 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 34 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 (NOT p2))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 271 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 77 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-08 21:11:05] [INFO ] Invariant cache hit.
[2023-03-08 21:11:07] [INFO ] [Real]Absence check using 511 positive place invariants in 588 ms returned sat
[2023-03-08 21:11:07] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 142 ms returned sat
[2023-03-08 21:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:11:11] [INFO ] [Real]Absence check using state equation in 3882 ms returned sat
[2023-03-08 21:11:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:11:12] [INFO ] [Nat]Absence check using 511 positive place invariants in 642 ms returned sat
[2023-03-08 21:11:13] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 181 ms returned sat
[2023-03-08 21:11:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:11:17] [INFO ] [Nat]Absence check using state equation in 3882 ms returned sat
[2023-03-08 21:11:17] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-08 21:11:21] [INFO ] Added : 256 causal constraints over 52 iterations in 4385 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 104 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 373 reset in 5009 ms.
Product exploration explored 100000 steps with 360 reset in 5004 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 73 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 0 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 41 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2023-03-08 21:11:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 514 rows 1028 cols
[2023-03-08 21:11:31] [INFO ] Computed 515 place invariants in 10 ms
[2023-03-08 21:11:32] [INFO ] Dead Transitions using invariants and state equation in 890 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 946 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 43 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 21:11:32] [INFO ] Computed 515 place invariants in 10 ms
[2023-03-08 21:11:34] [INFO ] Implicit Places using invariants in 1652 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1653 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 32 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 1730 ms. Remains : 1027/1028 places, 514/514 transitions.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 67677 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 21:11:34] [INFO ] Flatten gal took : 61 ms
[2023-03-08 21:11:34] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 21:11:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1482 places, 768 transitions and 2964 arcs took 10 ms.
Total runtime 646880 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3308/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3308/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3308/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3308/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3308/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3308/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3308/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-00
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-03
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-09
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-10
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-12
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-13
Could not compute solution for formula : CircularTrains-PT-768-LTLFireability-14
BK_STOP 1678309899750
--------------------
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
mcc2023
ltl formula name CircularTrains-PT-768-LTLFireability-00
ltl formula formula --ltl=/tmp/3308/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1482 places, 768 transitions and 2964 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.040 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3308/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3308/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3308/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3308/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name CircularTrains-PT-768-LTLFireability-03
ltl formula formula --ltl=/tmp/3308/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1482 places, 768 transitions and 2964 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3308/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3308/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3308/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3308/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name CircularTrains-PT-768-LTLFireability-09
ltl formula formula --ltl=/tmp/3308/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1482 places, 768 transitions and 2964 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.040 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3308/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3308/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3308/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3308/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CircularTrains-PT-768-LTLFireability-10
ltl formula formula --ltl=/tmp/3308/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1482 places, 768 transitions and 2964 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.040 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3308/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3308/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3308/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3308/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name CircularTrains-PT-768-LTLFireability-12
ltl formula formula --ltl=/tmp/3308/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1482 places, 768 transitions and 2964 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.020 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3308/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3308/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3308/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3308/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x558c230c23f4]
1: pnml2lts-mc(+0xa2496) [0x558c230c2496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f1cce27c140]
3: pnml2lts-mc(+0x405be5) [0x558c23425be5]
4: pnml2lts-mc(+0x16b3f9) [0x558c2318b3f9]
5: pnml2lts-mc(+0x164ac4) [0x558c23184ac4]
6: pnml2lts-mc(+0x272e0a) [0x558c23292e0a]
7: pnml2lts-mc(+0xb61f0) [0x558c230d61f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f1cce0cf4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f1cce0cf67a]
10: pnml2lts-mc(+0xa1581) [0x558c230c1581]
11: pnml2lts-mc(+0xa1910) [0x558c230c1910]
12: pnml2lts-mc(+0xa32a2) [0x558c230c32a2]
13: pnml2lts-mc(+0xa50f4) [0x558c230c50f4]
14: pnml2lts-mc(+0x3f34b3) [0x558c234134b3]
15: pnml2lts-mc(+0x7c63d) [0x558c2309c63d]
16: pnml2lts-mc(+0x67d86) [0x558c23087d86]
17: pnml2lts-mc(+0x60a8a) [0x558c23080a8a]
18: pnml2lts-mc(+0x5eb15) [0x558c2307eb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1cce0b7d0a]
20: pnml2lts-mc(+0x6075e) [0x558c2308075e]
ltl formula name CircularTrains-PT-768-LTLFireability-13
ltl formula formula --ltl=/tmp/3308/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1482 places, 768 transitions and 2964 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3308/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3308/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3308/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3308/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name CircularTrains-PT-768-LTLFireability-14
ltl formula formula --ltl=/tmp/3308/ltl_6_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1482 places, 768 transitions and 2964 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3308/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3308/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3308/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3308/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5647184243f4]
1: pnml2lts-mc(+0xa2496) [0x564718424496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f547a74b140]
3: pnml2lts-mc(+0x405be5) [0x564718787be5]
4: pnml2lts-mc(+0x16b3f9) [0x5647184ed3f9]
5: pnml2lts-mc(+0x164ac4) [0x5647184e6ac4]
6: pnml2lts-mc(+0x272e0a) [0x5647185f4e0a]
7: pnml2lts-mc(+0xb61f0) [0x5647184381f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f547a59e4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f547a59e67a]
10: pnml2lts-mc(+0xa1581) [0x564718423581]
11: pnml2lts-mc(+0xa1910) [0x564718423910]
12: pnml2lts-mc(+0xa32a2) [0x5647184252a2]
13: pnml2lts-mc(+0xa50f4) [0x5647184270f4]
14: pnml2lts-mc(+0xa516b) [0x56471842716b]
15: pnml2lts-mc(+0x3f34b3) [0x5647187754b3]
16: pnml2lts-mc(+0x7c63d) [0x5647183fe63d]
17: pnml2lts-mc(+0x67d86) [0x5647183e9d86]
18: pnml2lts-mc(+0x60a8a) [0x5647183e2a8a]
19: pnml2lts-mc(+0x5eb15) [0x5647183e0b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f547a586d0a]
21: pnml2lts-mc(+0x6075e) [0x5647183e275e]
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-768"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CircularTrains-PT-768, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r073-smll-167814399200196"
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 ;