About the Execution of GreatSPN+red for DLCflexbar-PT-3a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
438.876 | 209726.00 | 265316.00 | 1136.30 | FFFFTFFTTFFFTTTT | 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.r113-smll-171624274100019.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DLCflexbar-PT-3a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274100019
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 22:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 996K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-00
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-01
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-02
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-03
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-04
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-05
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-06
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-07
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-08
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-09
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-10
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-11
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-12
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-13
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-14
FORMULA_NAME DLCflexbar-PT-3a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716298833319
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-3a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:40:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:40:36] [INFO ] Load time of PNML (sax parser for PT used): 562 ms
[2024-05-21 13:40:36] [INFO ] Transformed 581 places.
[2024-05-21 13:40:36] [INFO ] Transformed 3891 transitions.
[2024-05-21 13:40:36] [INFO ] Found NUPN structural information;
[2024-05-21 13:40:36] [INFO ] Parsed PT model containing 581 places and 3891 transitions and 14956 arcs in 804 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 455 transitions
Reduce redundant transitions removed 455 transitions.
FORMULA DLCflexbar-PT-3a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 3436/3436 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 511 transition count 2716
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 511 transition count 2716
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 170 place count 511 transition count 2686
Drop transitions (Redundant composition of simpler transitions.) removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 1 with 810 rules applied. Total rules applied 980 place count 511 transition count 1876
Applied a total of 980 rules in 339 ms. Remains 511 /581 variables (removed 70) and now considering 1876/3436 (removed 1560) transitions.
[2024-05-21 13:40:36] [INFO ] Flow matrix only has 282 transitions (discarded 1594 similar events)
// Phase 1: matrix 282 rows 511 cols
[2024-05-21 13:40:37] [INFO ] Computed 355 invariants in 37 ms
[2024-05-21 13:40:40] [INFO ] Implicit Places using invariants in 3372 ms returned [192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 334, 335, 336, 337, 338, 339, 340, 341, 342, 344, 345, 346, 347, 348, 349, 350, 351, 352, 354, 355, 356, 357, 358, 359, 360, 361, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 454, 455, 456, 457, 458, 459, 461, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 508, 509, 510]
Discarding 304 places :
Ensure Unique test removed 1439 transitions
Reduce isomorphic transitions removed 1439 transitions.
Implicit Place search using SMT only with invariants took 3433 ms to find 304 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 207/581 places, 437/3436 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 207 transition count 361
Applied a total of 76 rules in 14 ms. Remains 207 /207 variables (removed 0) and now considering 361/437 (removed 76) transitions.
[2024-05-21 13:40:40] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 207 cols
[2024-05-21 13:40:40] [INFO ] Computed 51 invariants in 32 ms
[2024-05-21 13:40:40] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 13:40:40] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:40:40] [INFO ] Invariant cache hit.
[2024-05-21 13:40:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:40:40] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 207/581 places, 361/3436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4344 ms. Remains : 207/581 places, 361/3436 transitions.
Support contains 22 out of 207 places after structural reductions.
[2024-05-21 13:40:41] [INFO ] Flatten gal took : 141 ms
[2024-05-21 13:40:41] [INFO ] Flatten gal took : 39 ms
[2024-05-21 13:40:41] [INFO ] Input system was already deterministic with 361 transitions.
RANDOM walk for 40000 steps (8 resets) in 2355 ms. (16 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
[2024-05-21 13:40:42] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:40:42] [INFO ] Invariant cache hit.
[2024-05-21 13:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/20 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 187/207 variables, 39/51 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 281/488 variables, 207/258 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/258 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/489 variables, 1/259 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/489 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 259 constraints, problems are : Problem set: 2 solved, 4 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Int declared 16/489 variables, and 8 constraints, problems are : Problem set: 6 solved, 0 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 8/51 constraints, State Equation: 0/207 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 719ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
FORMULA DLCflexbar-PT-3a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 1 stable transitions
Graph (complete) has 411 edges and 207 vertex of which 191 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.7 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 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 361/361 transitions.
Graph (trivial) has 358 edges and 207 vertex of which 189 / 207 are part of one of the 35 SCC in 4 ms
Free SCC test removed 154 places
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Graph (complete) has 88 edges and 53 vertex of which 38 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 35 place count 5 transition count 5
Iterating global reduction 0 with 33 rules applied. Total rules applied 68 place count 5 transition count 5
Applied a total of 68 rules in 21 ms. Remains 5 /207 variables (removed 202) and now considering 5/361 (removed 356) transitions.
[2024-05-21 13:40:43] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 5 cols
[2024-05-21 13:40:43] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 13:40:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 13:40:43] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
[2024-05-21 13:40:43] [INFO ] Invariant cache hit.
[2024-05-21 13:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:40:43] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-21 13:40:43] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-21 13:40:43] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
[2024-05-21 13:40:43] [INFO ] Invariant cache hit.
[2024-05-21 13:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 243ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/207 places, 5/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 5/207 places, 5/361 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCflexbar-PT-3a-LTLCardinality-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA DLCflexbar-PT-3a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3a-LTLCardinality-02 finished in 835 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 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 361/361 transitions.
Graph (trivial) has 354 edges and 207 vertex of which 185 / 207 are part of one of the 34 SCC in 1 ms
Free SCC test removed 151 places
Ensure Unique test removed 317 transitions
Reduce isomorphic transitions removed 317 transitions.
Graph (complete) has 94 edges and 56 vertex of which 41 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 42
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 39 transition count 41
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 40 place count 6 transition count 8
Iterating global reduction 2 with 33 rules applied. Total rules applied 73 place count 6 transition count 8
Applied a total of 73 rules in 17 ms. Remains 6 /207 variables (removed 201) and now considering 8/361 (removed 353) transitions.
[2024-05-21 13:40:44] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 6 cols
[2024-05-21 13:40:44] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 13:40:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 13:40:44] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-21 13:40:44] [INFO ] Invariant cache hit.
[2024-05-21 13:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:40:44] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-21 13:40:44] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-21 13:40:44] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-21 13:40:44] [INFO ] Invariant cache hit.
[2024-05-21 13:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 7 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/12 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/207 places, 8/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 523 ms. Remains : 6/207 places, 8/361 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DLCflexbar-PT-3a-LTLCardinality-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DLCflexbar-PT-3a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3a-LTLCardinality-06 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1||G(!p0))))))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 361/361 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 192 transition count 361
Applied a total of 15 rules in 11 ms. Remains 192 /207 variables (removed 15) and now considering 361/361 (removed 0) transitions.
[2024-05-21 13:40:45] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 192 cols
[2024-05-21 13:40:45] [INFO ] Computed 36 invariants in 2 ms
[2024-05-21 13:40:45] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 13:40:45] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:40:45] [INFO ] Invariant cache hit.
[2024-05-21 13:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:40:45] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-21 13:40:45] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:40:45] [INFO ] Invariant cache hit.
[2024-05-21 13:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 229 constraints, problems are : Problem set: 0 solved, 360 unsolved in 25631 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 360/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 589 constraints, problems are : Problem set: 0 solved, 360 unsolved in 21435 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 47313ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 47334ms
Starting structural reductions in LTL mode, iteration 1 : 192/207 places, 361/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47842 ms. Remains : 192/207 places, 361/361 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, false, (AND p0 (NOT p1)), p0, (NOT p0), false, false]
Running random walk in product with property : DLCflexbar-PT-3a-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 1037 ms.
Product exploration explored 100000 steps with 0 reset in 837 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 396 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/192 stabilizing places and 1/361 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 358 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 112 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-21 13:41:36] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:41:36] [INFO ] Invariant cache hit.
[2024-05-21 13:41:36] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-05-21 13:41:36] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-21 13:41:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:41:36] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2024-05-21 13:41:36] [INFO ] Computed and/alt/rep : 280/580/280 causal constraints (skipped 1 transitions) in 31 ms.
[2024-05-21 13:41:36] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 361/361 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-05-21 13:41:36] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:41:36] [INFO ] Invariant cache hit.
[2024-05-21 13:41:36] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 13:41:36] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:41:36] [INFO ] Invariant cache hit.
[2024-05-21 13:41:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:41:37] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-21 13:41:37] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:41:37] [INFO ] Invariant cache hit.
[2024-05-21 13:41:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 229 constraints, problems are : Problem set: 0 solved, 360 unsolved in 23957 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 360/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 589 constraints, problems are : Problem set: 0 solved, 360 unsolved in 21560 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 45628ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 45634ms
Finished structural reductions in LTL mode , in 1 iterations and 46244 ms. Remains : 192/192 places, 361/361 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 396 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/192 stabilizing places and 1/361 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1196 steps (0 resets) in 17 ms. (66 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-21 13:42:24] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:42:24] [INFO ] Invariant cache hit.
[2024-05-21 13:42:24] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-21 13:42:24] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-21 13:42:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:42:24] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-21 13:42:24] [INFO ] Computed and/alt/rep : 280/580/280 causal constraints (skipped 1 transitions) in 31 ms.
[2024-05-21 13:42:24] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 158 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 536 ms.
Product exploration explored 100000 steps with 0 reset in 631 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 165 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 361/361 transitions.
Graph (trivial) has 358 edges and 192 vertex of which 189 / 192 are part of one of the 35 SCC in 1 ms
Free SCC test removed 154 places
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 5 transition count 5
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 5 transition count 5
Applied a total of 67 rules in 7 ms. Remains 5 /192 variables (removed 187) and now considering 5/361 (removed 356) transitions.
[2024-05-21 13:42:26] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-21 13:42:26] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 5 cols
[2024-05-21 13:42:26] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 13:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/192 places, 5/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 5/192 places, 5/361 transitions.
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 361/361 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-05-21 13:42:26] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 192 cols
[2024-05-21 13:42:26] [INFO ] Computed 36 invariants in 2 ms
[2024-05-21 13:42:26] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 13:42:26] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:42:26] [INFO ] Invariant cache hit.
[2024-05-21 13:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:42:26] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-21 13:42:26] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:42:26] [INFO ] Invariant cache hit.
[2024-05-21 13:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 229 constraints, problems are : Problem set: 0 solved, 360 unsolved in 25161 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 360/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 589 constraints, problems are : Problem set: 0 solved, 360 unsolved in 21467 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 46739ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 46744ms
Finished structural reductions in LTL mode , in 1 iterations and 47204 ms. Remains : 192/192 places, 361/361 transitions.
Treatment of property DLCflexbar-PT-3a-LTLCardinality-08 finished in 148700 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 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 361/361 transitions.
Graph (trivial) has 358 edges and 207 vertex of which 188 / 207 are part of one of the 35 SCC in 1 ms
Free SCC test removed 153 places
Ensure Unique test removed 322 transitions
Reduce isomorphic transitions removed 322 transitions.
Graph (complete) has 89 edges and 54 vertex of which 39 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 38 transition count 38
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 37 place count 5 transition count 5
Iterating global reduction 2 with 33 rules applied. Total rules applied 70 place count 5 transition count 5
Applied a total of 70 rules in 25 ms. Remains 5 /207 variables (removed 202) and now considering 5/361 (removed 356) transitions.
[2024-05-21 13:43:13] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 5 cols
[2024-05-21 13:43:13] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 13:43:13] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 13:43:13] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
[2024-05-21 13:43:13] [INFO ] Invariant cache hit.
[2024-05-21 13:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:43:13] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-21 13:43:14] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-21 13:43:14] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
[2024-05-21 13:43:14] [INFO ] Invariant cache hit.
[2024-05-21 13:43:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 257ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/207 places, 5/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 473 ms. Remains : 5/207 places, 5/361 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCflexbar-PT-3a-LTLCardinality-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCflexbar-PT-3a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3a-LTLCardinality-10 finished in 572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 361/361 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 192 transition count 361
Applied a total of 15 rules in 3 ms. Remains 192 /207 variables (removed 15) and now considering 361/361 (removed 0) transitions.
[2024-05-21 13:43:14] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 192 cols
[2024-05-21 13:43:14] [INFO ] Computed 36 invariants in 2 ms
[2024-05-21 13:43:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 13:43:14] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:43:14] [INFO ] Invariant cache hit.
[2024-05-21 13:43:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:43:14] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-21 13:43:14] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:43:14] [INFO ] Invariant cache hit.
[2024-05-21 13:43:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 229 constraints, problems are : Problem set: 0 solved, 360 unsolved in 23839 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 360/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 589 constraints, problems are : Problem set: 0 solved, 360 unsolved in 21400 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 45296ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 45301ms
Starting structural reductions in LTL mode, iteration 1 : 192/207 places, 361/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45546 ms. Remains : 192/207 places, 361/361 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCflexbar-PT-3a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 726 ms.
Product exploration explored 100000 steps with 50000 reset in 637 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 396 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCflexbar-PT-3a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCflexbar-PT-3a-LTLCardinality-13 finished in 47046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1||G(!p0))))))'
[2024-05-21 13:44:01] [INFO ] Flatten gal took : 25 ms
[2024-05-21 13:44:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 13:44:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 207 places, 361 transitions and 772 arcs took 9 ms.
Total runtime 206334 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DLCflexbar-PT-3a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 207
TRANSITIONS: 361
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.001s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.001s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 959
MODEL NAME: /home/mcc/execution/413/model
207 places, 361 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DLCflexbar-PT-3a-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716299043045
--------------------
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
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="DLCflexbar-PT-3a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DLCflexbar-PT-3a, 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 r113-smll-171624274100019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCflexbar-PT-3a.tgz
mv DLCflexbar-PT-3a 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 '
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 ;