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.r549-tall-171734897800092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CO4-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897800092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 177K Jun 2 16:33 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 CO4-PT-12-LTLFireability-00
FORMULA_NAME CO4-PT-12-LTLFireability-01
FORMULA_NAME CO4-PT-12-LTLFireability-02
FORMULA_NAME CO4-PT-12-LTLFireability-03
FORMULA_NAME CO4-PT-12-LTLFireability-04
FORMULA_NAME CO4-PT-12-LTLFireability-05
FORMULA_NAME CO4-PT-12-LTLFireability-06
FORMULA_NAME CO4-PT-12-LTLFireability-07
FORMULA_NAME CO4-PT-12-LTLFireability-08
FORMULA_NAME CO4-PT-12-LTLFireability-09
FORMULA_NAME CO4-PT-12-LTLFireability-10
FORMULA_NAME CO4-PT-12-LTLFireability-11
FORMULA_NAME CO4-PT-12-LTLFireability-12
FORMULA_NAME CO4-PT-12-LTLFireability-13
FORMULA_NAME CO4-PT-12-LTLFireability-14
FORMULA_NAME CO4-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717355189044

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:06:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:06:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:06:30] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-06-02 19:06:30] [INFO ] Transformed 649 places.
[2024-06-02 19:06:30] [INFO ] Transformed 782 transitions.
[2024-06-02 19:06:30] [INFO ] Found NUPN structural information;
[2024-06-02 19:06:30] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 17 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 101 place count 380 transition count 477
Iterating global reduction 1 with 81 rules applied. Total rules applied 182 place count 380 transition count 477
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 248 place count 314 transition count 393
Iterating global reduction 1 with 66 rules applied. Total rules applied 314 place count 314 transition count 393
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 319 place count 314 transition count 388
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 352 place count 281 transition count 355
Iterating global reduction 2 with 33 rules applied. Total rules applied 385 place count 281 transition count 355
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 406 place count 260 transition count 334
Iterating global reduction 2 with 21 rules applied. Total rules applied 427 place count 260 transition count 334
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 432 place count 260 transition count 329
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 438 place count 254 transition count 323
Iterating global reduction 3 with 6 rules applied. Total rules applied 444 place count 254 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 446 place count 252 transition count 321
Iterating global reduction 3 with 2 rules applied. Total rules applied 448 place count 252 transition count 321
Applied a total of 448 rules in 127 ms. Remains 252 /477 variables (removed 225) and now considering 321/563 (removed 242) transitions.
// Phase 1: matrix 321 rows 252 cols
[2024-06-02 19:06:30] [INFO ] Computed 6 invariants in 18 ms
[2024-06-02 19:06:31] [INFO ] Implicit Places using invariants in 239 ms returned [7, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 268 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 250/477 places, 321/563 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 418 ms. Remains : 250/477 places, 321/563 transitions.
Support contains 19 out of 250 places after structural reductions.
[2024-06-02 19:06:31] [INFO ] Flatten gal took : 51 ms
[2024-06-02 19:06:31] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:06:31] [INFO ] Input system was already deterministic with 321 transitions.
RANDOM walk for 40000 steps (244 resets) in 1771 ms. (22 steps per ms) remains 11/19 properties
BEST_FIRST walk for 40000 steps (53 resets) in 556 ms. (71 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40001 steps (159 resets) in 231 ms. (172 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40002 steps (188 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (189 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (156 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (249 resets) in 171 ms. (232 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (251 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (225 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (161 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
// Phase 1: matrix 321 rows 250 cols
[2024-06-02 19:06:32] [INFO ] Computed 4 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/41 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/125 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 199/324 variables, 76/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 175/499 variables, 87/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 61/560 variables, 39/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 13 (OVERLAPS) 10/570 variables, 6/253 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/571 variables, 1/254 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/571 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/571 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 254 constraints, problems are : Problem set: 1 solved, 5 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/39 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 19:06:33] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 79/118 variables, 39/44 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 189/307 variables, 72/116 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 5/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 173/480 variables, 84/205 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 65/545 variables, 41/246 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 16/561 variables, 8/254 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/561 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 9/570 variables, 5/259 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/571 variables, 1/260 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/571 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 260 constraints, problems are : Problem set: 1 solved, 5 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1231ms problems are : Problem set: 1 solved, 5 unsolved
Finished Parikh walk after 3102 steps, including 66 resets, run visited all 2 properties in 6 ms. (steps per millisecond=517 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 196 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA CO4-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 428 edges and 250 vertex of which 243 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 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||X(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 241 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 241 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 241 transition count 309
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 238 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 238 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 238 transition count 305
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 236 transition count 303
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 236 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 235 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 235 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 235 transition count 301
Applied a total of 34 rules in 24 ms. Remains 235 /250 variables (removed 15) and now considering 301/321 (removed 20) transitions.
// Phase 1: matrix 301 rows 235 cols
[2024-06-02 19:06:34] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:06:34] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 19:06:34] [INFO ] Invariant cache hit.
[2024-06-02 19:06:34] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-02 19:06:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 19:06:37] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-06-02 19:06:37] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/536 variables, 235/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/536 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 241 constraints, problems are : Problem set: 0 solved, 300 unsolved in 12458 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/536 variables, 235/241 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 300/541 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 19:06:51] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 19:06:58] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 543 constraints, problems are : Problem set: 0 solved, 300 unsolved in 28917 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints]
After SMT, in 41454ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 41459ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 301/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41703 ms. Remains : 235/250 places, 301/321 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 406 edges and 235 vertex of which 230 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.18 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 43 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-12-LTLFireability-00 finished in 42542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 263 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 240 transition count 216
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 190 place count 146 transition count 216
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 190 place count 146 transition count 195
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 232 place count 125 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 235 place count 122 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 238 place count 122 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 238 place count 122 transition count 190
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 120 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 243 place count 119 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 119 transition count 189
Performed 50 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 344 place count 69 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 348 place count 69 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 351 place count 66 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 354 place count 66 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 356 place count 65 transition count 114
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 384 place count 51 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 393 place count 51 transition count 108
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 404 place count 40 transition count 86
Iterating global reduction 4 with 11 rules applied. Total rules applied 415 place count 40 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 423 place count 40 transition count 78
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 426 place count 37 transition count 69
Iterating global reduction 5 with 3 rules applied. Total rules applied 429 place count 37 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 431 place count 37 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 433 place count 36 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 443 place count 36 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 445 place count 34 transition count 61
Applied a total of 445 rules in 55 ms. Remains 34 /250 variables (removed 216) and now considering 61/321 (removed 260) transitions.
[2024-06-02 19:07:17] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 19:07:17] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:07:17] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-02 19:07:17] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2024-06-02 19:07:17] [INFO ] Invariant cache hit.
[2024-06-02 19:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:07:17] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 19:07:17] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 19:07:17] [INFO ] Flow matrix only has 57 transitions (discarded 4 similar events)
[2024-06-02 19:07:17] [INFO ] Invariant cache hit.
[2024-06-02 19:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 56/90 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 39 constraints, problems are : Problem set: 0 solved, 46 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 56/90 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 46/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 85 constraints, problems are : Problem set: 0 solved, 46 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1381ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1382ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/250 places, 61/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1687 ms. Remains : 34/250 places, 61/321 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-01 finished in 1794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 242 transition count 312
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 242 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 242 transition count 310
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 239 transition count 307
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 239 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 239 transition count 306
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 237 transition count 304
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 237 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 236 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 236 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 236 transition count 302
Applied a total of 32 rules in 15 ms. Remains 236 /250 variables (removed 14) and now considering 302/321 (removed 19) transitions.
// Phase 1: matrix 302 rows 236 cols
[2024-06-02 19:07:18] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:07:18] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 19:07:18] [INFO ] Invariant cache hit.
[2024-06-02 19:07:19] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-06-02 19:07:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 19:07:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:07:21] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/538 variables, 236/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 0/538 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 242 constraints, problems are : Problem set: 0 solved, 301 unsolved in 12300 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/538 variables, 236/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 301/543 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 19:07:35] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-06-02 19:07:38] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 545 constraints, problems are : Problem set: 0 solved, 301 unsolved in 26732 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 4/4 constraints]
After SMT, in 39080ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 39084ms
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 302/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39320 ms. Remains : 236/250 places, 302/321 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-12-LTLFireability-03
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-03 finished in 39542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 240 transition count 219
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 184 place count 149 transition count 219
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 184 place count 149 transition count 198
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 226 place count 128 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 230 place count 124 transition count 193
Iterating global reduction 2 with 4 rules applied. Total rules applied 234 place count 124 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 236 place count 124 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 236 place count 124 transition count 189
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 122 transition count 189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 241 place count 121 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 121 transition count 188
Performed 49 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 340 place count 72 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 343 place count 72 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 346 place count 69 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 349 place count 69 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 68 transition count 117
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 379 place count 54 transition count 120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 387 place count 54 transition count 112
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 398 place count 43 transition count 90
Iterating global reduction 5 with 11 rules applied. Total rules applied 409 place count 43 transition count 90
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 416 place count 43 transition count 83
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 419 place count 40 transition count 74
Iterating global reduction 6 with 3 rules applied. Total rules applied 422 place count 40 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 424 place count 40 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 426 place count 39 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 435 place count 39 transition count 70
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 437 place count 39 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 439 place count 37 transition count 68
Applied a total of 439 rules in 40 ms. Remains 37 /250 variables (removed 213) and now considering 68/321 (removed 253) transitions.
[2024-06-02 19:07:58] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 37 cols
[2024-06-02 19:07:58] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:07:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 19:07:58] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 19:07:58] [INFO ] Invariant cache hit.
[2024-06-02 19:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:07:58] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-02 19:07:58] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 19:07:58] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 19:07:58] [INFO ] Invariant cache hit.
[2024-06-02 19:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 42 constraints, problems are : Problem set: 0 solved, 53 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 95 constraints, problems are : Problem set: 0 solved, 53 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1445ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1446ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/250 places, 68/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1578 ms. Remains : 37/250 places, 68/321 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-06
Product exploration explored 100000 steps with 5 reset in 142 ms.
Product exploration explored 100000 steps with 1 reset in 80 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25157 steps (3006 resets) in 268 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-02 19:08:00] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 19:08:00] [INFO ] Invariant cache hit.
[2024-06-02 19:08:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 19:08:00] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 19:08:00] [INFO ] Invariant cache hit.
[2024-06-02 19:08:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:08:00] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-02 19:08:00] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 19:08:00] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 19:08:00] [INFO ] Invariant cache hit.
[2024-06-02 19:08:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 42 constraints, problems are : Problem set: 0 solved, 53 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 95 constraints, problems are : Problem set: 0 solved, 53 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1431ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1431ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1529 ms. Remains : 37/37 places, 68/68 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4796 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (610 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 27950 steps, run visited all 1 properties in 53 ms. (steps per millisecond=527 )
Probabilistic random walk after 27950 steps, saw 6161 distinct states, run finished after 57 ms. (steps per millisecond=490 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14 reset in 34 ms.
Product exploration explored 100000 steps with 96 reset in 156 ms.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-02 19:08:03] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 19:08:03] [INFO ] Invariant cache hit.
[2024-06-02 19:08:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 19:08:03] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 19:08:03] [INFO ] Invariant cache hit.
[2024-06-02 19:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:08:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-02 19:08:03] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 19:08:03] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-06-02 19:08:03] [INFO ] Invariant cache hit.
[2024-06-02 19:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 42 constraints, problems are : Problem set: 0 solved, 53 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 63/100 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 95 constraints, problems are : Problem set: 0 solved, 53 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1440ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1441ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1537 ms. Remains : 37/37 places, 68/68 transitions.
Treatment of property CO4-PT-12-LTLFireability-06 finished in 6656 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(p0)||F(p1)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 242 transition count 219
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 189 place count 149 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 148 transition count 218
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 190 place count 148 transition count 197
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 232 place count 127 transition count 197
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 123 transition count 192
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 123 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 123 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 242 place count 123 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 246 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 120 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 120 transition count 187
Performed 49 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 346 place count 71 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 352 place count 71 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 355 place count 68 transition count 114
Iterating global reduction 5 with 3 rules applied. Total rules applied 358 place count 68 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 360 place count 67 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 388 place count 53 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 397 place count 53 transition count 107
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 408 place count 42 transition count 85
Iterating global reduction 6 with 11 rules applied. Total rules applied 419 place count 42 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 427 place count 42 transition count 77
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 430 place count 39 transition count 68
Iterating global reduction 7 with 3 rules applied. Total rules applied 433 place count 39 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 435 place count 39 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 437 place count 38 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 445 place count 38 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 447 place count 36 transition count 62
Applied a total of 447 rules in 28 ms. Remains 36 /250 variables (removed 214) and now considering 62/321 (removed 259) transitions.
[2024-06-02 19:08:05] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
// Phase 1: matrix 59 rows 36 cols
[2024-06-02 19:08:05] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 19:08:05] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 19:08:05] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
[2024-06-02 19:08:05] [INFO ] Invariant cache hit.
[2024-06-02 19:08:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:08:05] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 19:08:05] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-02 19:08:05] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
[2024-06-02 19:08:05] [INFO ] Invariant cache hit.
[2024-06-02 19:08:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 58/94 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/95 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 41 constraints, problems are : Problem set: 0 solved, 47 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 58/94 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 47/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/95 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 88 constraints, problems are : Problem set: 0 solved, 47 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1213ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1215ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/250 places, 62/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1324 ms. Remains : 36/250 places, 62/321 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-12-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-08 finished in 1415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p1)&&F(p2))))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 257 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 240 transition count 221
Reduce places removed 89 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 182 place count 151 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 184 place count 149 transition count 219
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 184 place count 149 transition count 198
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 226 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 229 place count 125 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 125 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 234 place count 125 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 234 place count 125 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 124 transition count 191
Performed 50 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 336 place count 74 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 339 place count 74 transition count 121
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 342 place count 71 transition count 118
Iterating global reduction 5 with 3 rules applied. Total rules applied 345 place count 71 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 347 place count 70 transition count 117
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 373 place count 57 transition count 120
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 381 place count 57 transition count 112
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 391 place count 47 transition count 92
Iterating global reduction 6 with 10 rules applied. Total rules applied 401 place count 47 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 407 place count 47 transition count 86
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 410 place count 44 transition count 77
Iterating global reduction 7 with 3 rules applied. Total rules applied 413 place count 44 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 415 place count 44 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 43 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 426 place count 43 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 428 place count 41 transition count 72
Applied a total of 428 rules in 41 ms. Remains 41 /250 variables (removed 209) and now considering 72/321 (removed 249) transitions.
[2024-06-02 19:08:06] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
// Phase 1: matrix 68 rows 41 cols
[2024-06-02 19:08:06] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:08:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 19:08:06] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 19:08:06] [INFO ] Invariant cache hit.
[2024-06-02 19:08:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:08:06] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-02 19:08:06] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-02 19:08:06] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 19:08:06] [INFO ] Invariant cache hit.
[2024-06-02 19:08:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 46 constraints, problems are : Problem set: 0 solved, 57 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 57/102 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 103 constraints, problems are : Problem set: 0 solved, 57 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1587ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1588ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/250 places, 72/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1723 ms. Remains : 41/250 places, 72/321 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-10
Product exploration explored 100000 steps with 75 reset in 152 ms.
Product exploration explored 100000 steps with 43 reset in 168 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 115 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (4834 resets) in 107 ms. (370 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (616 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2024-06-02 19:08:08] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 19:08:08] [INFO ] Invariant cache hit.
[2024-06-02 19:08:08] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/35 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/78 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/88 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/108 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/109 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 46 constraints, problems are : Problem set: 0 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/35 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/78 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/88 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 108/109 variables, and 46 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F p2)]
Knowledge based reduction with 16 factoid took 357 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-06-02 19:08:09] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 19:08:09] [INFO ] Invariant cache hit.
[2024-06-02 19:08:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 19:08:09] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 19:08:09] [INFO ] Invariant cache hit.
[2024-06-02 19:08:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:08:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-02 19:08:09] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-02 19:08:09] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-06-02 19:08:09] [INFO ] Invariant cache hit.
[2024-06-02 19:08:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 46 constraints, problems are : Problem set: 0 solved, 57 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 67/108 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 57/102 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 103 constraints, problems are : Problem set: 0 solved, 57 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1590ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1593ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1690 ms. Remains : 41/41 places, 72/72 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 9788 steps (1177 resets) in 25 ms. (376 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 9 factoid took 199 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 46 reset in 37 ms.
Product exploration explored 100000 steps with 6 reset in 37 ms.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 72/72 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 41 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 67
Applied a total of 8 rules in 4 ms. Remains 39 /41 variables (removed 2) and now considering 67/72 (removed 5) transitions.
[2024-06-02 19:08:12] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 39 cols
[2024-06-02 19:08:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:08:12] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 19:08:12] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-06-02 19:08:12] [INFO ] Invariant cache hit.
[2024-06-02 19:08:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:08:12] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-02 19:08:12] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-02 19:08:12] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-06-02 19:08:12] [INFO ] Invariant cache hit.
[2024-06-02 19:08:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 62/101 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 44 constraints, problems are : Problem set: 0 solved, 52 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 62/101 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 52/95 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 96 constraints, problems are : Problem set: 0 solved, 52 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1417ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1417ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/41 places, 67/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1513 ms. Remains : 39/41 places, 67/72 transitions.
Treatment of property CO4-PT-12-LTLFireability-10 finished in 7262 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))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Graph (trivial) has 261 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 248 vertex of which 241 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 240 transition count 218
Reduce places removed 92 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 148 transition count 216
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 146 transition count 216
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 190 place count 146 transition count 195
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 232 place count 125 transition count 195
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 121 transition count 190
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 121 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 121 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 242 place count 121 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 246 place count 119 transition count 186
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 118 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 118 transition count 185
Performed 49 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 346 place count 69 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 353 place count 69 transition count 115
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 356 place count 66 transition count 112
Iterating global reduction 5 with 3 rules applied. Total rules applied 359 place count 66 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 361 place count 65 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 389 place count 51 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 398 place count 51 transition count 105
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 409 place count 40 transition count 83
Iterating global reduction 6 with 11 rules applied. Total rules applied 420 place count 40 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 428 place count 40 transition count 75
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 431 place count 37 transition count 66
Iterating global reduction 7 with 3 rules applied. Total rules applied 434 place count 37 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 436 place count 37 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 438 place count 36 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 446 place count 36 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 448 place count 34 transition count 60
Applied a total of 448 rules in 23 ms. Remains 34 /250 variables (removed 216) and now considering 60/321 (removed 261) transitions.
[2024-06-02 19:08:13] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
// Phase 1: matrix 57 rows 34 cols
[2024-06-02 19:08:13] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 19:08:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 19:08:13] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
[2024-06-02 19:08:13] [INFO ] Invariant cache hit.
[2024-06-02 19:08:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:08:13] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-02 19:08:13] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-02 19:08:13] [INFO ] Flow matrix only has 57 transitions (discarded 3 similar events)
[2024-06-02 19:08:13] [INFO ] Invariant cache hit.
[2024-06-02 19:08:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 56/90 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 39 constraints, problems are : Problem set: 0 solved, 45 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 56/90 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 45/83 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 84 constraints, problems are : Problem set: 0 solved, 45 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1089ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/250 places, 60/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1197 ms. Remains : 34/250 places, 60/321 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-11
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-11 finished in 1252 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))&&(p1||X(p2)||F(p3)))))'
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 244 transition count 315
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 244 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 241 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 241 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 241 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 239 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 239 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 238 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 238 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 238 transition count 307
Applied a total of 26 rules in 14 ms. Remains 238 /250 variables (removed 12) and now considering 307/321 (removed 14) transitions.
// Phase 1: matrix 307 rows 238 cols
[2024-06-02 19:08:14] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 19:08:14] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 19:08:14] [INFO ] Invariant cache hit.
[2024-06-02 19:08:15] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-06-02 19:08:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 19:08:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:08:17] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/545 variables, 238/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 244 constraints, problems are : Problem set: 0 solved, 306 unsolved in 12912 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/545 variables, 238/244 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 306/550 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 19:08:40] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/545 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-06-02 19:08:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 552 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints]
After SMT, in 42966ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 42970ms
Starting structural reductions in LTL mode, iteration 1 : 238/250 places, 307/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43173 ms. Remains : 238/250 places, 307/321 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p3)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : CO4-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-13 finished in 43433 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(F(p2)))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 321/321 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 244 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 244 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 244 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 242 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 242 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 241 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 241 transition count 309
Applied a total of 20 rules in 8 ms. Remains 241 /250 variables (removed 9) and now considering 309/321 (removed 12) transitions.
// Phase 1: matrix 309 rows 241 cols
[2024-06-02 19:08:58] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 19:08:58] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:08:58] [INFO ] Invariant cache hit.
[2024-06-02 19:08:58] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 19:08:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 19:09:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:09:01] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/550 variables, 241/247 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 247 constraints, problems are : Problem set: 0 solved, 308 unsolved in 13032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/550 variables, 241/247 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 308/555 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 19:09:16] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 3 ms to minimize.
[2024-06-02 19:09:18] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 19:09:30] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 15 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/550 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 558 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 5/5 constraints]
After SMT, in 43100ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 43104ms
Starting structural reductions in LTL mode, iteration 1 : 241/250 places, 309/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43314 ms. Remains : 241/250 places, 309/321 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-15
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-15 finished in 43427 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p1)&&F(p2))))))'
[2024-06-02 19:09:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:09:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 19:09:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 321 transitions and 749 arcs took 14 ms.
Total runtime 191849 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CO4-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 250
TRANSITIONS: 321
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.001s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1149
MODEL NAME: /home/mcc/execution/406/model
250 places, 321 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CO4-PT-12-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-12-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717355437743

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../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="CO4-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-12, 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 r549-tall-171734897800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-12.tgz
mv CO4-PT-12 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 ;