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.r484-smll-171624275600260.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 DLCround-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275600260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.1K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 18:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Apr 13 18:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 17:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 13 17:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 871K 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 DLCround-PT-12a-LTLFireability-00
FORMULA_NAME DLCround-PT-12a-LTLFireability-01
FORMULA_NAME DLCround-PT-12a-LTLFireability-02
FORMULA_NAME DLCround-PT-12a-LTLFireability-03
FORMULA_NAME DLCround-PT-12a-LTLFireability-04
FORMULA_NAME DLCround-PT-12a-LTLFireability-05
FORMULA_NAME DLCround-PT-12a-LTLFireability-06
FORMULA_NAME DLCround-PT-12a-LTLFireability-07
FORMULA_NAME DLCround-PT-12a-LTLFireability-08
FORMULA_NAME DLCround-PT-12a-LTLFireability-09
FORMULA_NAME DLCround-PT-12a-LTLFireability-10
FORMULA_NAME DLCround-PT-12a-LTLFireability-11
FORMULA_NAME DLCround-PT-12a-LTLFireability-12
FORMULA_NAME DLCround-PT-12a-LTLFireability-13
FORMULA_NAME DLCround-PT-12a-LTLFireability-14
FORMULA_NAME DLCround-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717233799988

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-12a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:23:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:23:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:23:23] [INFO ] Load time of PNML (sax parser for PT used): 579 ms
[2024-06-01 09:23:23] [INFO ] Transformed 419 places.
[2024-06-01 09:23:23] [INFO ] Transformed 3407 transitions.
[2024-06-01 09:23:23] [INFO ] Found NUPN structural information;
[2024-06-01 09:23:23] [INFO ] Parsed PT model containing 419 places and 3407 transitions and 13330 arcs in 979 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 315 transitions
Reduce redundant transitions removed 315 transitions.
FORMULA DLCround-PT-12a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 419 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 3092/3092 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 391 transition count 2616
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 391 transition count 2616
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 391 transition count 2612
Drop transitions (Redundant composition of simpler transitions.) removed 808 transitions
Redundant transition composition rules discarded 808 transitions
Iterating global reduction 1 with 808 rules applied. Total rules applied 868 place count 391 transition count 1804
Applied a total of 868 rules in 323 ms. Remains 391 /419 variables (removed 28) and now considering 1804/3092 (removed 1288) transitions.
[2024-06-01 09:23:24] [INFO ] Flow matrix only has 218 transitions (discarded 1586 similar events)
// Phase 1: matrix 218 rows 391 cols
[2024-06-01 09:23:24] [INFO ] Computed 277 invariants in 36 ms
[2024-06-01 09:23:27] [INFO ] Implicit Places using invariants in 2689 ms returned [131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 147, 148, 149, 151, 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, 181, 182, 183, 185, 187, 188, 189, 190, 191, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 217, 218, 219, 220, 221, 223, 224, 225, 227, 228, 229, 230, 231, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 260, 261, 262, 263, 264, 265, 266, 268, 270, 271, 272, 273, 274, 275, 277, 279, 280, 282, 283, 284, 285, 286, 287, 288, 289, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 302, 303, 304, 305, 306, 307, 308, 309, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 333, 334, 335, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 349, 350, 351, 353, 354, 355, 356, 357, 358, 360, 361, 362, 363, 364, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390]
Discarding 230 places :
Ensure Unique test removed 1314 transitions
Reduce isomorphic transitions removed 1314 transitions.
Implicit Place search using SMT only with invariants took 2764 ms to find 230 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/419 places, 490/3092 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 207 transitions
Redundant transition composition rules discarded 207 transitions
Iterating global reduction 0 with 207 rules applied. Total rules applied 207 place count 161 transition count 283
Applied a total of 207 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 283/490 (removed 207) transitions.
[2024-06-01 09:23:27] [INFO ] Flow matrix only has 218 transitions (discarded 65 similar events)
// Phase 1: matrix 218 rows 161 cols
[2024-06-01 09:23:27] [INFO ] Computed 47 invariants in 3 ms
[2024-06-01 09:23:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 09:23:27] [INFO ] Flow matrix only has 218 transitions (discarded 65 similar events)
[2024-06-01 09:23:27] [INFO ] Invariant cache hit.
[2024-06-01 09:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:23:27] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/419 places, 283/3092 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3461 ms. Remains : 161/419 places, 283/3092 transitions.
Support contains 61 out of 161 places after structural reductions.
[2024-06-01 09:23:27] [INFO ] Flatten gal took : 68 ms
[2024-06-01 09:23:27] [INFO ] Flatten gal took : 31 ms
[2024-06-01 09:23:27] [INFO ] Input system was already deterministic with 283 transitions.
Support contains 59 out of 161 places (down from 61) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 3540 steps (0 resets) in 581 ms. (6 steps per ms) remains 0/32 properties
FORMULA DLCround-PT-12a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 31 stabilizing places and 1 stable transitions
Graph (complete) has 329 edges and 161 vertex of which 131 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.4 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)&&F(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Graph (trivial) has 273 edges and 161 vertex of which 123 / 161 are part of one of the 16 SCC in 4 ms
Free SCC test removed 107 places
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Graph (complete) has 76 edges and 54 vertex of which 26 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 26 transition count 27
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 23 transition count 25
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 24 place count 9 transition count 11
Iterating global reduction 2 with 14 rules applied. Total rules applied 38 place count 9 transition count 11
Applied a total of 38 rules in 56 ms. Remains 9 /161 variables (removed 152) and now considering 11/283 (removed 272) transitions.
[2024-06-01 09:23:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 9 cols
[2024-06-01 09:23:28] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 09:23:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 09:23:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-06-01 09:23:28] [INFO ] Invariant cache hit.
[2024-06-01 09:23:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:23:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-06-01 09:23:28] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 09:23:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-06-01 09:23:28] [INFO ] Invariant cache hit.
[2024-06-01 09:23:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 7/16 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 15 constraints, problems are : Problem set: 0 solved, 10 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 7/16 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/17 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 25 constraints, problems are : Problem set: 0 solved, 10 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 638ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/161 places, 11/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 864 ms. Remains : 9/161 places, 11/283 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-12a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-00 finished in 1317 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)&&F(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Graph (trivial) has 275 edges and 161 vertex of which 124 / 161 are part of one of the 17 SCC in 1 ms
Free SCC test removed 107 places
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Graph (complete) has 77 edges and 54 vertex of which 26 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 30
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 18 place count 11 transition count 16
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 11 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 11 transition count 15
Applied a total of 33 rules in 11 ms. Remains 11 /161 variables (removed 150) and now considering 15/283 (removed 268) transitions.
[2024-06-01 09:23:29] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
// Phase 1: matrix 10 rows 11 cols
[2024-06-01 09:23:29] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 09:23:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 09:23:29] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2024-06-01 09:23:29] [INFO ] Invariant cache hit.
[2024-06-01 09:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:23:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 09:23:29] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-06-01 09:23:29] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2024-06-01 09:23:29] [INFO ] Invariant cache hit.
[2024-06-01 09:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 17 constraints, problems are : Problem set: 0 solved, 14 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 31 constraints, problems are : Problem set: 0 solved, 14 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 633ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 634ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/161 places, 15/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 720 ms. Remains : 11/161 places, 15/283 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-02 finished in 926 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' '!((!p0 U (X(((!F(p1)||p0) U p2)) U p2)))'
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Graph (trivial) has 275 edges and 161 vertex of which 125 / 161 are part of one of the 17 SCC in 2 ms
Free SCC test removed 108 places
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Graph (complete) has 74 edges and 53 vertex of which 26 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 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 26 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 27
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 17 place count 12 transition count 14
Iterating global reduction 2 with 13 rules applied. Total rules applied 30 place count 12 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 12 transition count 13
Applied a total of 31 rules in 9 ms. Remains 12 /161 variables (removed 149) and now considering 13/283 (removed 270) transitions.
[2024-06-01 09:23:30] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
// Phase 1: matrix 9 rows 12 cols
[2024-06-01 09:23:30] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 09:23:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 09:23:30] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
[2024-06-01 09:23:30] [INFO ] Invariant cache hit.
[2024-06-01 09:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:23:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 09:23:30] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-06-01 09:23:30] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
[2024-06-01 09:23:30] [INFO ] Invariant cache hit.
[2024-06-01 09:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 32 constraints, problems are : Problem set: 0 solved, 12 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 585ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/161 places, 13/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 678 ms. Remains : 12/161 places, 13/283 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p2), true, p1]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-04 finished in 897 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((p0||(G((p2||X(G(p3))))&&p1))))'
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 134 transition count 283
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 128 transition count 271
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 128 transition count 271
Applied a total of 39 rules in 11 ms. Remains 128 /161 variables (removed 33) and now considering 271/283 (removed 12) transitions.
[2024-06-01 09:23:31] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 128 cols
[2024-06-01 09:23:31] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 09:23:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 09:23:31] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2024-06-01 09:23:31] [INFO ] Invariant cache hit.
[2024-06-01 09:23:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:23:32] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-01 09:23:32] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2024-06-01 09:23:32] [INFO ] Invariant cache hit.
[2024-06-01 09:23:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 3/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 211/339 variables, 128/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/340 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 149 constraints, problems are : Problem set: 0 solved, 270 unsolved in 19965 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 3/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 211/339 variables, 128/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 270/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 419 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15770 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 35861ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 35883ms
Starting structural reductions in LTL mode, iteration 1 : 128/161 places, 271/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36159 ms. Remains : 128/161 places, 271/283 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-05 finished in 36511 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((p0 U (X(p2)&&p1)))&&G(p3))))'
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 134 transition count 283
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 129 transition count 273
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 129 transition count 273
Applied a total of 37 rules in 13 ms. Remains 129 /161 variables (removed 32) and now considering 273/283 (removed 10) transitions.
[2024-06-01 09:24:08] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
// Phase 1: matrix 213 rows 129 cols
[2024-06-01 09:24:08] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 09:24:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 09:24:08] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:24:08] [INFO ] Invariant cache hit.
[2024-06-01 09:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:24:08] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-01 09:24:08] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:24:08] [INFO ] Invariant cache hit.
[2024-06-01 09:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/341 variables, 129/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 150 constraints, problems are : Problem set: 0 solved, 272 unsolved in 19899 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/341 variables, 129/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 272/421 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/342 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 422 constraints, problems are : Problem set: 0 solved, 272 unsolved in 15496 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 35499ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 35508ms
Starting structural reductions in LTL mode, iteration 1 : 129/161 places, 273/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35780 ms. Remains : 129/161 places, 273/283 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p3) (NOT p1) (NOT p2)), true]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-07 finished in 36268 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 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 132 transition count 283
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 126 transition count 271
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 126 transition count 271
Applied a total of 41 rules in 7 ms. Remains 126 /161 variables (removed 35) and now considering 271/283 (removed 12) transitions.
[2024-06-01 09:24:44] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 126 cols
[2024-06-01 09:24:44] [INFO ] Computed 18 invariants in 4 ms
[2024-06-01 09:24:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 09:24:44] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2024-06-01 09:24:44] [INFO ] Invariant cache hit.
[2024-06-01 09:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:24:44] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-01 09:24:44] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2024-06-01 09:24:44] [INFO ] Invariant cache hit.
[2024-06-01 09:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 211/337 variables, 126/144 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/338 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/338 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 145 constraints, problems are : Problem set: 0 solved, 270 unsolved in 19589 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 211/337 variables, 126/144 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 270/414 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/338 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/338 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 415 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 34699ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 34706ms
Starting structural reductions in LTL mode, iteration 1 : 126/161 places, 271/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34953 ms. Remains : 126/161 places, 271/283 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-08 finished in 35110 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(((p0 U p1)&&X(p2))))'
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 134 transition count 283
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 129 transition count 273
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 129 transition count 273
Applied a total of 37 rules in 5 ms. Remains 129 /161 variables (removed 32) and now considering 273/283 (removed 10) transitions.
[2024-06-01 09:25:19] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
// Phase 1: matrix 213 rows 129 cols
[2024-06-01 09:25:19] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 09:25:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 09:25:19] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:25:19] [INFO ] Invariant cache hit.
[2024-06-01 09:25:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:25:19] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-01 09:25:19] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:25:19] [INFO ] Invariant cache hit.
[2024-06-01 09:25:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/341 variables, 129/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 150 constraints, problems are : Problem set: 0 solved, 272 unsolved in 19141 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 3/129 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/341 variables, 129/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 272/421 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/342 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 422 constraints, problems are : Problem set: 0 solved, 272 unsolved in 13997 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 33201ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 33208ms
Starting structural reductions in LTL mode, iteration 1 : 129/161 places, 273/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33457 ms. Remains : 129/161 places, 273/283 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-09 finished in 33635 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||(p1 U p2))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 133 transition count 283
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 128 transition count 273
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 128 transition count 273
Applied a total of 38 rules in 6 ms. Remains 128 /161 variables (removed 33) and now considering 273/283 (removed 10) transitions.
[2024-06-01 09:25:53] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
// Phase 1: matrix 213 rows 128 cols
[2024-06-01 09:25:53] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 09:25:53] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 09:25:53] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:25:53] [INFO ] Invariant cache hit.
[2024-06-01 09:25:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:25:53] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-01 09:25:53] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:25:53] [INFO ] Invariant cache hit.
[2024-06-01 09:25:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/340 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/341 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 148 constraints, problems are : Problem set: 0 solved, 272 unsolved in 19869 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/340 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 272/419 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/341 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 420 constraints, problems are : Problem set: 0 solved, 272 unsolved in 15512 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 35445ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 35452ms
Starting structural reductions in LTL mode, iteration 1 : 128/161 places, 273/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35683 ms. Remains : 128/161 places, 273/283 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-11 finished in 35891 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 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 132 transition count 283
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 126 transition count 271
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 126 transition count 271
Applied a total of 41 rules in 4 ms. Remains 126 /161 variables (removed 35) and now considering 271/283 (removed 12) transitions.
[2024-06-01 09:26:29] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 126 cols
[2024-06-01 09:26:29] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 09:26:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 09:26:29] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2024-06-01 09:26:29] [INFO ] Invariant cache hit.
[2024-06-01 09:26:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:26:29] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-01 09:26:29] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2024-06-01 09:26:29] [INFO ] Invariant cache hit.
[2024-06-01 09:26:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 211/337 variables, 126/144 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/338 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/338 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 145 constraints, problems are : Problem set: 0 solved, 270 unsolved in 19843 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 211/337 variables, 126/144 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 270/414 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/338 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/338 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 415 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15100 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 35003ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 35009ms
Starting structural reductions in LTL mode, iteration 1 : 126/161 places, 271/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35265 ms. Remains : 126/161 places, 271/283 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-12a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-12 finished in 35367 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' '!((((p0||F(p1)) U (p1||G(p0)))&&X(X(G(p2)))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 133 transition count 283
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 128 transition count 273
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 128 transition count 273
Applied a total of 38 rules in 5 ms. Remains 128 /161 variables (removed 33) and now considering 273/283 (removed 10) transitions.
[2024-06-01 09:27:04] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
// Phase 1: matrix 213 rows 128 cols
[2024-06-01 09:27:04] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:27:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 09:27:04] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:27:04] [INFO ] Invariant cache hit.
[2024-06-01 09:27:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:27:04] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-01 09:27:04] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:27:04] [INFO ] Invariant cache hit.
[2024-06-01 09:27:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/340 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/341 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 148 constraints, problems are : Problem set: 0 solved, 272 unsolved in 19747 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/340 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 272/419 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/341 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 420 constraints, problems are : Problem set: 0 solved, 272 unsolved in 13964 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 33756ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 33761ms
Starting structural reductions in LTL mode, iteration 1 : 128/161 places, 273/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33955 ms. Remains : 128/161 places, 273/283 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), true]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-13 finished in 34244 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(((F(p0) U p1) U (G((F(p0) U p1))||(!p2&&(F(p0) U p1))))))'
Support contains 7 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Graph (trivial) has 261 edges and 161 vertex of which 115 / 161 are part of one of the 16 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 234 transitions.
Graph (complete) has 95 edges and 62 vertex of which 35 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 35 transition count 48
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 34 transition count 45
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 31 transition count 44
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 24 place count 18 transition count 30
Iterating global reduction 3 with 13 rules applied. Total rules applied 37 place count 18 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 18 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 18 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 18 transition count 27
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 17 transition count 26
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 17 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 17 transition count 25
Applied a total of 44 rules in 21 ms. Remains 17 /161 variables (removed 144) and now considering 25/283 (removed 258) transitions.
[2024-06-01 09:27:38] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
// Phase 1: matrix 17 rows 17 cols
[2024-06-01 09:27:38] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 09:27:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 09:27:38] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
[2024-06-01 09:27:38] [INFO ] Invariant cache hit.
[2024-06-01 09:27:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:27:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 09:27:38] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 09:27:38] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
[2024-06-01 09:27:38] [INFO ] Invariant cache hit.
[2024-06-01 09:27:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 16/33 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 26 constraints, problems are : Problem set: 0 solved, 24 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 16/33 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 50 constraints, problems are : Problem set: 0 solved, 24 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 1114ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1116ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/161 places, 25/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1227 ms. Remains : 17/161 places, 25/283 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 567 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Computed a total of 5 stabilizing places and 1 stable transitions
Graph (complete) has 32 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 184 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-12a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-12a-LTLFireability-14 finished in 2504 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&&G((F(p1)&&F(G(p2))))))))'
Support contains 8 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 283/283 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 135 transition count 283
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 130 transition count 273
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 130 transition count 273
Applied a total of 36 rules in 5 ms. Remains 130 /161 variables (removed 31) and now considering 273/283 (removed 10) transitions.
[2024-06-01 09:27:41] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
// Phase 1: matrix 213 rows 130 cols
[2024-06-01 09:27:41] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 09:27:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 09:27:41] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:27:41] [INFO ] Invariant cache hit.
[2024-06-01 09:27:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:27:41] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-01 09:27:41] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2024-06-01 09:27:41] [INFO ] Invariant cache hit.
[2024-06-01 09:27:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 4/130 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/342 variables, 130/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 152 constraints, problems are : Problem set: 0 solved, 272 unsolved in 19610 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 4/130 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/342 variables, 130/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 272/423 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 424 constraints, problems are : Problem set: 0 solved, 272 unsolved in 16036 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 35704ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 35710ms
Starting structural reductions in LTL mode, iteration 1 : 130/161 places, 273/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35969 ms. Remains : 130/161 places, 273/283 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : DLCround-PT-12a-LTLFireability-15
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-12a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-12a-LTLFireability-15 finished in 36293 ms.
All properties solved by simple procedures.
Total runtime 295710 ms.
ITS solved all properties within timeout

BK_STOP 1717234097611

--------------------
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 LTLFireability -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="DLCround-PT-12a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DLCround-PT-12a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r484-smll-171624275600260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-12a.tgz
mv DLCround-PT-12a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;