Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398500595.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 189K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716308915383

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:28:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:28:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:28:37] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-21 16:28:37] [INFO ] Transformed 772 places.
[2024-05-21 16:28:37] [INFO ] Transformed 685 transitions.
[2024-05-21 16:28:37] [INFO ] Found NUPN structural information;
[2024-05-21 16:28:37] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 750 transition count 670
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 104 place count 653 transition count 573
Iterating global reduction 1 with 97 rules applied. Total rules applied 201 place count 653 transition count 573
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 246 place count 608 transition count 528
Iterating global reduction 1 with 45 rules applied. Total rules applied 291 place count 608 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 292 place count 607 transition count 527
Iterating global reduction 1 with 1 rules applied. Total rules applied 293 place count 607 transition count 527
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 294 place count 606 transition count 526
Iterating global reduction 1 with 1 rules applied. Total rules applied 295 place count 606 transition count 526
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 296 place count 605 transition count 525
Iterating global reduction 1 with 1 rules applied. Total rules applied 297 place count 605 transition count 525
Applied a total of 297 rules in 463 ms. Remains 605 /757 variables (removed 152) and now considering 525/670 (removed 145) transitions.
// Phase 1: matrix 525 rows 605 cols
[2024-05-21 16:28:38] [INFO ] Computed 118 invariants in 47 ms
[2024-05-21 16:28:38] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-05-21 16:28:38] [INFO ] Invariant cache hit.
[2024-05-21 16:28:40] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2024-05-21 16:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 2/605 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/605 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 93 places in 193 ms of which 46 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 97 places in 197 ms of which 4 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:29:07] [INFO ] Deduced a trap composed of 118 places in 222 ms of which 3 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 4 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 127 places in 206 ms of which 3 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 94 places in 243 ms of which 2 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:29:08] [INFO ] Deduced a trap composed of 88 places in 197 ms of which 3 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 112 places in 219 ms of which 5 ms to minimize.
[2024-05-21 16:29:09] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 4 ms to minimize.
[2024-05-21 16:29:11] [INFO ] Deduced a trap composed of 89 places in 1876 ms of which 3 ms to minimize.
SMT process timed out in 31304ms, After SMT, problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 31329ms
Starting structural reductions in LTL mode, iteration 1 : 605/757 places, 525/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33766 ms. Remains : 605/757 places, 525/670 transitions.
Support contains 36 out of 605 places after structural reductions.
[2024-05-21 16:29:11] [INFO ] Flatten gal took : 90 ms
[2024-05-21 16:29:11] [INFO ] Flatten gal took : 39 ms
[2024-05-21 16:29:11] [INFO ] Input system was already deterministic with 525 transitions.
Support contains 34 out of 605 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (216 resets) in 1837 ms. (21 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40003 steps (39 resets) in 304 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (44 resets) in 281 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (47 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (37 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
[2024-05-21 16:29:12] [INFO ] Invariant cache hit.
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 319/335 variables, 38/38 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 118/453 variables, 33/71 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 141/594 variables, 45/116 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/596 variables, 2/118 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/596 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 519/1115 variables, 596/714 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1115 variables, 0/714 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 13/1128 variables, 7/721 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1128 variables, 0/721 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/1130 variables, 2/723 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1130 variables, 0/723 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1130 variables, 0/723 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 723 constraints, problems are : Problem set: 1 solved, 6 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 605/605 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 158/170 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 282/452 variables, 66/71 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:29:14] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 110 places in 158 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 2 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:29:15] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 5 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 6 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 2 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 2 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 20/91 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 100 places in 183 ms of which 2 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 5 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 11 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 101 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 101 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 2 ms to minimize.
SMT process timed out in 6023ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 280 edges and 605 vertex of which 6 / 605 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1322 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 598 transition count 448
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 529 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 528 transition count 447
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 142 place count 528 transition count 325
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 269 rules applied. Total rules applied 411 place count 381 transition count 325
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 420 place count 372 transition count 316
Iterating global reduction 3 with 9 rules applied. Total rules applied 429 place count 372 transition count 316
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 741 place count 214 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 743 place count 213 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 745 place count 213 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 747 place count 211 transition count 163
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 748 place count 211 transition count 163
Applied a total of 748 rules in 175 ms. Remains 211 /605 variables (removed 394) and now considering 163/525 (removed 362) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 211/605 places, 163/525 transitions.
RANDOM walk for 5473 steps (218 resets) in 151 ms. (36 steps per ms) remains 0/6 properties
FORMULA BusinessProcesses-PT-19-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 547 stabilizing places and 477 stable transitions
Graph (complete) has 1329 edges and 605 vertex of which 603 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 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 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 294 edges and 605 vertex of which 6 / 605 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1323 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 597 transition count 442
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 522 transition count 442
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 152 place count 522 transition count 318
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 425 place count 373 transition count 318
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 442 place count 356 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 460 place count 355 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 460 place count 355 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 462 place count 354 transition count 300
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 772 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 774 place count 196 transition count 150
Applied a total of 774 rules in 85 ms. Remains 196 /605 variables (removed 409) and now considering 150/525 (removed 375) transitions.
// Phase 1: matrix 150 rows 196 cols
[2024-05-21 16:29:19] [INFO ] Computed 87 invariants in 3 ms
[2024-05-21 16:29:19] [INFO ] Implicit Places using invariants in 222 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 227 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/605 places, 150/525 transitions.
Applied a total of 0 rules in 10 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 322 ms. Remains : 168/605 places, 150/525 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-01 finished in 619 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(X((G(X(p0)) U p1))))'
Support contains 2 out of 605 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 525
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 586 transition count 507
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 586 transition count 507
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 579 transition count 500
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 579 transition count 500
Applied a total of 51 rules in 41 ms. Remains 579 /605 variables (removed 26) and now considering 500/525 (removed 25) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-21 16:29:20] [INFO ] Computed 117 invariants in 17 ms
[2024-05-21 16:29:20] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 16:29:20] [INFO ] Invariant cache hit.
[2024-05-21 16:29:21] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-05-21 16:29:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-21 16:29:33] [INFO ] Deduced a trap composed of 82 places in 325 ms of which 31 ms to minimize.
[2024-05-21 16:29:33] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 3 ms to minimize.
[2024-05-21 16:29:33] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:29:34] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 10 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 4 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 3 ms to minimize.
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 4 solved, 495 unsolved
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 4 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 4 solved, 495 unsolved
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:29:42] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:29:42] [INFO ] Deduced a trap composed of 102 places in 199 ms of which 2 ms to minimize.
[2024-05-21 16:29:42] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:29:42] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:29:42] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:29:43] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 4 solved, 495 unsolved
[2024-05-21 16:29:47] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:29:47] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:29:47] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:29:47] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:29:47] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 4 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 136 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:29:48] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:29:49] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:29:49] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:29:49] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:29:49] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:29:49] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:29:49] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 4 solved, 495 unsolved
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:29:50] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 3 ms to minimize.
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:29:51] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 3 ms to minimize.
SMT process timed out in 30200ms, After SMT, problems are : Problem set: 4 solved, 495 unsolved
Search for dead transitions found 4 dead transitions in 30208ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/605 places, 496/525 transitions.
Applied a total of 0 rules in 12 ms. Remains 579 /579 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31334 ms. Remains : 579/605 places, 496/525 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Computed a total of 522 stabilizing places and 449 stable transitions
Graph (complete) has 1286 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 522 stabilizing places and 449 stable transitions
Detected a total of 522/579 stabilizing places and 449/496 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLCardinality-03 finished in 32159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 6 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 288 edges and 605 vertex of which 6 / 605 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1323 edges and 600 vertex of which 599 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 598 transition count 445
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 526 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 525 transition count 444
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 148 place count 525 transition count 321
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 418 place count 378 transition count 321
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 433 place count 363 transition count 306
Ensure Unique test removed 1 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 449 place count 362 transition count 306
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 759 place count 205 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 761 place count 204 transition count 156
Applied a total of 761 rules in 48 ms. Remains 204 /605 variables (removed 401) and now considering 156/525 (removed 369) transitions.
// Phase 1: matrix 156 rows 204 cols
[2024-05-21 16:29:52] [INFO ] Computed 89 invariants in 3 ms
[2024-05-21 16:29:52] [INFO ] Implicit Places using invariants in 251 ms returned [1, 2, 6, 7, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 161]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 257 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 176/605 places, 156/525 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 312 ms. Remains : 176/605 places, 156/525 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-05 finished in 436 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))'
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 295 edges and 605 vertex of which 6 / 605 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1323 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 597 transition count 441
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 154 place count 521 transition count 441
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 154 place count 521 transition count 318
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 425 place count 373 transition count 318
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 442 place count 356 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 460 place count 355 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 460 place count 355 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 462 place count 354 transition count 300
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 770 place count 198 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 772 place count 197 transition count 151
Applied a total of 772 rules in 42 ms. Remains 197 /605 variables (removed 408) and now considering 151/525 (removed 374) transitions.
// Phase 1: matrix 151 rows 197 cols
[2024-05-21 16:29:52] [INFO ] Computed 87 invariants in 1 ms
[2024-05-21 16:29:52] [INFO ] Implicit Places using invariants in 131 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 132 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/605 places, 151/525 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 169/605 places, 151/525 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-06 finished in 327 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 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 294 edges and 605 vertex of which 6 / 605 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1323 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 597 transition count 441
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 154 place count 521 transition count 441
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 154 place count 521 transition count 318
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 425 place count 373 transition count 318
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 442 place count 356 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 460 place count 355 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 460 place count 355 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 462 place count 354 transition count 300
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 772 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 774 place count 196 transition count 150
Applied a total of 774 rules in 54 ms. Remains 196 /605 variables (removed 409) and now considering 150/525 (removed 375) transitions.
// Phase 1: matrix 150 rows 196 cols
[2024-05-21 16:29:53] [INFO ] Computed 87 invariants in 2 ms
[2024-05-21 16:29:53] [INFO ] Implicit Places using invariants in 131 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 132 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/605 places, 150/525 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 168/605 places, 150/525 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-07 finished in 317 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))'
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 525
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 587 transition count 508
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 587 transition count 508
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 581 transition count 502
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 581 transition count 502
Applied a total of 47 rules in 43 ms. Remains 581 /605 variables (removed 24) and now considering 502/525 (removed 23) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-21 16:29:53] [INFO ] Computed 117 invariants in 5 ms
[2024-05-21 16:29:53] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-21 16:29:53] [INFO ] Invariant cache hit.
[2024-05-21 16:29:54] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-21 16:29:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 5 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 2 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:30:11] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:30:11] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:30:11] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:30:11] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:30:11] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:30:11] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:30:12] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:30:12] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:30:12] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:30:12] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:30:12] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:30:12] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:30:13] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:30:13] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:30:13] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:30:13] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:30:13] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:30:13] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:30:13] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:30:14] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:30:14] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:30:14] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:30:14] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:30:14] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:30:18] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:30:18] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 112 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 2 ms to minimize.
[2024-05-21 16:30:21] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:30:21] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:30:21] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:30:21] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:30:21] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:30:22] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:30:22] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:30:22] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:30:22] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:30:23] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:30:23] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:30:23] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:30:23] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:30:23] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:30:23] [INFO ] Deduced a trap composed of 105 places in 160 ms of which 2 ms to minimize.
[2024-05-21 16:30:23] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:30:24] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:30:24] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:30:24] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:30:24] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 30204ms, After SMT, problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 30210ms
Starting structural reductions in LTL mode, iteration 1 : 581/605 places, 502/525 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31343 ms. Remains : 581/605 places, 502/525 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-08 finished in 31460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1&&X(!p0)))))'
Support contains 3 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 525
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 586 transition count 507
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 586 transition count 507
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 580 transition count 501
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 580 transition count 501
Applied a total of 49 rules in 52 ms. Remains 580 /605 variables (removed 25) and now considering 501/525 (removed 24) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-21 16:30:24] [INFO ] Computed 117 invariants in 4 ms
[2024-05-21 16:30:25] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-05-21 16:30:25] [INFO ] Invariant cache hit.
[2024-05-21 16:30:26] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-21 16:30:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 2 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 5 solved, 495 unsolved
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 125 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 123 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 5 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 2 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 5 solved, 495 unsolved
[2024-05-21 16:30:43] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:30:43] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:30:43] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:30:43] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:30:43] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:30:43] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:30:43] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:30:44] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 5 ms to minimize.
[2024-05-21 16:30:44] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:30:44] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:30:44] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:30:44] [INFO ] Deduced a trap composed of 136 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:30:44] [INFO ] Deduced a trap composed of 114 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:30:45] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:30:45] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:30:45] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:30:45] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:30:45] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:30:45] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:30:45] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 21 solved, 479 unsolved
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 138 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 115 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 112 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 121 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 2 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 26 solved, 474 unsolved
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:30:53] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:30:53] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:30:53] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:30:53] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:30:53] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:30:53] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:30:53] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:30:54] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:30:54] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:30:54] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:30:54] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:30:54] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:30:54] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:30:54] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:30:55] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 26 solved, 474 unsolved
[2024-05-21 16:30:55] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:30:55] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:30:55] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:30:56] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:30:56] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 2 ms to minimize.
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 26 solved, 474 unsolved
Search for dead transitions found 26 dead transitions in 30114ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/605 places, 475/525 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 579 transition count 475
Applied a total of 1 rules in 12 ms. Remains 579 /580 variables (removed 1) and now considering 475/475 (removed 0) transitions.
// Phase 1: matrix 475 rows 579 cols
[2024-05-21 16:30:56] [INFO ] Computed 117 invariants in 5 ms
[2024-05-21 16:30:56] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 16:30:56] [INFO ] Invariant cache hit.
[2024-05-21 16:30:56] [INFO ] Implicit Places using invariants and state equation in 524 ms returned [158, 159]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 757 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 577/605 places, 475/525 transitions.
Applied a total of 0 rules in 11 ms. Remains 577 /577 variables (removed 0) and now considering 475/475 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32164 ms. Remains : 577/605 places, 475/525 transitions.
Stuttering acceptance computed with spot in 252 ms :[p0, p0, p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-09
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-09 finished in 32436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||p0) U !p1)))'
Support contains 4 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 525
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 587 transition count 508
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 587 transition count 508
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 581 transition count 502
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 581 transition count 502
Applied a total of 47 rules in 34 ms. Remains 581 /605 variables (removed 24) and now considering 502/525 (removed 23) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-21 16:30:57] [INFO ] Computed 117 invariants in 5 ms
[2024-05-21 16:30:57] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 16:30:57] [INFO ] Invariant cache hit.
[2024-05-21 16:30:57] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-21 16:30:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 107 places in 204 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 2 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 9 solved, 492 unsolved
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 2 ms to minimize.
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 3 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 12 solved, 489 unsolved
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 12 solved, 489 unsolved
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:31:24] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:31:24] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:31:24] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:31:24] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:31:24] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:31:24] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:31:24] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:31:25] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:31:25] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:31:25] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:31:25] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:31:25] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:31:25] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 141 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 3 ms to minimize.
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/217 constraints. Problems are: Problem set: 20 solved, 481 unsolved
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:31:28] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:31:28] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 30233ms, After SMT, problems are : Problem set: 20 solved, 481 unsolved
Search for dead transitions found 20 dead transitions in 30237ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/605 places, 482/525 transitions.
Applied a total of 0 rules in 11 ms. Remains 581 /581 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31060 ms. Remains : 581/605 places, 482/525 transitions.
Stuttering acceptance computed with spot in 87 ms :[p1, p1, true]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-13
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-13 finished in 31171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 525/525 transitions.
Graph (trivial) has 294 edges and 605 vertex of which 6 / 605 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1323 edges and 600 vertex of which 598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 597 transition count 442
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 522 transition count 442
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 152 place count 522 transition count 319
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 422 place count 375 transition count 319
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 440 place count 357 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 459 place count 356 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 459 place count 356 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 461 place count 355 transition count 300
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 771 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 773 place count 197 transition count 150
Applied a total of 773 rules in 51 ms. Remains 197 /605 variables (removed 408) and now considering 150/525 (removed 375) transitions.
// Phase 1: matrix 150 rows 197 cols
[2024-05-21 16:31:28] [INFO ] Computed 88 invariants in 2 ms
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants in 211 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 228 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/605 places, 150/525 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 283 ms. Remains : 168/605 places, 150/525 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-14 finished in 353 ms.
All properties solved by simple procedures.
Total runtime 171761 ms.
ITS solved all properties within timeout

BK_STOP 1716309088801

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-19, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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