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.r065-tajo-171620414900358.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 gold2023
Input is BusinessProcesses-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 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 159K 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-16-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651401434

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:36:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:36:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:36:43] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-25 15:36:43] [INFO ] Transformed 638 places.
[2024-05-25 15:36:43] [INFO ] Transformed 578 transitions.
[2024-05-25 15:36:43] [INFO ] Found NUPN structural information;
[2024-05-25 15:36:43] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 99 place count 531 transition count 476
Iterating global reduction 1 with 94 rules applied. Total rules applied 193 place count 531 transition count 476
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 243 place count 481 transition count 426
Iterating global reduction 1 with 50 rules applied. Total rules applied 293 place count 481 transition count 426
Applied a total of 293 rules in 112 ms. Remains 481 /630 variables (removed 149) and now considering 426/570 (removed 144) transitions.
// Phase 1: matrix 426 rows 481 cols
[2024-05-25 15:36:43] [INFO ] Computed 95 invariants in 32 ms
[2024-05-25 15:36:44] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-25 15:36:44] [INFO ] Invariant cache hit.
[2024-05-25 15:36:44] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2024-05-25 15:36:44] [INFO ] Invariant cache hit.
[2024-05-25 15:36:45] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 481/630 places, 426/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1559 ms. Remains : 481/630 places, 426/570 transitions.
Support contains 36 out of 481 places after structural reductions.
[2024-05-25 15:36:45] [INFO ] Flatten gal took : 128 ms
[2024-05-25 15:36:45] [INFO ] Flatten gal took : 33 ms
[2024-05-25 15:36:45] [INFO ] Input system was already deterministic with 426 transitions.
Support contains 33 out of 481 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 26) seen :14
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :2
Running SMT prover for 10 properties.
[2024-05-25 15:36:46] [INFO ] Invariant cache hit.
[2024-05-25 15:36:47] [INFO ] [Real]Absence check using 56 positive place invariants in 42 ms returned sat
[2024-05-25 15:36:47] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 27 ms returned sat
[2024-05-25 15:36:48] [INFO ] After 790ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:8
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 8 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 2 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 49 places in 485 ms of which 2 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 11 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1777 ms
[2024-05-25 15:36:50] [INFO ] After 2589ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-25 15:36:50] [INFO ] After 3164ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2024-05-25 15:36:50] [INFO ] [Nat]Absence check using 56 positive place invariants in 162 ms returned sat
[2024-05-25 15:36:50] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 15 ms returned sat
[2024-05-25 15:36:51] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 77 places in 200 ms of which 1 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 79 places in 558 ms of which 1 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 4 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2498 ms
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-25 15:36:54] [INFO ] After 3466ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-05-25 15:36:54] [INFO ] After 4366ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 2 properties in 111 ms.
Support contains 12 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 426/426 transitions.
Graph (complete) has 1091 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 480 transition count 376
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 431 transition count 373
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 428 transition count 373
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 105 place count 428 transition count 277
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 313 place count 316 transition count 277
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 317 place count 312 transition count 273
Iterating global reduction 3 with 4 rules applied. Total rules applied 321 place count 312 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 321 place count 312 transition count 272
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 323 place count 311 transition count 272
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 582 place count 179 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 583 place count 179 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 584 place count 179 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 585 place count 178 transition count 143
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 590 place count 178 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 591 place count 177 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 592 place count 176 transition count 142
Applied a total of 592 rules in 111 ms. Remains 176 /481 variables (removed 305) and now considering 142/426 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 176/481 places, 142/426 transitions.
Incomplete random walk after 10000 steps, including 904 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 347 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 297 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Finished probabilistic random walk after 25622 steps, run visited all 7 properties in 175 ms. (steps per millisecond=146 )
Probabilistic random walk after 25622 steps, saw 7820 distinct states, run finished after 176 ms. (steps per millisecond=145 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 130 stabilizing places and 123 stable transitions
Graph (complete) has 1091 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Graph (trivial) has 225 edges and 481 vertex of which 6 / 481 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1085 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 474 transition count 367
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 423 transition count 367
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 104 place count 423 transition count 266
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 323 place count 305 transition count 266
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 298 transition count 259
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 298 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 298 transition count 258
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 339 place count 297 transition count 258
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 588 place count 170 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 590 place count 169 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 591 place count 168 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 592 place count 167 transition count 139
Applied a total of 592 rules in 104 ms. Remains 167 /481 variables (removed 314) and now considering 139/426 (removed 287) transitions.
// Phase 1: matrix 139 rows 167 cols
[2024-05-25 15:36:56] [INFO ] Computed 72 invariants in 7 ms
[2024-05-25 15:36:56] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-25 15:36:56] [INFO ] Invariant cache hit.
[2024-05-25 15:36:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:36:56] [INFO ] Implicit Places using invariants and state equation in 278 ms returned [55, 57, 59, 61, 62, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 87, 89, 91, 93, 95, 97, 99, 101, 109, 111, 113, 115, 117]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 428 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/481 places, 139/426 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 138 transition count 130
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 129 transition count 130
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 123 transition count 122
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 123 transition count 122
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 123 transition count 119
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 36 place count 120 transition count 119
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 56 place count 109 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 107 transition count 108
Applied a total of 60 rules in 40 ms. Remains 107 /138 variables (removed 31) and now considering 108/139 (removed 31) transitions.
// Phase 1: matrix 108 rows 107 cols
[2024-05-25 15:36:56] [INFO ] Computed 43 invariants in 3 ms
[2024-05-25 15:36:56] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-25 15:36:56] [INFO ] Invariant cache hit.
[2024-05-25 15:36:56] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-25 15:36:57] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [4, 5, 6, 7, 9, 10, 11, 13, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 48, 49, 50]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 314 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/481 places, 108/426 transitions.
Graph (complete) has 343 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 68 transition count 68
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 68 transition count 68
Applied a total of 19 rules in 8 ms. Remains 68 /86 variables (removed 18) and now considering 68/108 (removed 40) transitions.
// Phase 1: matrix 68 rows 68 cols
[2024-05-25 15:36:57] [INFO ] Computed 17 invariants in 1 ms
[2024-05-25 15:36:57] [INFO ] Implicit Places using invariants in 60 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 65/481 places, 68/426 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 961 ms. Remains : 65/481 places, 68/426 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 0), p1:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 3 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-00 finished in 1378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&(p1 U p2)))||G(p3)))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 474 transition count 419
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 473 transition count 418
Applied a total of 16 rules in 62 ms. Remains 473 /481 variables (removed 8) and now considering 418/426 (removed 8) transitions.
// Phase 1: matrix 418 rows 473 cols
[2024-05-25 15:36:57] [INFO ] Computed 95 invariants in 10 ms
[2024-05-25 15:36:57] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-25 15:36:57] [INFO ] Invariant cache hit.
[2024-05-25 15:36:58] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-05-25 15:36:58] [INFO ] Invariant cache hit.
[2024-05-25 15:36:58] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/481 places, 418/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 473/481 places, 418/426 transitions.
Stuttering acceptance computed with spot in 372 ms :[true, (NOT p2), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=4 dest: 5}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(EQ s243 1), p1:(EQ s150 1), p0:(EQ s243 0), p3:(EQ s240 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 100 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-02 finished in 1593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Graph (trivial) has 225 edges and 481 vertex of which 6 / 481 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 1085 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 474 transition count 366
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 422 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 421 transition count 365
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 108 place count 421 transition count 266
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 322 place count 306 transition count 266
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 329 place count 299 transition count 259
Iterating global reduction 3 with 7 rules applied. Total rules applied 336 place count 299 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 336 place count 299 transition count 258
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 338 place count 298 transition count 258
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 589 place count 170 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 591 place count 169 transition count 139
Applied a total of 591 rules in 97 ms. Remains 169 /481 variables (removed 312) and now considering 139/426 (removed 287) transitions.
// Phase 1: matrix 139 rows 169 cols
[2024-05-25 15:36:59] [INFO ] Computed 74 invariants in 3 ms
[2024-05-25 15:36:59] [INFO ] Implicit Places using invariants in 132 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 132]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 136 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/481 places, 139/426 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 148/481 places, 139/426 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s36 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-03 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U (p1||(p0&&G(p2))))))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Graph (trivial) has 222 edges and 481 vertex of which 6 / 481 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 1085 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 474 transition count 368
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 424 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 422 transition count 366
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 106 place count 422 transition count 268
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 318 place count 308 transition count 268
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 324 place count 302 transition count 262
Iterating global reduction 3 with 6 rules applied. Total rules applied 330 place count 302 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 302 transition count 261
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 332 place count 301 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 587 place count 171 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 589 place count 170 transition count 140
Applied a total of 589 rules in 63 ms. Remains 170 /481 variables (removed 311) and now considering 140/426 (removed 286) transitions.
// Phase 1: matrix 140 rows 170 cols
[2024-05-25 15:36:59] [INFO ] Computed 74 invariants in 2 ms
[2024-05-25 15:36:59] [INFO ] Implicit Places using invariants in 129 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 25, 48, 51, 52, 53, 54, 143]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 132 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/481 places, 140/426 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 150/481 places, 140/426 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s62 1), p0:(NEQ s35 1), p2:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-04 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 473 transition count 418
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 473 transition count 418
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 471 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 471 transition count 416
Applied a total of 20 rules in 45 ms. Remains 471 /481 variables (removed 10) and now considering 416/426 (removed 10) transitions.
// Phase 1: matrix 416 rows 471 cols
[2024-05-25 15:36:59] [INFO ] Computed 95 invariants in 4 ms
[2024-05-25 15:37:00] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-25 15:37:00] [INFO ] Invariant cache hit.
[2024-05-25 15:37:00] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-25 15:37:00] [INFO ] Invariant cache hit.
[2024-05-25 15:37:00] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/481 places, 416/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 916 ms. Remains : 471/481 places, 416/426 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s50 1) (EQ s265 1) (EQ s436 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-05 finished in 1045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) U G(p1))))'
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 474 transition count 419
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 474 transition count 419
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 472 transition count 417
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 472 transition count 417
Applied a total of 18 rules in 35 ms. Remains 472 /481 variables (removed 9) and now considering 417/426 (removed 9) transitions.
// Phase 1: matrix 417 rows 472 cols
[2024-05-25 15:37:00] [INFO ] Computed 95 invariants in 8 ms
[2024-05-25 15:37:01] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-25 15:37:01] [INFO ] Invariant cache hit.
[2024-05-25 15:37:01] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2024-05-25 15:37:01] [INFO ] Invariant cache hit.
[2024-05-25 15:37:02] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/481 places, 417/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1100 ms. Remains : 472/481 places, 417/426 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s229 1), p0:(EQ s275 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 832 reset in 335 ms.
Stack based approach found an accepted trace after 2049 steps with 17 reset with depth 27 and stack size 27 in 8 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-06 finished in 1702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&G(p1))))))'
Support contains 4 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 473 transition count 418
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 473 transition count 418
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 471 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 471 transition count 416
Applied a total of 20 rules in 27 ms. Remains 471 /481 variables (removed 10) and now considering 416/426 (removed 10) transitions.
// Phase 1: matrix 416 rows 471 cols
[2024-05-25 15:37:02] [INFO ] Computed 95 invariants in 4 ms
[2024-05-25 15:37:02] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-25 15:37:02] [INFO ] Invariant cache hit.
[2024-05-25 15:37:03] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2024-05-25 15:37:03] [INFO ] Invariant cache hit.
[2024-05-25 15:37:03] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/481 places, 416/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 471/481 places, 416/426 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (NEQ s82 1) (NEQ s317 1) (NEQ s436 1)), p0:(EQ s137 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 670 reset in 257 ms.
Product exploration explored 100000 steps with 667 reset in 283 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 15:37:05] [INFO ] Invariant cache hit.
[2024-05-25 15:37:05] [INFO ] [Real]Absence check using 56 positive place invariants in 16 ms returned sat
[2024-05-25 15:37:05] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 18 ms returned sat
[2024-05-25 15:37:05] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:37:05] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-25 15:37:05] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 21 ms returned sat
[2024-05-25 15:37:05] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:37:05] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2024-05-25 15:37:06] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:37:06] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:37:06] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:37:06] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:37:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 543 ms
[2024-05-25 15:37:06] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-25 15:37:06] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 416/416 transitions.
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 470 transition count 368
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 423 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 421 transition count 366
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 99 place count 421 transition count 265
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 318 place count 303 transition count 265
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 267 rules applied. Total rules applied 585 place count 167 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 586 place count 167 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 587 place count 167 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 588 place count 166 transition count 132
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 594 place count 166 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 595 place count 165 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 596 place count 164 transition count 131
Applied a total of 596 rules in 53 ms. Remains 164 /471 variables (removed 307) and now considering 131/416 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 164/471 places, 131/416 transitions.
Incomplete random walk after 10000 steps, including 1113 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1029 steps, run visited all 1 properties in 10 ms. (steps per millisecond=102 )
Probabilistic random walk after 1029 steps, saw 507 distinct states, run finished after 10 ms. (steps per millisecond=102 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Applied a total of 0 rules in 14 ms. Remains 471 /471 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-05-25 15:37:07] [INFO ] Invariant cache hit.
[2024-05-25 15:37:07] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-25 15:37:07] [INFO ] Invariant cache hit.
[2024-05-25 15:37:08] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2024-05-25 15:37:08] [INFO ] Invariant cache hit.
[2024-05-25 15:37:08] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1161 ms. Remains : 471/471 places, 416/416 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 598184 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598184 steps, saw 95406 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:37:12] [INFO ] Invariant cache hit.
[2024-05-25 15:37:12] [INFO ] [Real]Absence check using 56 positive place invariants in 16 ms returned sat
[2024-05-25 15:37:12] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 15 ms returned sat
[2024-05-25 15:37:12] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:37:12] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-25 15:37:12] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 16 ms returned sat
[2024-05-25 15:37:12] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 5 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 638 ms
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-25 15:37:13] [INFO ] After 1079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-25 15:37:13] [INFO ] After 1301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 13 ms.
Support contains 3 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 416/416 transitions.
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 470 transition count 368
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 423 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 421 transition count 366
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 99 place count 421 transition count 265
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 318 place count 303 transition count 265
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 267 rules applied. Total rules applied 585 place count 167 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 586 place count 167 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 587 place count 167 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 588 place count 166 transition count 132
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 594 place count 166 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 595 place count 165 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 596 place count 164 transition count 131
Applied a total of 596 rules in 46 ms. Remains 164 /471 variables (removed 307) and now considering 131/416 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 164/471 places, 131/416 transitions.
Incomplete random walk after 10000 steps, including 1123 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1029 steps, run visited all 1 properties in 8 ms. (steps per millisecond=128 )
Probabilistic random walk after 1029 steps, saw 507 distinct states, run finished after 9 ms. (steps per millisecond=114 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 668 reset in 213 ms.
Product exploration explored 100000 steps with 668 reset in 242 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 470 transition count 415
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 48 place count 470 transition count 468
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 120 place count 470 transition count 468
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 134 place count 456 transition count 442
Deduced a syphon composed of 105 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 148 place count 456 transition count 442
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 262 places in 0 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 305 place count 456 transition count 442
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 342 place count 419 transition count 405
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 379 place count 419 transition count 405
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 381 place count 419 transition count 409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 382 place count 419 transition count 408
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 384 place count 417 transition count 404
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 386 place count 417 transition count 404
Deduced a syphon composed of 225 places in 1 ms
Applied a total of 386 rules in 84 ms. Remains 417 /471 variables (removed 54) and now considering 404/416 (removed 12) transitions.
[2024-05-25 15:37:15] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 404 rows 417 cols
[2024-05-25 15:37:15] [INFO ] Computed 95 invariants in 9 ms
[2024-05-25 15:37:15] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 417/471 places, 404/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 417/471 places, 404/416 transitions.
Built C files in :
/tmp/ltsmin12160953979390720456
[2024-05-25 15:37:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12160953979390720456
Running compilation step : cd /tmp/ltsmin12160953979390720456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 744 ms.
Running link step : cd /tmp/ltsmin12160953979390720456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12160953979390720456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4683431721154009337.hoa' '--buchi-type=spotba'
LTSmin run took 337 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-16-LTLFireability-07 finished in 14181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Graph (trivial) has 223 edges and 481 vertex of which 6 / 481 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 1085 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 474 transition count 366
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 422 transition count 366
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 106 place count 422 transition count 267
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 321 place count 306 transition count 267
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 326 place count 301 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 331 place count 301 transition count 262
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 590 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 592 place count 168 transition count 139
Applied a total of 592 rules in 51 ms. Remains 168 /481 variables (removed 313) and now considering 139/426 (removed 287) transitions.
// Phase 1: matrix 139 rows 168 cols
[2024-05-25 15:37:16] [INFO ] Computed 73 invariants in 2 ms
[2024-05-25 15:37:16] [INFO ] Implicit Places using invariants in 151 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 153 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/481 places, 139/426 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 148/481 places, 139/426 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s89 1), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-08 finished in 390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 473 transition count 418
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 473 transition count 418
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 471 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 471 transition count 416
Applied a total of 20 rules in 26 ms. Remains 471 /481 variables (removed 10) and now considering 416/426 (removed 10) transitions.
// Phase 1: matrix 416 rows 471 cols
[2024-05-25 15:37:17] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:37:17] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-25 15:37:17] [INFO ] Invariant cache hit.
[2024-05-25 15:37:17] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2024-05-25 15:37:17] [INFO ] Invariant cache hit.
[2024-05-25 15:37:18] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/481 places, 416/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 995 ms. Remains : 471/481 places, 416/426 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s445 1) (EQ s448 1) (EQ s451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-09 finished in 1109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Graph (trivial) has 225 edges and 481 vertex of which 6 / 481 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 1085 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 474 transition count 366
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 422 transition count 366
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 106 place count 422 transition count 266
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 323 place count 305 transition count 266
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 298 transition count 259
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 298 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 298 transition count 258
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 339 place count 297 transition count 258
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 594 place count 167 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 596 place count 166 transition count 137
Applied a total of 596 rules in 25 ms. Remains 166 /481 variables (removed 315) and now considering 137/426 (removed 289) transitions.
// Phase 1: matrix 137 rows 166 cols
[2024-05-25 15:37:18] [INFO ] Computed 73 invariants in 3 ms
[2024-05-25 15:37:18] [INFO ] Implicit Places using invariants in 180 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 182 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/481 places, 137/426 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 146/481 places, 137/426 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-11 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&((p1&&X(F(p2))) U ((X(F(p2))&&p3)||G((p1&&F(p2))))))))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 474 transition count 419
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 473 transition count 418
Applied a total of 16 rules in 19 ms. Remains 473 /481 variables (removed 8) and now considering 418/426 (removed 8) transitions.
// Phase 1: matrix 418 rows 473 cols
[2024-05-25 15:37:18] [INFO ] Computed 95 invariants in 4 ms
[2024-05-25 15:37:18] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-25 15:37:18] [INFO ] Invariant cache hit.
[2024-05-25 15:37:19] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-05-25 15:37:19] [INFO ] Invariant cache hit.
[2024-05-25 15:37:19] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/481 places, 418/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 902 ms. Remains : 473/481 places, 418/426 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p2), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p3), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2)) p3), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p1 (NOT p2)) p3), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s218 1), p3:(AND (NEQ s432 1) (NEQ s218 1)), p2:(NEQ s291 1), p0:(EQ s291 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 88 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-13 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 426/426 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 474 transition count 419
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 474 transition count 419
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 472 transition count 417
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 472 transition count 417
Applied a total of 18 rules in 20 ms. Remains 472 /481 variables (removed 9) and now considering 417/426 (removed 9) transitions.
// Phase 1: matrix 417 rows 472 cols
[2024-05-25 15:37:19] [INFO ] Computed 95 invariants in 3 ms
[2024-05-25 15:37:20] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-25 15:37:20] [INFO ] Invariant cache hit.
[2024-05-25 15:37:20] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2024-05-25 15:37:20] [INFO ] Invariant cache hit.
[2024-05-25 15:37:20] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/481 places, 417/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1114 ms. Remains : 472/481 places, 417/426 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s401 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-14 finished in 1252 ms.
All properties solved by simple procedures.
Total runtime 37851 ms.

BK_STOP 1716651441289

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is BusinessProcesses-PT-16, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414900358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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