Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080700635.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ServersAndClients-PT-100160, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080700635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 13 15:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 15:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 15:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 9.8M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716861653214

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100160
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 02:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:00:55] [INFO ] Load time of PNML (sax parser for PT used): 729 ms
[2024-05-28 02:00:55] [INFO ] Transformed 16561 places.
[2024-05-28 02:00:55] [INFO ] Transformed 32200 transitions.
[2024-05-28 02:00:55] [INFO ] Found NUPN structural information;
[2024-05-28 02:00:55] [INFO ] Parsed PT model containing 16561 places and 32200 transitions and 96800 arcs in 947 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ServersAndClients-PT-100160-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 233 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2024-05-28 02:00:56] [INFO ] Computed 361 invariants in 465 ms
[2024-05-28 02:01:31] [INFO ] Performed 4037/16561 implicitness test of which 237 returned IMPLICIT in 30 seconds.
[2024-05-28 02:02:02] [INFO ] Performed 16056/16561 implicitness test of which 356 returned IMPLICIT in 60 seconds.
[2024-05-28 02:02:03] [INFO ] Implicit Places using invariants in 67108 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 401, 502, 603, 704, 805, 906, 1007, 1108, 1209, 1310, 1411, 1512, 1613, 1714, 1815, 1916, 2017, 2118, 2219, 2320, 2421, 2522, 2623, 2724, 2825, 2926, 3027, 3128, 3229, 3330, 3431, 3532, 3633, 3734, 3835, 3936, 4037, 4138, 4239, 4340, 4441, 4542, 4643, 4744, 4845, 4946, 5047, 5148, 5249, 5350, 5451, 5552, 5653, 5754, 5855, 5956, 6057, 6158, 6259, 6360, 6461, 6562, 6663, 6764, 6865, 6966, 7067, 7168, 7269, 7370, 7471, 7572, 7673, 7774, 7875, 7976, 8077, 8178, 8279, 8380, 8481, 8582, 8683, 8784, 8885, 8986, 9087, 9188, 9289, 9390, 9491, 9592, 9693, 9794, 9895, 9996, 10097, 10198, 10299, 10400, 10501, 10602, 10703, 10804, 10905, 11006, 11107, 11208, 11309, 11410, 11511, 11612, 11713, 11814, 11915, 12016, 12117, 12218, 12319, 12420, 12521, 12622, 12723, 12824, 12925, 13026, 13127, 13228, 13329, 13430, 13531, 13632, 13733, 13834, 13935, 14036, 14137, 14238, 14339, 14440, 14541, 14642, 14743, 14844, 14945, 15046, 15147, 15248, 15349, 15450, 15551, 15652, 15753, 15854, 15955, 16056, 16157, 16258, 16359, 16460]
Discarding 360 places :
Implicit Place search using SMT only with invariants took 67193 ms to find 360 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16201/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 110 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67557 ms. Remains : 16201/16561 places, 32200/32200 transitions.
Support contains 36 out of 16201 places after structural reductions.
[2024-05-28 02:02:04] [INFO ] Flatten gal took : 756 ms
[2024-05-28 02:02:04] [INFO ] Flatten gal took : 521 ms
[2024-05-28 02:02:06] [INFO ] Input system was already deterministic with 32200 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (8 resets) in 4298 ms. (9 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/2 properties
// Phase 1: matrix 32200 rows 16201 cols
[2024-05-28 02:02:16] [INFO ] Computed 1 invariants in 8330 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 16201/48401 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1889 ms.
Refiners :[Domain max(s): 5/16201 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10396ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ServersAndClients-PT-100160-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 16201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32196 edges and 16201 vertex of which 16199 / 16201 are part of one of the 1 SCC in 37 ms
Free SCC test removed 16198 places
Ensure Unique test removed 32195 transitions
Reduce isomorphic transitions removed 32195 transitions.
Applied a total of 1 rules in 122 ms. Remains 3 /16201 variables (removed 16198) and now considering 5/32200 (removed 32195) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-05-28 02:02:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 02:02:18] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:02:18] [INFO ] Invariant cache hit.
[2024-05-28 02:02:18] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-28 02:02:18] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-28 02:02:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38 ms.
Refiners :[Domain max(s): 3/3 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38 ms.
Refiners :[Domain max(s): 3/3 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 80ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/16201 places, 5/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 3/16201 places, 5/32200 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 3 in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-01 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32194 edges and 16201 vertex of which 16198 / 16201 are part of one of the 1 SCC in 18 ms
Free SCC test removed 16197 places
Ensure Unique test removed 32193 transitions
Reduce isomorphic transitions removed 32193 transitions.
Applied a total of 1 rules in 55 ms. Remains 4 /16201 variables (removed 16197) and now considering 7/32200 (removed 32193) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-28 02:02:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 02:02:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 02:02:19] [INFO ] Invariant cache hit.
[2024-05-28 02:02:19] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:02:19] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-28 02:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/16201 places, 7/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 4/16201 places, 7/32200 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-02 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 98 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16201 cols
[2024-05-28 02:02:28] [INFO ] Computed 1 invariants in 8469 ms
[2024-05-28 02:02:31] [INFO ] Implicit Places using invariants in 11759 ms returned []
Implicit Place search using SMT only with invariants took 11761 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:02:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30525 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30590 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 190800ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 191133ms
Finished structural reductions in LTL mode , in 1 iterations and 203181 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 31874 steps with 0 reset in 988 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-04 finished in 204380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 62 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:47] [INFO ] Implicit Places using invariants in 3041 ms returned []
Implicit Place search using SMT only with invariants took 3045 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:05:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30504 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30456 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 188956ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 189279ms
Finished structural reductions in LTL mode , in 1 iterations and 192453 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 2337 ms.
Entered a terminal (fully accepting) state of product in 7126 steps with 0 reset in 157 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-05 finished in 195086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 51 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-05-28 02:08:59] [INFO ] Invariant cache hit.
[2024-05-28 02:09:02] [INFO ] Implicit Places using invariants in 2992 ms returned []
Implicit Place search using SMT only with invariants took 2996 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:09:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30472 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30535 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 204318ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 204561ms
Finished structural reductions in LTL mode , in 1 iterations and 207642 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-06 finished in 207845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 16201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32196 edges and 16201 vertex of which 16199 / 16201 are part of one of the 1 SCC in 14 ms
Free SCC test removed 16198 places
Ensure Unique test removed 32195 transitions
Reduce isomorphic transitions removed 32195 transitions.
Applied a total of 1 rules in 44 ms. Remains 3 /16201 variables (removed 16198) and now considering 5/32200 (removed 32195) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-05-28 02:12:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 02:12:26] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:12:26] [INFO ] Invariant cache hit.
[2024-05-28 02:12:26] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-28 02:12:26] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-28 02:12:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29 ms.
Refiners :[Domain max(s): 3/3 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26 ms.
Refiners :[Domain max(s): 3/3 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 57ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/16201 places, 5/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 3/16201 places, 5/32200 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-07
Product exploration explored 100000 steps with 9015 reset in 80 ms.
Product exploration explored 100000 steps with 9130 reset in 83 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
[2024-05-28 02:12:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
[2024-05-28 02:12:27] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-28 02:12:27] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32 ms.
Refiners :[Domain max(s): 3/3 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 24 ms.
Refiners :[Domain max(s): 3/3 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 3/3 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8991 reset in 77 ms.
Product exploration explored 100000 steps with 9191 reset in 69 ms.
Built C files in :
/tmp/ltsmin4852192634772817705
[2024-05-28 02:12:28] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-28 02:12:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:28] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-28 02:12:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:28] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-28 02:12:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4852192634772817705
Running compilation step : cd /tmp/ltsmin4852192634772817705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 200 ms.
Running link step : cd /tmp/ltsmin4852192634772817705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4852192634772817705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2565823376074856960.hoa' '--buchi-type=spotba'
LTSmin run took 213 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100160-LTLCardinality-07 finished in 2494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 16201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32198 edges and 16201 vertex of which 16200 / 16201 are part of one of the 1 SCC in 15 ms
Free SCC test removed 16199 places
Ensure Unique test removed 32197 transitions
Reduce isomorphic transitions removed 32197 transitions.
Applied a total of 1 rules in 46 ms. Remains 2 /16201 variables (removed 16199) and now considering 3/32200 (removed 32197) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 02:12:29] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 02:12:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:12:29] [INFO ] Invariant cache hit.
[2024-05-28 02:12:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-28 02:12:29] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-28 02:12:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/16201 places, 3/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 2/16201 places, 3/32200 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-08 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X(F(p2)))))'
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 47 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16201 cols
[2024-05-28 02:12:37] [INFO ] Computed 1 invariants in 8233 ms
[2024-05-28 02:12:40] [INFO ] Implicit Places using invariants in 11313 ms returned []
Implicit Place search using SMT only with invariants took 11315 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:12:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30504 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30629 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 204858ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 205100ms
Finished structural reductions in LTL mode , in 1 iterations and 216512 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 6330 steps with 0 reset in 306 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-09 finished in 217092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 56 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-05-28 02:16:06] [INFO ] Invariant cache hit.
[2024-05-28 02:16:10] [INFO ] Implicit Places using invariants in 3291 ms returned []
Implicit Place search using SMT only with invariants took 3293 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:16:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30495 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30467 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 191824ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 192058ms
Finished structural reductions in LTL mode , in 1 iterations and 195442 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 6019 ms.
Product exploration explored 100000 steps with 50000 reset in 5825 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100160-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100160-LTLCardinality-10 finished in 207532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 48 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-05-28 02:19:34] [INFO ] Invariant cache hit.
[2024-05-28 02:19:37] [INFO ] Implicit Places using invariants in 3338 ms returned []
Implicit Place search using SMT only with invariants took 3339 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:19:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30463 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30458 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 220175ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 220393ms
Finished structural reductions in LTL mode , in 1 iterations and 223816 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-12
Product exploration explored 100000 steps with 33332 reset in 5659 ms.
Product exploration explored 100000 steps with 33331 reset in 4919 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 p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 242 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1861 ms. (21 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
[2024-05-28 02:23:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 16198/16201 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16201 variables, 16198/16202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16201 variables, 0/16202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5091ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32194 edges and 16201 vertex of which 16198 / 16201 are part of one of the 1 SCC in 17 ms
Free SCC test removed 16197 places
Drop transitions (Empty/Sink Transition effects.) removed 32194 transitions
Reduce isomorphic transitions removed 32194 transitions.
Applied a total of 1 rules in 65 ms. Remains 4 /16201 variables (removed 16197) and now considering 6/32200 (removed 32194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 4/16201 places, 6/32200 transitions.
RANDOM walk for 40000 steps (8 resets) in 58 ms. (677 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 02:23:35] [INFO ] Computed 1 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 4/10 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Domain max(s): 3/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 334 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 50 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16201 cols
[2024-05-28 02:23:45] [INFO ] Computed 1 invariants in 9024 ms
[2024-05-28 02:23:48] [INFO ] Implicit Places using invariants in 12031 ms returned []
Implicit Place search using SMT only with invariants took 12032 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:23:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30522 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30479 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 189314ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 189558ms
Finished structural reductions in LTL mode , in 1 iterations and 201702 ms. Remains : 16201/16201 places, 32200/32200 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 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1029 ms. (38 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/3 properties
[2024-05-28 02:26:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16198/16201 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16201 variables, 16198/16202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16201 variables, 0/16202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5060ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32194 edges and 16201 vertex of which 16198 / 16201 are part of one of the 1 SCC in 16 ms
Free SCC test removed 16197 places
Drop transitions (Empty/Sink Transition effects.) removed 32194 transitions
Reduce isomorphic transitions removed 32194 transitions.
Applied a total of 1 rules in 63 ms. Remains 4 /16201 variables (removed 16197) and now considering 6/32200 (removed 32194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 4/16201 places, 6/32200 transitions.
RANDOM walk for 40000 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 4 states, properties seen :0
Probabilistic random walk after 10 steps, saw 4 distinct states, run finished after 62 ms. (steps per millisecond=0 ) properties seen :0
Explored full state space saw : 4 states, properties seen :0
Exhaustive walk after 10 steps, saw 4 distinct states, run finished after 1 ms. (steps per millisecond=10 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 426 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33332 reset in 4702 ms.
Product exploration explored 100000 steps with 33330 reset in 4793 ms.
Applying partial POR strategy [true, true, false, false, true]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32194 edges and 16201 vertex of which 16198 / 16201 are part of one of the 1 SCC in 9 ms
Free SCC test removed 16197 places
Ensure Unique test removed 32193 transitions
Reduce isomorphic transitions removed 32193 transitions.
Applied a total of 1 rules in 38 ms. Remains 4 /16201 variables (removed 16197) and now considering 7/32200 (removed 32193) transitions.
[2024-05-28 02:27:15] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-28 02:27:15] [INFO ] Computed 1 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/16201 places, 7/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 4/16201 places, 7/32200 transitions.
Built C files in :
/tmp/ltsmin14931411228592966455
[2024-05-28 02:27:15] [INFO ] Built C files in 289ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14931411228592966455
Running compilation step : cd /tmp/ltsmin14931411228592966455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14931411228592966455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14931411228592966455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 52 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16201 cols
[2024-05-28 02:27:27] [INFO ] Computed 1 invariants in 8461 ms
[2024-05-28 02:27:30] [INFO ] Implicit Places using invariants in 11465 ms returned []
Implicit Place search using SMT only with invariants took 11466 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:27:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30476 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30472 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 186795ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 187025ms
Finished structural reductions in LTL mode , in 1 iterations and 198577 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Built C files in :
/tmp/ltsmin4550885335325133444
[2024-05-28 02:30:37] [INFO ] Built C files in 255ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4550885335325133444
Running compilation step : cd /tmp/ltsmin4550885335325133444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4550885335325133444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4550885335325133444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 02:30:41] [INFO ] Flatten gal took : 520 ms
[2024-05-28 02:30:42] [INFO ] Flatten gal took : 497 ms
[2024-05-28 02:30:42] [INFO ] Time to serialize gal into /tmp/LTL14215981326184182526.gal : 133 ms
[2024-05-28 02:30:42] [INFO ] Time to serialize properties into /tmp/LTL5734043124877371570.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14215981326184182526.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16790609438572054717.hoa' '-atoms' '/tmp/LTL5734043124877371570.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5734043124877371570.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16790609438572054717.hoa
Detected timeout of ITS tools.
[2024-05-28 02:30:58] [INFO ] Flatten gal took : 504 ms
[2024-05-28 02:30:58] [INFO ] Flatten gal took : 546 ms
[2024-05-28 02:30:58] [INFO ] Time to serialize gal into /tmp/LTL10657996737213900005.gal : 97 ms
[2024-05-28 02:30:58] [INFO ] Time to serialize properties into /tmp/LTL4279257650050361836.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10657996737213900005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4279257650050361836.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((sv6_c37==0)||(sv94_c27==1))"))&&(F("(sv70_c58==0)"))))))
Formula 0 simplified : XX(G!"((sv6_c37==0)||(sv94_c27==1))" | G!"(sv70_c58==0)")
Detected timeout of ITS tools.
[2024-05-28 02:31:14] [INFO ] Flatten gal took : 546 ms
[2024-05-28 02:31:14] [INFO ] Applying decomposition
[2024-05-28 02:31:14] [INFO ] Flatten gal took : 562 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14790455707867347816.txt' '-o' '/tmp/graph14790455707867347816.bin' '-w' '/tmp/graph14790455707867347816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14790455707867347816.bin' '-l' '-1' '-v' '-w' '/tmp/graph14790455707867347816.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:31:16] [INFO ] Decomposing Gal with order
[2024-05-28 02:31:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:31:21] [INFO ] Removed a total of 7464 redundant transitions.
[2024-05-28 02:31:21] [INFO ] Flatten gal took : 1615 ms
[2024-05-28 02:31:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 7360 labels/synchronizations in 121 ms.
[2024-05-28 02:31:22] [INFO ] Time to serialize gal into /tmp/LTL3017623078613988792.gal : 129 ms
[2024-05-28 02:31:22] [INFO ] Time to serialize properties into /tmp/LTL2925248811298052626.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3017623078613988792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2925248811298052626.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((i37.u51.sv6_c37==0)||(i27.u35.sv94_c27==1))"))&&(F("(u81.sv70_c58==0)"))))))
Formula 0 simplified : XX(G!"((i37.u51.sv6_c37==0)||(i27.u35.sv94_c27==1))" | G!"(u81.sv70_c58==0)")
Detected timeout of ITS tools.
Treatment of property ServersAndClients-PT-100160-LTLCardinality-12 finished in 722866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 4 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Applied a total of 0 rules in 51 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:40] [INFO ] Implicit Places using invariants in 3016 ms returned []
Implicit Place search using SMT only with invariants took 3018 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-05-28 02:31:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30499 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 32100/32100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16200 variables, 16200/16200 constraints. Problems are: Problem set: 0 solved, 32100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 16200/48401 variables, and 16200 constraints, problems are : Problem set: 0 solved, 32100 unsolved in 30519 ms.
Refiners :[Domain max(s): 16200/16201 constraints, Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/16201 constraints, PredecessorRefiner: 0/32100 constraints, Known Traps: 0/0 constraints]
After SMT, in 187336ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 187557ms
Finished structural reductions in LTL mode , in 1 iterations and 190662 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-13 finished in 190904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 16201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32198 edges and 16201 vertex of which 16200 / 16201 are part of one of the 1 SCC in 7 ms
Free SCC test removed 16199 places
Ensure Unique test removed 32197 transitions
Reduce isomorphic transitions removed 32197 transitions.
Applied a total of 1 rules in 36 ms. Remains 2 /16201 variables (removed 16199) and now considering 3/32200 (removed 32197) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 02:34:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 02:34:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 02:34:48] [INFO ] Invariant cache hit.
[2024-05-28 02:34:48] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-28 02:34:48] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-28 02:34:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 41ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/16201 places, 3/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 2/16201 places, 3/32200 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 44 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-15 finished in 232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Found a Shortening insensitive property : ServersAndClients-PT-100160-LTLCardinality-12
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 16201 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32194 edges and 16201 vertex of which 16198 / 16201 are part of one of the 1 SCC in 9 ms
Free SCC test removed 16197 places
Ensure Unique test removed 32193 transitions
Reduce isomorphic transitions removed 32193 transitions.
Applied a total of 1 rules in 40 ms. Remains 4 /16201 variables (removed 16197) and now considering 7/32200 (removed 32193) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-28 02:34:48] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 02:34:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:34:48] [INFO ] Invariant cache hit.
[2024-05-28 02:34:48] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-05-28 02:34:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in LI_LTL mode, iteration 1 : 4/16201 places, 7/32200 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 156 ms. Remains : 4/16201 places, 7/32200 transitions.
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-12
Product exploration explored 100000 steps with 31989 reset in 138 ms.
Product exploration explored 100000 steps with 31986 reset in 161 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 p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 291 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
[2024-05-28 02:34:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 4/11 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 3/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 371 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-28 02:34:50] [INFO ] Invariant cache hit.
[2024-05-28 02:34:50] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 02:34:50] [INFO ] Invariant cache hit.
[2024-05-28 02:34:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-05-28 02:34:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 4/4 places, 7/7 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 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 291 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
[2024-05-28 02:34:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 4/11 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Domain max(s): 3/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 304 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 32008 reset in 49 ms.
Product exploration explored 100000 steps with 31992 reset in 52 ms.
Applying partial POR strategy [true, true, false, false, true]
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-28 02:34:52] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-28 02:34:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 693 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/10 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 731ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 732ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 742 ms. Remains : 4/4 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin12595647790922185644
[2024-05-28 02:34:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12595647790922185644
Running compilation step : cd /tmp/ltsmin12595647790922185644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin12595647790922185644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12595647790922185644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased684430621284988397.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
Treatment of property ServersAndClients-PT-100160-LTLCardinality-12 finished in 5229 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-12 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-28 02:34:53] [INFO ] Flatten gal took : 446 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 2039563 ms.

BK_STOP 1716863694019

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ServersAndClients-PT-100160, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679080700635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-100160.tgz
mv ServersAndClients-PT-100160 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;