fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r524-tall-171679080700635
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ServersAndClients-PT-100160

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15856.132 2502850.00 7186751.00 2665.40 FFFFFFF?FFTF?FT? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r524-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 ltsminxred
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 r524-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 1717230223142

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100160
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:23:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:23:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:23:45] [INFO ] Load time of PNML (sax parser for PT used): 764 ms
[2024-06-01 08:23:45] [INFO ] Transformed 16561 places.
[2024-06-01 08:23:45] [INFO ] Transformed 32200 transitions.
[2024-06-01 08:23:45] [INFO ] Found NUPN structural information;
[2024-06-01 08:23:45] [INFO ] Parsed PT model containing 16561 places and 32200 transitions and 96800 arcs in 1018 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 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 385 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2024-06-01 08:23:46] [INFO ] Computed 361 invariants in 459 ms
[2024-06-01 08:24:22] [INFO ] Performed 1714/16561 implicitness test of which 214 returned IMPLICIT in 30 seconds.
[2024-06-01 08:24:52] [INFO ] Performed 9996/16561 implicitness test of which 296 returned IMPLICIT in 60 seconds.
[2024-06-01 08:25:14] [INFO ] Implicit Places using invariants in 88289 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 88429 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 130 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 88974 ms. Remains : 16201/16561 places, 32200/32200 transitions.
Support contains 36 out of 16201 places after structural reductions.
[2024-06-01 08:25:15] [INFO ] Flatten gal took : 858 ms
[2024-06-01 08:25:16] [INFO ] Flatten gal took : 653 ms
[2024-06-01 08:25:18] [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 4597 ms. (8 steps per ms) remains 12/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 4/5 properties
// Phase 1: matrix 32200 rows 16201 cols
[2024-06-01 08:25:28] [INFO ] Computed 1 invariants in 8467 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (OVERLAPS) 16191/16201 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16201 variables, 16191/16202 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16201 variables, 0/16202 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 13664ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 16201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16201/16201 places, 32200/32200 transitions.
Graph (trivial) has 32190 edges and 16201 vertex of which 16196 / 16201 are part of one of the 1 SCC in 59 ms
Free SCC test removed 16195 places
Drop transitions (Empty/Sink Transition effects.) removed 32190 transitions
Reduce isomorphic transitions removed 32190 transitions.
Applied a total of 1 rules in 138 ms. Remains 6 /16201 variables (removed 16195) and now considering 10/32200 (removed 32190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 6/16201 places, 10/32200 transitions.
RANDOM walk for 56 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/3 properties
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 18 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 80 ms. Remains 3 /16201 variables (removed 16198) and now considering 5/32200 (removed 32195) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-06-01 08:25:34] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:25:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 08:25:34] [INFO ] Invariant cache hit.
[2024-06-01 08:25:34] [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-06-01 08:25:34] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 08:25:34] [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 37 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 39 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 87ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 87ms
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 226 ms. Remains : 3/16201 places, 5/32200 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 216 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-01 finished in 675 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 17 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 73 ms. Remains 4 /16201 variables (removed 16197) and now considering 7/32200 (removed 32193) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-06-01 08:25:35] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:25:35] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:25:35] [INFO ] Invariant cache hit.
[2024-06-01 08:25:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 08:25:35] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 08:25:35] [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 37 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 84ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 85ms
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 212 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 312 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 85 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16201 cols
[2024-06-01 08:25:44] [INFO ] Computed 1 invariants in 8886 ms
[2024-06-01 08:25:47] [INFO ] Implicit Places using invariants in 12655 ms returned []
Implicit Place search using SMT only with invariants took 12658 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-06-01 08:25: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 30649 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 30487 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 199877ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 200215ms
Finished structural reductions in LTL mode , in 1 iterations and 213098 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 89 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 14726 steps with 0 reset in 567 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-04 finished in 213834 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 63 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-06-01 08:29:09] [INFO ] Invariant cache hit.
[2024-06-01 08:29:12] [INFO ] Implicit Places using invariants in 3393 ms returned []
Implicit Place search using SMT only with invariants took 3404 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-06-01 08:29:13] [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 30498 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 30487 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 195747ms problems are : Problem set: 0 solved, 32100 unsolved
Search for dead transitions found 0 dead transitions in 196089ms
Finished structural reductions in LTL mode , in 1 iterations and 199636 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 84 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 2381 ms.
Entered a terminal (fully accepting) state of product in 15218 steps with 0 reset in 348 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-05 finished in 202530 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 49 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2024-06-01 08:32:31] [INFO ] Invariant cache hit.
[2024-06-01 08:32:34] [INFO ] Implicit Places using invariants in 3220 ms returned []
Implicit Place search using SMT only with invariants took 3221 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-06-01 08:32:35] [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 30688 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 30445 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 190891ms 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 194439 ms. Remains : 16201/16201 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 123 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 194623 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 13 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 46 ms. Remains 3 /16201 variables (removed 16198) and now considering 5/32200 (removed 32195) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-06-01 08:35:46] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:35:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 08:35:46] [INFO ] Invariant cache hit.
[2024-06-01 08:35:46] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 08:35:46] [INFO ] Redundant transitions in 1 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 08:35:46] [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 27 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 28 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
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 147 ms. Remains : 3/16201 places, 5/32200 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLCardinality-07
Product exploration explored 100000 steps with 9028 reset in 90 ms.
Product exploration explored 100000 steps with 9165 reset in 80 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 152 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 6 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 192 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 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 0 ms. Remains 3 /3 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 08:35:47] [INFO ] Invariant cache hit.
[2024-06-01 08:35:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:35:47] [INFO ] Invariant cache hit.
[2024-06-01 08:35:47] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 08:35:47] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 08:35:47] [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 25 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
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 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 73 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 204 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9216 reset in 71 ms.
Product exploration explored 100000 steps with 9028 reset in 66 ms.
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-06-01 08:35:48] [INFO ] Invariant cache hit.
[2024-06-01 08:35:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 08:35:48] [INFO ] Invariant cache hit.
[2024-06-01 08:35:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 08:35:48] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 08:35:48] [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 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]
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 42 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 70ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 3/3 places, 5/5 transitions.
Treatment of property ServersAndClients-PT-100160-LTLCardinality-07 finished in 3306 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 14 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 42 ms. Remains 2 /16201 variables (removed 16199) and now considering 3/32200 (removed 32197) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 08:35:49] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:35:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 08:35:49] [INFO ] Invariant cache hit.
[2024-06-01 08:35:49] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-06-01 08:35:49] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:35:49] [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 17 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 24 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 42ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 42ms
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 128 ms. Remains : 2/16201 places, 3/32200 transitions.
Stuttering acceptance computed with spot in 39 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 0 ms.
FORMULA ServersAndClients-PT-100160-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLCardinality-08 finished in 194 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 45 ms. Remains 16201 /16201 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16201 cols
[2024-06-01 08:35:57] [INFO ] Computed 1 invariants in 8090 ms
[2024-06-01 08:36:01] [INFO ] Implicit Places using invariants in 11297 ms returned []
Implicit Place search using SMT only with invariants took 11300 ms to find 0 implicit places.
Running 32100 sub problems to find dead transitions.
[2024-06-01 08:36:01] [INFO ] Invariant cache hit.
FORMULA ServersAndClients-PT-100160-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ServersAndClients-PT-100160-LTLCardinality-07
FORMULA ServersAndClients-PT-100160-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ServersAndClients-PT-100160-LTLCardinality-12
FORMULA ServersAndClients-PT-100160-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100160-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ServersAndClients-PT-100160-LTLCardinality-15

BK_STOP 1717232725992

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ServersAndClients-PT-100160-LTLCardinality-00
ltl formula formula --ltl=/tmp/916/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_0_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.160 real 1.120 user 1.490 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 16562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32206 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 744
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 1048 transitions, fanout: 87.333
pnml2lts-mc( 0/ 4): Total exploration time 0.340 sec (0.330 sec minimum, 0.333 sec on average)
pnml2lts-mc( 0/ 4): States per second: 35, Transitions per second: 3082
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 70.3 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-01
ltl formula formula --ltl=/tmp/916/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_1_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.060 real 1.320 user 1.540 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 16562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32204 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2141
pnml2lts-mc( 0/ 4): unique transitions count: 5519
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2098
pnml2lts-mc( 0/ 4): - claim success count: 2147
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2147 states 6123 transitions, fanout: 2.852
pnml2lts-mc( 0/ 4): Total exploration time 43.170 sec (43.100 sec minimum, 43.130 sec on average)
pnml2lts-mc( 0/ 4): States per second: 50, Transitions per second: 142
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 65.0 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.2MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-02
ltl formula formula --ltl=/tmp/916/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.510 real 1.090 user 1.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32205 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 14
pnml2lts-mc( 0/ 4): unique transitions count: 948
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 1852 transitions, fanout: 92.600
pnml2lts-mc( 0/ 4): Total exploration time 0.560 sec (0.550 sec minimum, 0.558 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36, Transitions per second: 3307
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 68.8 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.1MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-03
ltl formula formula --ltl=/tmp/916/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.530 real 1.170 user 1.460 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32235 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~7!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 18
pnml2lts-mc( 0/ 4): unique transitions count: 1170
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 1574 transitions, fanout: 71.545
pnml2lts-mc( 0/ 4): Total exploration time 0.630 sec (0.580 sec minimum, 0.607 sec on average)
pnml2lts-mc( 0/ 4): States per second: 35, Transitions per second: 2498
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 54.1 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.1MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-04
ltl formula formula --ltl=/tmp/916/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_4_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.410 real 1.260 user 1.560 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32204 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~12!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8186
pnml2lts-mc( 0/ 4): unique transitions count: 17546
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 8082
pnml2lts-mc( 0/ 4): - claim success count: 8192
pnml2lts-mc( 0/ 4): - cum. max stack depth: 36
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8192 states 18150 transitions, fanout: 2.216
pnml2lts-mc( 0/ 4): Total exploration time 164.770 sec (164.720 sec minimum, 164.750 sec on average)
pnml2lts-mc( 0/ 4): States per second: 50, Transitions per second: 110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.6MB, 61.6 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.6MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-05
ltl formula formula --ltl=/tmp/916/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_5_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.490 real 1.190 user 1.310 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32206 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~12!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2383
pnml2lts-mc( 0/ 4): unique transitions count: 6019
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2335
pnml2lts-mc( 0/ 4): - claim success count: 2389
pnml2lts-mc( 0/ 4): - cum. max stack depth: 36
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2389 states 6623 transitions, fanout: 2.772
pnml2lts-mc( 0/ 4): Total exploration time 48.490 sec (48.400 sec minimum, 48.450 sec on average)
pnml2lts-mc( 0/ 4): States per second: 49, Transitions per second: 137
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 61.7 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.2MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-06
ltl formula formula --ltl=/tmp/916/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_6_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.490 real 1.260 user 1.340 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32216 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~7!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 22
pnml2lts-mc( 0/ 4): unique transitions count: 1492
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 2096 transitions, fanout: 74.857
pnml2lts-mc( 0/ 4): Total exploration time 0.620 sec (0.590 sec minimum, 0.603 sec on average)
pnml2lts-mc( 0/ 4): States per second: 45, Transitions per second: 3381
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 47.4 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.1MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-07
ltl formula formula --ltl=/tmp/916/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.540 real 1.160 user 1.220 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32203 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
ltl formula name ServersAndClients-PT-100160-LTLCardinality-08
ltl formula formula --ltl=/tmp/916/ltl_8_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_8_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.470 real 1.210 user 1.390 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 16562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32208 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 14
pnml2lts-mc( 0/ 4): unique transitions count: 948
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 1852 transitions, fanout: 92.600
pnml2lts-mc( 0/ 4): Total exploration time 0.430 sec (0.420 sec minimum, 0.423 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47, Transitions per second: 4307
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 71.6 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.1MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-09
ltl formula formula --ltl=/tmp/916/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.500 real 1.180 user 1.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32207 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~12!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2528
pnml2lts-mc( 0/ 4): unique transitions count: 6164
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2483
pnml2lts-mc( 0/ 4): - claim success count: 2534
pnml2lts-mc( 0/ 4): - cum. max stack depth: 36
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2534 states 6768 transitions, fanout: 2.671
pnml2lts-mc( 0/ 4): Total exploration time 51.990 sec (51.930 sec minimum, 51.968 sec on average)
pnml2lts-mc( 0/ 4): States per second: 49, Transitions per second: 130
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 62.0 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.2MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-10
ltl formula formula --ltl=/tmp/916/ltl_10_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.510 real 1.230 user 1.240 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32202 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 101
pnml2lts-mc( 0/ 4): unique states count: 101
pnml2lts-mc( 0/ 4): unique transitions count: 100
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 263
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 116 states 404 transitions, fanout: 3.483
pnml2lts-mc( 0/ 4): Total exploration time 2.410 sec (2.340 sec minimum, 2.383 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48, Transitions per second: 168
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 119.5 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-11
ltl formula formula --ltl=/tmp/916/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_11_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.510 real 1.140 user 1.430 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32204 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 14
pnml2lts-mc( 0/ 4): unique transitions count: 848
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 1452 transitions, fanout: 72.600
pnml2lts-mc( 0/ 4): Total exploration time 0.460 sec (0.430 sec minimum, 0.445 sec on average)
pnml2lts-mc( 0/ 4): States per second: 43, Transitions per second: 3157
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 74.1 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.1MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-12
ltl formula formula --ltl=/tmp/916/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_12_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.560 real 1.110 user 1.370 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32207 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
ltl formula name ServersAndClients-PT-100160-LTLCardinality-13
ltl formula formula --ltl=/tmp/916/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.400 real 1.270 user 1.290 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32208 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~7!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 22
pnml2lts-mc( 0/ 4): unique transitions count: 1492
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 2096 transitions, fanout: 74.857
pnml2lts-mc( 0/ 4): Total exploration time 0.710 sec (0.670 sec minimum, 0.688 sec on average)
pnml2lts-mc( 0/ 4): States per second: 39, Transitions per second: 2952
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 45.5 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.1MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-14
ltl formula formula --ltl=/tmp/916/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_14_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.580 real 1.100 user 1.370 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 16562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32212 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.090 sec minimum, 0.105 sec on average)
pnml2lts-mc( 0/ 4): States per second: 33, Transitions per second: 33
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 2968.0 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 33223 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ServersAndClients-PT-100160-LTLCardinality-15
ltl formula formula --ltl=/tmp/916/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16561 places, 32200 transitions and 96800 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/916/ltl_15_
pnml2lts-mc( 0/ 4): Loading Petri net took 5.360 real 1.340 user 1.390 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/916/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/916/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/916/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 16562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16562, there are 32208 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r524-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 ;