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-171620414900353.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-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 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 157K 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-15-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651355172

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-15
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:35:58] [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:35:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:35:58] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-05-25 15:35:58] [INFO ] Transformed 630 places.
[2024-05-25 15:35:58] [INFO ] Transformed 566 transitions.
[2024-05-25 15:35:58] [INFO ] Found NUPN structural information;
[2024-05-25 15:35:58] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 32 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 84 place count 542 transition count 481
Iterating global reduction 1 with 81 rules applied. Total rules applied 165 place count 542 transition count 481
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 205 place count 502 transition count 441
Iterating global reduction 1 with 40 rules applied. Total rules applied 245 place count 502 transition count 441
Applied a total of 245 rules in 246 ms. Remains 502 /626 variables (removed 124) and now considering 441/562 (removed 121) transitions.
// Phase 1: matrix 441 rows 502 cols
[2024-05-25 15:35:59] [INFO ] Computed 99 invariants in 50 ms
[2024-05-25 15:36:00] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2024-05-25 15:36:00] [INFO ] Invariant cache hit.
[2024-05-25 15:36:02] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
[2024-05-25 15:36:02] [INFO ] Invariant cache hit.
[2024-05-25 15:36:02] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/626 places, 441/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3867 ms. Remains : 502/626 places, 441/562 transitions.
Support contains 39 out of 502 places after structural reductions.
[2024-05-25 15:36:03] [INFO ] Flatten gal took : 129 ms
[2024-05-25 15:36:03] [INFO ] Flatten gal took : 42 ms
[2024-05-25 15:36:03] [INFO ] Input system was already deterministic with 441 transitions.
Support contains 37 out of 502 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 885 ms. (steps per millisecond=11 ) properties (out of 33) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-25 15:36:04] [INFO ] Invariant cache hit.
[2024-05-25 15:36:05] [INFO ] [Real]Absence check using 59 positive place invariants in 21 ms returned sat
[2024-05-25 15:36:05] [INFO ] [Real]Absence check using 59 positive and 40 generalized place invariants in 26 ms returned sat
[2024-05-25 15:36:05] [INFO ] After 899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-25 15:36:06] [INFO ] [Nat]Absence check using 59 positive place invariants in 28 ms returned sat
[2024-05-25 15:36:06] [INFO ] [Nat]Absence check using 59 positive and 40 generalized place invariants in 19 ms returned sat
[2024-05-25 15:36:07] [INFO ] After 760ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :18
[2024-05-25 15:36:07] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 38 ms to minimize.
[2024-05-25 15:36:10] [INFO ] Deduced a trap composed of 22 places in 3515 ms of which 28 ms to minimize.
[2024-05-25 15:36:11] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 2 ms to minimize.
[2024-05-25 15:36:11] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 3 ms to minimize.
[2024-05-25 15:36:11] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 1 ms to minimize.
[2024-05-25 15:36:11] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:36:12] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2024-05-25 15:36:12] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 1 ms to minimize.
[2024-05-25 15:36:12] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 1 ms to minimize.
[2024-05-25 15:36:12] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 1 ms to minimize.
[2024-05-25 15:36:13] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:36:13] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2024-05-25 15:36:13] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2024-05-25 15:36:13] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:36:13] [INFO ] Deduced a trap composed of 93 places in 243 ms of which 1 ms to minimize.
[2024-05-25 15:36:14] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 0 ms to minimize.
[2024-05-25 15:36:14] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:36:19] [INFO ] Deduced a trap composed of 94 places in 5721 ms of which 4 ms to minimize.
[2024-05-25 15:36:20] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 13025 ms
[2024-05-25 15:36:20] [INFO ] Deduced a trap composed of 102 places in 264 ms of which 1 ms to minimize.
[2024-05-25 15:36:20] [INFO ] Deduced a trap composed of 105 places in 244 ms of which 1 ms to minimize.
[2024-05-25 15:36:20] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 1 ms to minimize.
[2024-05-25 15:36:21] [INFO ] Deduced a trap composed of 103 places in 203 ms of which 2 ms to minimize.
[2024-05-25 15:36:21] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 0 ms to minimize.
[2024-05-25 15:36:21] [INFO ] Deduced a trap composed of 101 places in 230 ms of which 1 ms to minimize.
[2024-05-25 15:36:21] [INFO ] Deduced a trap composed of 113 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:36:21] [INFO ] Deduced a trap composed of 94 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:36:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1850 ms
[2024-05-25 15:36:22] [INFO ] After 16381ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :17
Attempting to minimize the solution found.
Minimization took 367 ms.
[2024-05-25 15:36:23] [INFO ] After 17416ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :17
Fused 20 Parikh solutions to 15 different solutions.
Parikh walk visited 1 properties in 281 ms.
Support contains 18 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 441/441 transitions.
Graph (trivial) has 224 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1120 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 496 transition count 376
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 439 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 438 transition count 375
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 118 place count 438 transition count 279
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 328 place count 324 transition count 279
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 334 place count 318 transition count 273
Iterating global reduction 3 with 6 rules applied. Total rules applied 340 place count 318 transition count 273
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 590 place count 191 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 592 place count 190 transition count 154
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 594 place count 190 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 596 place count 188 transition count 152
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 597 place count 188 transition count 152
Applied a total of 597 rules in 129 ms. Remains 188 /502 variables (removed 314) and now considering 152/441 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 188/502 places, 152/441 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 152 rows 188 cols
[2024-05-25 15:36:23] [INFO ] Computed 77 invariants in 8 ms
[2024-05-25 15:36:23] [INFO ] [Real]Absence check using 60 positive place invariants in 9 ms returned sat
[2024-05-25 15:36:23] [INFO ] [Real]Absence check using 60 positive and 17 generalized place invariants in 14 ms returned sat
[2024-05-25 15:36:23] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:36:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 15:36:23] [INFO ] After 11ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-25 15:36:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:36:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-25 15:36:23] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:36:23] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:36:23] [INFO ] [Nat]Absence check using 60 positive place invariants in 8 ms returned sat
[2024-05-25 15:36:23] [INFO ] [Nat]Absence check using 60 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-25 15:36:23] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:36:23] [INFO ] After 11ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:36:23] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:36:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-25 15:36:23] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 15:36:23] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Computed a total of 216 stabilizing places and 188 stable transitions
Graph (complete) has 1127 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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(G(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Graph (trivial) has 241 edges and 502 vertex of which 6 / 502 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 1121 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 496 transition count 373
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 435 transition count 373
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 124 place count 435 transition count 271
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 348 place count 313 transition count 271
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 362 place count 299 transition count 257
Iterating global reduction 2 with 14 rules applied. Total rules applied 376 place count 299 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 376 place count 299 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 380 place count 297 transition count 255
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 630 place count 170 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 632 place count 169 transition count 136
Applied a total of 632 rules in 88 ms. Remains 169 /502 variables (removed 333) and now considering 136/441 (removed 305) transitions.
// Phase 1: matrix 136 rows 169 cols
[2024-05-25 15:36:24] [INFO ] Computed 75 invariants in 2 ms
[2024-05-25 15:36:24] [INFO ] Implicit Places using invariants in 177 ms returned [2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 180 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/502 places, 136/441 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 277 ms. Remains : 147/502 places, 136/441 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 292 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-00 finished in 648 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(F(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 425
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 423
Applied a total of 36 rules in 46 ms. Remains 484 /502 variables (removed 18) and now considering 423/441 (removed 18) transitions.
// Phase 1: matrix 423 rows 484 cols
[2024-05-25 15:36:25] [INFO ] Computed 99 invariants in 20 ms
[2024-05-25 15:36:25] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-25 15:36:25] [INFO ] Invariant cache hit.
[2024-05-25 15:36:26] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
[2024-05-25 15:36:26] [INFO ] Invariant cache hit.
[2024-05-25 15:36:27] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/502 places, 423/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1870 ms. Remains : 484/502 places, 423/441 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s108 1)], 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][false, false]]
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-02 finished in 1981 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)||G(F(p1)))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 425
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 423
Applied a total of 36 rules in 43 ms. Remains 484 /502 variables (removed 18) and now considering 423/441 (removed 18) transitions.
[2024-05-25 15:36:27] [INFO ] Invariant cache hit.
[2024-05-25 15:36:31] [INFO ] Implicit Places using invariants in 3913 ms returned []
[2024-05-25 15:36:31] [INFO ] Invariant cache hit.
[2024-05-25 15:36:31] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 4534 ms to find 0 implicit places.
[2024-05-25 15:36:31] [INFO ] Invariant cache hit.
[2024-05-25 15:36:32] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/502 places, 423/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4972 ms. Remains : 484/502 places, 423/441 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s286 0), p1:(OR (EQ s100 0) (EQ s289 0) (EQ s460 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 675 reset in 356 ms.
Product exploration explored 100000 steps with 672 reset in 343 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1102 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/484 stabilizing places and 176/423 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 229 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:36:33] [INFO ] Invariant cache hit.
[2024-05-25 15:36:34] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:36:34] [INFO ] [Nat]Absence check using 58 positive place invariants in 23 ms returned sat
[2024-05-25 15:36:34] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 21 ms returned sat
[2024-05-25 15:36:34] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 0 ms to minimize.
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 14 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 6 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:36:39] [INFO ] Deduced a trap composed of 30 places in 2774 ms of which 24 ms to minimize.
[2024-05-25 15:36:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4906 ms
[2024-05-25 15:36:39] [INFO ] After 5218ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-25 15:36:39] [INFO ] After 5438ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 423/423 transitions.
Graph (trivial) has 222 edges and 484 vertex of which 6 / 484 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1095 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output 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 478 transition count 365
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 428 transition count 365
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 102 place count 428 transition count 262
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 328 place count 305 transition count 262
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 590 place count 172 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 592 place count 171 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 171 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 596 place count 169 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 597 place count 169 transition count 135
Applied a total of 597 rules in 65 ms. Remains 169 /484 variables (removed 315) and now considering 135/423 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 169/484 places, 135/423 transitions.
Finished random walk after 132 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 298 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 423/423 transitions.
Graph (trivial) has 221 edges and 484 vertex of which 6 / 484 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 1096 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions 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 477 transition count 365
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 427 transition count 365
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 102 place count 427 transition count 262
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 328 place count 304 transition count 262
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 584 place count 174 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 586 place count 173 transition count 140
Applied a total of 586 rules in 41 ms. Remains 173 /484 variables (removed 311) and now considering 140/423 (removed 283) transitions.
// Phase 1: matrix 140 rows 173 cols
[2024-05-25 15:36:40] [INFO ] Computed 75 invariants in 2 ms
[2024-05-25 15:36:40] [INFO ] Implicit Places using invariants in 190 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 205 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/484 places, 140/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 151 /151 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 151/484 places, 140/423 transitions.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/151 stabilizing places and 25/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 379 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 518 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 140 rows 151 cols
[2024-05-25 15:36:41] [INFO ] Computed 53 invariants in 3 ms
[2024-05-25 15:36:41] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:36:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-25 15:36:41] [INFO ] [Nat]Absence check using 37 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-25 15:36:41] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 15:36:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:36:41] [INFO ] After 10ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-25 15:36:41] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 15:36:41] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 140/140 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 139
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 1 with 4 rules applied. Total rules applied 5 place count 149 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 149 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 147 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 147 transition count 135
Applied a total of 10 rules in 34 ms. Remains 147 /151 variables (removed 4) and now considering 135/140 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 147/151 places, 135/140 transitions.
Finished random walk after 1198 steps, including 36 resets, run visited all 1 properties in 4 ms. (steps per millisecond=299 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 512 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13204 reset in 265 ms.
Product exploration explored 100000 steps with 13094 reset in 358 ms.
Built C files in :
/tmp/ltsmin10294832478562698788
[2024-05-25 15:36:43] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2024-05-25 15:36:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:36:43] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2024-05-25 15:36:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:36:43] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2024-05-25 15:36:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:36:43] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10294832478562698788
Running compilation step : cd /tmp/ltsmin10294832478562698788;'/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 576 ms.
Running link step : cd /tmp/ltsmin10294832478562698788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin10294832478562698788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4817460132955383447.hoa' '--buchi-type=spotba'
LTSmin run took 611 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-03 finished in 17571 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 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Graph (trivial) has 240 edges and 502 vertex of which 6 / 502 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 1121 edges and 497 vertex of which 496 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 373
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 435 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 434 transition count 372
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 124 place count 434 transition count 271
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 345 place count 314 transition count 271
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 359 place count 300 transition count 257
Iterating global reduction 3 with 14 rules applied. Total rules applied 373 place count 300 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 373 place count 300 transition count 255
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 377 place count 298 transition count 255
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 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 627 place count 171 transition count 132
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 629 place count 170 transition count 136
Applied a total of 629 rules in 85 ms. Remains 170 /502 variables (removed 332) and now considering 136/441 (removed 305) transitions.
// Phase 1: matrix 136 rows 170 cols
[2024-05-25 15:36:44] [INFO ] Computed 76 invariants in 2 ms
[2024-05-25 15:36:45] [INFO ] Implicit Places using invariants in 176 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 43, 44, 48, 49, 50, 51, 52, 53, 54, 55, 137]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 181 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/502 places, 136/441 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 270 ms. Remains : 147/502 places, 136/441 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 1)], 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-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-05 finished in 356 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&&F(p1)&&X(p2)&&G(p3))))'
Support contains 3 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 488 transition count 427
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 488 transition count 427
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 486 transition count 425
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 486 transition count 425
Applied a total of 32 rules in 39 ms. Remains 486 /502 variables (removed 16) and now considering 425/441 (removed 16) transitions.
// Phase 1: matrix 425 rows 486 cols
[2024-05-25 15:36:45] [INFO ] Computed 99 invariants in 3 ms
[2024-05-25 15:36:46] [INFO ] Implicit Places using invariants in 1590 ms returned []
[2024-05-25 15:36:46] [INFO ] Invariant cache hit.
[2024-05-25 15:36:54] [INFO ] Implicit Places using invariants and state equation in 7244 ms returned []
Implicit Place search using SMT with State Equation took 8839 ms to find 0 implicit places.
[2024-05-25 15:36:54] [INFO ] Invariant cache hit.
[2024-05-25 15:36:54] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/502 places, 425/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9200 ms. Remains : 486/502 places, 425/441 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), true, (NOT p1), (AND p3 (NOT p2)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=1 dest: 3}, { cond=(AND p0 p3), acceptance={} source=1 dest: 4}, { cond=(AND p0 p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s397 1), p3:(EQ s349 1), p1:(EQ s438 0), p2:(EQ s438 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-06 finished in 9644 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||(p1&&F(p2)))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Graph (trivial) has 239 edges and 502 vertex of which 6 / 502 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 1121 edges and 497 vertex of which 496 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 495 transition count 372
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 434 transition count 372
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 124 place count 434 transition count 270
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 348 place count 312 transition count 270
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 360 place count 300 transition count 258
Iterating global reduction 2 with 12 rules applied. Total rules applied 372 place count 300 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 256
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 256
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 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 626 place count 171 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 628 place count 170 transition count 137
Applied a total of 628 rules in 46 ms. Remains 170 /502 variables (removed 332) and now considering 137/441 (removed 304) transitions.
// Phase 1: matrix 137 rows 170 cols
[2024-05-25 15:36:54] [INFO ] Computed 75 invariants in 2 ms
[2024-05-25 15:37:02] [INFO ] Implicit Places using invariants in 7132 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 7148 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/502 places, 137/441 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7211 ms. Remains : 148/502 places, 137/441 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s100 0) (EQ s109 1)), p1:(EQ s109 0), p2:(EQ s109 1)], 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, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-07 finished in 7365 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(G(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Graph (trivial) has 239 edges and 502 vertex of which 6 / 502 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 1121 edges and 497 vertex of which 496 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 373
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 435 transition count 373
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 122 place count 435 transition count 271
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 346 place count 313 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 359 place count 300 transition count 258
Iterating global reduction 2 with 13 rules applied. Total rules applied 372 place count 300 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 256
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 256
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 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 626 place count 171 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 628 place count 170 transition count 137
Applied a total of 628 rules in 36 ms. Remains 170 /502 variables (removed 332) and now considering 137/441 (removed 304) transitions.
// Phase 1: matrix 137 rows 170 cols
[2024-05-25 15:37:02] [INFO ] Computed 75 invariants in 2 ms
[2024-05-25 15:37:02] [INFO ] Implicit Places using invariants in 146 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 162 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/502 places, 137/441 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 148/502 places, 137/441 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s123 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19859 reset in 211 ms.
Product exploration explored 100000 steps with 19888 reset in 271 ms.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/148 stabilizing places and 25/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 6 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 148 cols
[2024-05-25 15:37:03] [INFO ] Computed 53 invariants in 1 ms
[2024-05-25 15:37:03] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-25 15:37:03] [INFO ] Invariant cache hit.
[2024-05-25 15:37:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:37:03] [INFO ] Implicit Places using invariants and state equation in 253 ms returned [3, 25, 27, 33, 35, 37, 39, 41, 43, 45, 52, 54, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 517 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/148 places, 137/137 transitions.
Graph (complete) has 385 edges and 118 vertex of which 109 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
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 109 transition count 120
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 96 transition count 120
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 39 place count 84 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 51 place count 84 transition count 80
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 84 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 82 transition count 78
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 79 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 79 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 75 place count 71 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 69 transition count 67
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 69 transition count 66
Applied a total of 80 rules in 18 ms. Remains 69 /118 variables (removed 49) and now considering 66/137 (removed 71) transitions.
// Phase 1: matrix 66 rows 69 cols
[2024-05-25 15:37:03] [INFO ] Computed 16 invariants in 0 ms
[2024-05-25 15:37:03] [INFO ] Implicit Places using invariants in 75 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/148 places, 66/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 618 ms. Remains : 66/148 places, 66/137 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/66 stabilizing places and 12/66 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 45 steps, including 12 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20514 reset in 99 ms.
Product exploration explored 100000 steps with 20382 reset in 112 ms.
Built C files in :
/tmp/ltsmin1343390453869140119
[2024-05-25 15:37:04] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2024-05-25 15:37:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:04] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2024-05-25 15:37:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:04] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2024-05-25 15:37:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:37:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1343390453869140119
Running compilation step : cd /tmp/ltsmin1343390453869140119;'/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 293 ms.
Running link step : cd /tmp/ltsmin1343390453869140119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1343390453869140119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16168109220074991050.hoa' '--buchi-type=spotba'
LTSmin run took 367 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-08 finished in 3238 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(F((p0&&G(p1))))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 425
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 423
Applied a total of 36 rules in 27 ms. Remains 484 /502 variables (removed 18) and now considering 423/441 (removed 18) transitions.
// Phase 1: matrix 423 rows 484 cols
[2024-05-25 15:37:05] [INFO ] Computed 99 invariants in 4 ms
[2024-05-25 15:37:05] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-25 15:37:05] [INFO ] Invariant cache hit.
[2024-05-25 15:37:06] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2024-05-25 15:37:06] [INFO ] Invariant cache hit.
[2024-05-25 15:37:06] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/502 places, 423/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1302 ms. Remains : 484/502 places, 423/441 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s213 1), p1:(NEQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 675 reset in 156 ms.
Product exploration explored 100000 steps with 669 reset in 200 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1102 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/484 stabilizing places and 176/423 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:37:07] [INFO ] Invariant cache hit.
[2024-05-25 15:37:07] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2024-05-25 15:37:07] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 12 ms returned sat
[2024-05-25 15:37:08] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:37:08] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:37:08] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:37:08] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:37:08] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:37:08] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:37:08] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 5 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 0 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 3 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2968 ms
[2024-05-25 15:37:11] [INFO ] After 3157ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:37:11] [INFO ] After 3303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:37:11] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2024-05-25 15:37:11] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 13 ms returned sat
[2024-05-25 15:37:11] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2024-05-25 15:37:12] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:37:13] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:37:14] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:37:14] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2627 ms
[2024-05-25 15:37:14] [INFO ] After 2830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-25 15:37:14] [INFO ] After 3007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 423/423 transitions.
Graph (trivial) has 221 edges and 484 vertex of which 6 / 484 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1095 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 51 place count 478 transition count 366
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 429 transition count 366
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 100 place count 429 transition count 263
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 325 place count 307 transition count 263
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 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 591 place count 172 transition count 132
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 593 place count 171 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 595 place count 171 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 597 place count 169 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 598 place count 169 transition count 134
Applied a total of 598 rules in 56 ms. Remains 169 /484 variables (removed 315) and now considering 134/423 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 169/484 places, 134/423 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 423/423 transitions.
Applied a total of 0 rules in 15 ms. Remains 484 /484 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2024-05-25 15:37:14] [INFO ] Invariant cache hit.
[2024-05-25 15:37:15] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-25 15:37:15] [INFO ] Invariant cache hit.
[2024-05-25 15:37:16] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
[2024-05-25 15:37:16] [INFO ] Invariant cache hit.
[2024-05-25 15:37:16] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1708 ms. Remains : 484/484 places, 423/423 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1102 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/484 stabilizing places and 176/423 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:37:17] [INFO ] Invariant cache hit.
[2024-05-25 15:37:17] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2024-05-25 15:37:17] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 13 ms returned sat
[2024-05-25 15:37:17] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3297 ms
[2024-05-25 15:37:20] [INFO ] After 3509ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:37:20] [INFO ] After 3651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:37:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2024-05-25 15:37:20] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 14 ms returned sat
[2024-05-25 15:37:21] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:37:21] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2740 ms
[2024-05-25 15:37:23] [INFO ] After 2954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-25 15:37:23] [INFO ] After 3148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 423/423 transitions.
Graph (trivial) has 221 edges and 484 vertex of which 6 / 484 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1095 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 51 place count 478 transition count 366
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 429 transition count 366
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 100 place count 429 transition count 263
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 325 place count 307 transition count 263
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 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 591 place count 172 transition count 132
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 593 place count 171 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 595 place count 171 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 597 place count 169 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 598 place count 169 transition count 134
Applied a total of 598 rules in 23 ms. Remains 169 /484 variables (removed 315) and now considering 134/423 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 169/484 places, 134/423 transitions.
Finished random walk after 13 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 353 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 679 reset in 221 ms.
Product exploration explored 100000 steps with 671 reset in 236 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 423/423 transitions.
Graph (trivial) has 220 edges and 484 vertex of which 6 / 484 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 1096 edges and 479 vertex of which 478 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
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 478 transition count 416
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 73 Pre rules applied. Total rules applied 51 place count 478 transition count 467
Deduced a syphon composed of 122 places in 1 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 124 place count 478 transition count 467
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 140 place count 462 transition count 436
Deduced a syphon composed of 106 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 156 place count 462 transition count 436
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 265 places in 0 ms
Iterating global reduction 1 with 159 rules applied. Total rules applied 315 place count 462 transition count 436
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 353 place count 424 transition count 398
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 391 place count 424 transition count 398
Deduced a syphon composed of 227 places in 1 ms
Applied a total of 391 rules in 160 ms. Remains 424 /484 variables (removed 60) and now considering 398/423 (removed 25) transitions.
[2024-05-25 15:37:26] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 398 rows 424 cols
[2024-05-25 15:37:26] [INFO ] Computed 99 invariants in 6 ms
[2024-05-25 15:37:31] [INFO ] Dead Transitions using invariants and state equation in 5803 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/484 places, 398/423 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6048 ms. Remains : 424/484 places, 398/423 transitions.
Built C files in :
/tmp/ltsmin13006969658598183131
[2024-05-25 15:37:31] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13006969658598183131
Running compilation step : cd /tmp/ltsmin13006969658598183131;'/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 703 ms.
Running link step : cd /tmp/ltsmin13006969658598183131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13006969658598183131;'/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/stateBased437633534520973386.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 423/423 transitions.
Applied a total of 0 rules in 20 ms. Remains 484 /484 variables (removed 0) and now considering 423/423 (removed 0) transitions.
// Phase 1: matrix 423 rows 484 cols
[2024-05-25 15:37:47] [INFO ] Computed 99 invariants in 5 ms
[2024-05-25 15:37:47] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-25 15:37:47] [INFO ] Invariant cache hit.
[2024-05-25 15:37:48] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-05-25 15:37:48] [INFO ] Invariant cache hit.
[2024-05-25 15:37:48] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1530 ms. Remains : 484/484 places, 423/423 transitions.
Built C files in :
/tmp/ltsmin11913515888506697506
[2024-05-25 15:37:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11913515888506697506
Running compilation step : cd /tmp/ltsmin11913515888506697506;'/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 990 ms.
Running link step : cd /tmp/ltsmin11913515888506697506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11913515888506697506;'/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/stateBased14429779050302499292.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:38:03] [INFO ] Flatten gal took : 40 ms
[2024-05-25 15:38:04] [INFO ] Flatten gal took : 45 ms
[2024-05-25 15:38:04] [INFO ] Time to serialize gal into /tmp/LTL8283581209437272481.gal : 20 ms
[2024-05-25 15:38:04] [INFO ] Time to serialize properties into /tmp/LTL9901204906068210622.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8283581209437272481.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7664003670019679741.hoa' '-atoms' '/tmp/LTL9901204906068210622.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9901204906068210622.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7664003670019679741.hoa
Detected timeout of ITS tools.
[2024-05-25 15:38:19] [INFO ] Flatten gal took : 37 ms
[2024-05-25 15:38:19] [INFO ] Flatten gal took : 30 ms
[2024-05-25 15:38:19] [INFO ] Time to serialize gal into /tmp/LTL2012821438715871593.gal : 6 ms
[2024-05-25 15:38:19] [INFO ] Time to serialize properties into /tmp/LTL15237903540806334383.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2012821438715871593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15237903540806334383.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p239!=1)")&&(G("(p213!=1)")))))))
Formula 0 simplified : XXG(!"(p239!=1)" | F!"(p213!=1)")
Detected timeout of ITS tools.
[2024-05-25 15:38:34] [INFO ] Flatten gal took : 19 ms
[2024-05-25 15:38:34] [INFO ] Applying decomposition
[2024-05-25 15:38:34] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11965003303911248522.txt' '-o' '/tmp/graph11965003303911248522.bin' '-w' '/tmp/graph11965003303911248522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11965003303911248522.bin' '-l' '-1' '-v' '-w' '/tmp/graph11965003303911248522.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:38:34] [INFO ] Decomposing Gal with order
[2024-05-25 15:38:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:38:34] [INFO ] Removed a total of 270 redundant transitions.
[2024-05-25 15:38:34] [INFO ] Flatten gal took : 192 ms
[2024-05-25 15:38:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 33 ms.
[2024-05-25 15:38:35] [INFO ] Time to serialize gal into /tmp/LTL4833874918305884604.gal : 43 ms
[2024-05-25 15:38:35] [INFO ] Time to serialize properties into /tmp/LTL14900629906452031589.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4833874918305884604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14900629906452031589.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i1.i0.u80.p239!=1)")&&(G("(i12.u72.p213!=1)")))))))
Formula 0 simplified : XXG(!"(i1.i0.u80.p239!=1)" | F!"(i12.u72.p213!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4000333328759860574
[2024-05-25 15:38:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4000333328759860574
Running compilation step : cd /tmp/ltsmin4000333328759860574;'/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 800 ms.
Running link step : cd /tmp/ltsmin4000333328759860574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4000333328759860574;'/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' '--ltl' 'X(X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 119857 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' '!(((p0||X(p1)) U X(X(p2))))'
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 487 transition count 426
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 487 transition count 426
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 485 transition count 424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 485 transition count 424
Applied a total of 34 rules in 40 ms. Remains 485 /502 variables (removed 17) and now considering 424/441 (removed 17) transitions.
// Phase 1: matrix 424 rows 485 cols
[2024-05-25 15:39:05] [INFO ] Computed 99 invariants in 7 ms
[2024-05-25 15:39:05] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-25 15:39:05] [INFO ] Invariant cache hit.
[2024-05-25 15:39:06] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2024-05-25 15:39:06] [INFO ] Invariant cache hit.
[2024-05-25 15:39:06] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/502 places, 424/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1380 ms. Remains : 485/502 places, 424/441 transitions.
Stuttering acceptance computed with spot in 551 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}]], initial=3, aps=[p0:(NEQ s76 1), p1:(EQ s411 1), p2:(AND (EQ s112 1) (EQ s308 1) (EQ s473 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-11 finished in 1977 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((F(p0)||(p1&&F(G(p2)))))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 487 transition count 426
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 487 transition count 426
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 485 transition count 424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 485 transition count 424
Applied a total of 34 rules in 40 ms. Remains 485 /502 variables (removed 17) and now considering 424/441 (removed 17) transitions.
// Phase 1: matrix 424 rows 485 cols
[2024-05-25 15:39:07] [INFO ] Computed 99 invariants in 5 ms
[2024-05-25 15:39:07] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-25 15:39:07] [INFO ] Invariant cache hit.
[2024-05-25 15:39:08] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2024-05-25 15:39:08] [INFO ] Invariant cache hit.
[2024-05-25 15:39:08] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/502 places, 424/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1515 ms. Remains : 485/502 places, 424/441 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s253 0), p1:(EQ s326 1), p2:(AND (EQ s462 1) (EQ s465 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 804 reset in 385 ms.
Product exploration explored 100000 steps with 808 reset in 394 ms.
Computed a total of 205 stabilizing places and 177 stable transitions
Graph (complete) has 1103 edges and 485 vertex of which 484 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 205 stabilizing places and 177 stable transitions
Detected a total of 205/485 stabilizing places and 177/424 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 203 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:39:10] [INFO ] Invariant cache hit.
[2024-05-25 15:39:10] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:39:10] [INFO ] [Nat]Absence check using 59 positive place invariants in 18 ms returned sat
[2024-05-25 15:39:10] [INFO ] [Nat]Absence check using 59 positive and 40 generalized place invariants in 13 ms returned sat
[2024-05-25 15:39:11] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:39:11] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:39:11] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:39:11] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:39:11] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:39:11] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:39:11] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 0 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:39:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1552 ms
[2024-05-25 15:39:12] [INFO ] After 1794ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2024-05-25 15:39:12] [INFO ] After 1920ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 465 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 485 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 424/424 transitions.
Graph (trivial) has 221 edges and 485 vertex of which 6 / 485 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 1097 edges and 480 vertex of which 479 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 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 478 transition count 365
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 427 transition count 365
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 427 transition count 264
Deduced a syphon composed of 101 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 326 place count 306 transition count 264
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 586 place count 174 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 588 place count 173 transition count 140
Applied a total of 588 rules in 36 ms. Remains 173 /485 variables (removed 312) and now considering 140/424 (removed 284) transitions.
// Phase 1: matrix 140 rows 173 cols
[2024-05-25 15:39:13] [INFO ] Computed 75 invariants in 2 ms
[2024-05-25 15:39:13] [INFO ] Implicit Places using invariants in 164 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 178 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/485 places, 140/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 151/485 places, 140/424 transitions.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/151 stabilizing places and 25/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 348 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 25 steps with 4 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-12 finished in 7416 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(p0)||F(G((p1||X(X((p2 U p3))))))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 489 transition count 428
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 489 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 487 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 487 transition count 426
Applied a total of 30 rules in 29 ms. Remains 487 /502 variables (removed 15) and now considering 426/441 (removed 15) transitions.
// Phase 1: matrix 426 rows 487 cols
[2024-05-25 15:39:14] [INFO ] Computed 99 invariants in 3 ms
[2024-05-25 15:39:14] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-25 15:39:14] [INFO ] Invariant cache hit.
[2024-05-25 15:39:15] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2024-05-25 15:39:15] [INFO ] Invariant cache hit.
[2024-05-25 15:39:16] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 487/502 places, 426/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1548 ms. Remains : 487/502 places, 426/441 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(NOT p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s186 1), p1:(EQ s306 1), p3:(EQ s312 1), p2:(EQ s278 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]]
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-13 finished in 1887 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 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Graph (trivial) has 240 edges and 502 vertex of which 6 / 502 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 1121 edges and 497 vertex of which 496 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 495 transition count 372
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 434 transition count 372
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 124 place count 434 transition count 271
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 346 place count 313 transition count 271
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 359 place count 300 transition count 258
Iterating global reduction 2 with 13 rules applied. Total rules applied 372 place count 300 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 256
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 256
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 628 place count 170 transition count 132
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 630 place count 169 transition count 136
Applied a total of 630 rules in 26 ms. Remains 169 /502 variables (removed 333) and now considering 136/441 (removed 305) transitions.
// Phase 1: matrix 136 rows 169 cols
[2024-05-25 15:39:16] [INFO ] Computed 75 invariants in 2 ms
[2024-05-25 15:39:16] [INFO ] Implicit Places using invariants in 149 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 163 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/502 places, 136/441 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 147/502 places, 136/441 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-14 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 s62 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-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-14 finished in 302 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 U X(X(X((!p0 U (p1||G(!p0)))))))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 488 transition count 427
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 488 transition count 427
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 486 transition count 425
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 486 transition count 425
Applied a total of 32 rules in 22 ms. Remains 486 /502 variables (removed 16) and now considering 425/441 (removed 16) transitions.
// Phase 1: matrix 425 rows 486 cols
[2024-05-25 15:39:16] [INFO ] Computed 99 invariants in 5 ms
[2024-05-25 15:39:19] [INFO ] Implicit Places using invariants in 2361 ms returned []
[2024-05-25 15:39:19] [INFO ] Invariant cache hit.
[2024-05-25 15:39:19] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 3083 ms to find 0 implicit places.
[2024-05-25 15:39:19] [INFO ] Invariant cache hit.
[2024-05-25 15:39:20] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/502 places, 425/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3395 ms. Remains : 486/502 places, 425/441 transitions.
Stuttering acceptance computed with spot in 593 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 11}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 1}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}], [{ cond=p0, acceptance={} source=10 dest: 4}, { cond=(NOT p0), acceptance={} source=10 dest: 7}], [{ cond=(NOT p0), acceptance={} source=11 dest: 6}, { cond=p0, acceptance={} source=11 dest: 10}]], initial=3, aps=[p0:(EQ s406 1), p1:(AND (NEQ s406 1) (NEQ s422 1))], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 230 ms.
Product exploration explored 100000 steps with 20000 reset in 233 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1106 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 408116 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 408116 steps, saw 70287 distinct states, run finished after 3007 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:39:24] [INFO ] Invariant cache hit.
[2024-05-25 15:39:25] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2024-05-25 15:39:25] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 14 ms returned sat
[2024-05-25 15:39:25] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:39:25] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2024-05-25 15:39:26] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 39 places in 4840 ms of which 25 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:39:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6165 ms
[2024-05-25 15:39:31] [INFO ] After 6448ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:39:31] [INFO ] After 6627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:39:31] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2024-05-25 15:39:31] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 12 ms returned sat
[2024-05-25 15:39:31] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:39:32] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1432 ms
[2024-05-25 15:39:33] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:39:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-25 15:39:33] [INFO ] After 1838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-25 15:39:33] [INFO ] After 2021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 223 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1099 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 480 transition count 367
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 430 transition count 367
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 430 transition count 263
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 330 place count 306 transition count 263
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 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 596 place count 171 transition count 132
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 598 place count 170 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 170 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 602 place count 168 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 168 transition count 134
Applied a total of 603 rules in 33 ms. Remains 168 /486 variables (removed 318) and now considering 134/425 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 168/486 places, 134/425 transitions.
Incomplete random walk after 10000 steps, including 289 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 191 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 168 cols
[2024-05-25 15:39:33] [INFO ] Computed 75 invariants in 1 ms
[2024-05-25 15:39:33] [INFO ] [Real]Absence check using 60 positive place invariants in 13 ms returned sat
[2024-05-25 15:39:33] [INFO ] [Real]Absence check using 60 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-25 15:39:33] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:39:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 15:39:33] [INFO ] After 11ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:39:33] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:39:33] [INFO ] [Nat]Absence check using 60 positive place invariants in 9 ms returned sat
[2024-05-25 15:39:33] [INFO ] [Nat]Absence check using 60 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-25 15:39:34] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:39:34] [INFO ] After 24ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:39:34] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 15:39:34] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 263 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 425/425 transitions.
Applied a total of 0 rules in 9 ms. Remains 486 /486 variables (removed 0) and now considering 425/425 (removed 0) transitions.
// Phase 1: matrix 425 rows 486 cols
[2024-05-25 15:39:34] [INFO ] Computed 99 invariants in 4 ms
[2024-05-25 15:39:35] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-25 15:39:35] [INFO ] Invariant cache hit.
[2024-05-25 15:39:35] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2024-05-25 15:39:35] [INFO ] Invariant cache hit.
[2024-05-25 15:39:36] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1443 ms. Remains : 486/486 places, 425/425 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1106 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 427414 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427414 steps, saw 72956 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:39:40] [INFO ] Invariant cache hit.
[2024-05-25 15:39:40] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2024-05-25 15:39:40] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 14 ms returned sat
[2024-05-25 15:39:40] [INFO ] After 208ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 0 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 0 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 0 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1585 ms
[2024-05-25 15:39:42] [INFO ] After 1811ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:39:42] [INFO ] After 1988ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:39:42] [INFO ] [Nat]Absence check using 58 positive place invariants in 15 ms returned sat
[2024-05-25 15:39:42] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2024-05-25 15:39:42] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1389 ms
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-25 15:39:43] [INFO ] After 1821ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-25 15:39:44] [INFO ] After 2012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 223 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1099 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 480 transition count 367
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 430 transition count 367
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 430 transition count 263
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 330 place count 306 transition count 263
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 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 596 place count 171 transition count 132
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 598 place count 170 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 170 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 602 place count 168 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 168 transition count 134
Applied a total of 603 rules in 42 ms. Remains 168 /486 variables (removed 318) and now considering 134/425 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 168/486 places, 134/425 transitions.
Incomplete random walk after 10000 steps, including 285 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 178 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 168 cols
[2024-05-25 15:39:44] [INFO ] Computed 75 invariants in 2 ms
[2024-05-25 15:39:44] [INFO ] [Real]Absence check using 60 positive place invariants in 10 ms returned sat
[2024-05-25 15:39:44] [INFO ] [Real]Absence check using 60 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-25 15:39:44] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:39:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 15:39:44] [INFO ] After 10ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:39:44] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:39:44] [INFO ] [Nat]Absence check using 60 positive place invariants in 9 ms returned sat
[2024-05-25 15:39:44] [INFO ] [Nat]Absence check using 60 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-25 15:39:44] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:39:44] [INFO ] After 10ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:39:44] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 15:39:44] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 237 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 249 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 244 ms.
Product exploration explored 100000 steps with 20000 reset in 238 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 395 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 223 edges and 486 vertex of which 6 / 486 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 1100 edges and 481 vertex of which 480 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
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 480 transition count 418
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 52 place count 480 transition count 473
Deduced a syphon composed of 124 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 126 place count 480 transition count 473
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 143 place count 463 transition count 440
Deduced a syphon composed of 107 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 160 place count 463 transition count 440
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 267 places in 0 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 320 place count 463 transition count 440
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 358 place count 425 transition count 402
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 396 place count 425 transition count 402
Deduced a syphon composed of 229 places in 0 ms
Applied a total of 396 rules in 51 ms. Remains 425 /486 variables (removed 61) and now considering 402/425 (removed 23) transitions.
[2024-05-25 15:39:46] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 402 rows 425 cols
[2024-05-25 15:39:46] [INFO ] Computed 99 invariants in 7 ms
[2024-05-25 15:39:47] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/486 places, 402/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 559 ms. Remains : 425/486 places, 402/425 transitions.
Built C files in :
/tmp/ltsmin4788991325074068977
[2024-05-25 15:39:47] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4788991325074068977
Running compilation step : cd /tmp/ltsmin4788991325074068977;'/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 835 ms.
Running link step : cd /tmp/ltsmin4788991325074068977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4788991325074068977;'/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/stateBased16578845483676959141.hoa' '--buchi-type=spotba'
LTSmin run took 2799 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-15 finished in 33938 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(F((p0&&G(p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-15-LTLFireability-10
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 502/502 places, 441/441 transitions.
Graph (trivial) has 238 edges and 502 vertex of which 6 / 502 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 1121 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 373
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 435 transition count 373
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 122 place count 435 transition count 273
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 340 place count 317 transition count 273
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 354 place count 303 transition count 259
Iterating global reduction 2 with 14 rules applied. Total rules applied 368 place count 303 transition count 259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 368 place count 303 transition count 257
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 372 place count 301 transition count 257
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 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 622 place count 174 transition count 134
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 624 place count 173 transition count 138
Applied a total of 624 rules in 42 ms. Remains 173 /502 variables (removed 329) and now considering 138/441 (removed 303) transitions.
// Phase 1: matrix 138 rows 173 cols
[2024-05-25 15:39:51] [INFO ] Computed 77 invariants in 2 ms
[2024-05-25 15:39:51] [INFO ] Implicit Places using invariants in 175 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 51, 52, 53, 54, 57, 58, 144, 148]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 177 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 149/502 places, 138/441 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 222 ms. Remains : 149/502 places, 138/441 transitions.
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s36 1), p1:(NEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21524 reset in 185 ms.
Product exploration explored 100000 steps with 21464 reset in 200 ms.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/149 stabilizing places and 26/138 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 62 steps, including 14 resets, run visited all 3 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 138/138 transitions.
Applied a total of 0 rules in 0 ms. Remains 149 /149 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 149 cols
[2024-05-25 15:39:52] [INFO ] Computed 53 invariants in 1 ms
[2024-05-25 15:39:53] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-25 15:39:53] [INFO ] Invariant cache hit.
[2024-05-25 15:39:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:39:53] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [3, 25, 27, 38, 40, 42, 44, 46, 48, 50, 57, 59, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 343 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/149 places, 138/138 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 113 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 112 transition count 130
Applied a total of 14 rules in 6 ms. Remains 112 /119 variables (removed 7) and now considering 130/138 (removed 8) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-25 15:39:53] [INFO ] Computed 23 invariants in 1 ms
[2024-05-25 15:39:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-25 15:39:53] [INFO ] Invariant cache hit.
[2024-05-25 15:39:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:39:53] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/149 places, 130/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 584 ms. Remains : 112/149 places, 130/138 transitions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 371 edges and 112 vertex of which 103 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 21 stable transitions
Detected a total of 19/112 stabilizing places and 21/130 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 98 steps, including 17 resets, run visited all 3 properties in 6 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 21433 reset in 115 ms.
Product exploration explored 100000 steps with 21413 reset in 128 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Graph (complete) has 371 edges and 112 vertex of which 103 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 103 transition count 126
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 94 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 94 transition count 90
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 94 transition count 93
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 38 rules in 6 ms. Remains 94 /112 variables (removed 18) and now considering 93/130 (removed 37) transitions.
[2024-05-25 15:39:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 93 rows 94 cols
[2024-05-25 15:39:55] [INFO ] Computed 18 invariants in 0 ms
[2024-05-25 15:39:55] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/112 places, 93/130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 94/112 places, 93/130 transitions.
Built C files in :
/tmp/ltsmin14342011250070248533
[2024-05-25 15:39:55] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14342011250070248533
Running compilation step : cd /tmp/ltsmin14342011250070248533;'/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 303 ms.
Running link step : cd /tmp/ltsmin14342011250070248533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14342011250070248533;'/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/stateBased12863031164063956774.hoa' '--buchi-type=spotba'
LTSmin run took 587 ms.
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 5794 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-10 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-25 15:39:56] [INFO ] Flatten gal took : 21 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 238334 ms.

BK_STOP 1716651596952

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-15"
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-15, 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-171620414900353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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