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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 192K 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-20-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651613854

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-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:40:15] [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:40:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:40:15] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-25 15:40:15] [INFO ] Transformed 782 places.
[2024-05-25 15:40:15] [INFO ] Transformed 697 transitions.
[2024-05-25 15:40:15] [INFO ] Found NUPN structural information;
[2024-05-25 15:40:15] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 63 places in 19 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 115 place count 604 transition count 537
Iterating global reduction 1 with 101 rules applied. Total rules applied 216 place count 604 transition count 537
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 269 place count 551 transition count 484
Iterating global reduction 1 with 53 rules applied. Total rules applied 322 place count 551 transition count 484
Applied a total of 322 rules in 128 ms. Remains 551 /719 variables (removed 168) and now considering 484/638 (removed 154) transitions.
// Phase 1: matrix 484 rows 551 cols
[2024-05-25 15:40:16] [INFO ] Computed 107 invariants in 33 ms
[2024-05-25 15:40:16] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-25 15:40:16] [INFO ] Invariant cache hit.
[2024-05-25 15:40:17] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2024-05-25 15:40:17] [INFO ] Invariant cache hit.
[2024-05-25 15:40:17] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 551/719 places, 484/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1347 ms. Remains : 551/719 places, 484/638 transitions.
Support contains 40 out of 551 places after structural reductions.
[2024-05-25 15:40:17] [INFO ] Flatten gal took : 68 ms
[2024-05-25 15:40:17] [INFO ] Flatten gal took : 28 ms
[2024-05-25 15:40:17] [INFO ] Input system was already deterministic with 484 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 34) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-25 15:40:18] [INFO ] Invariant cache hit.
[2024-05-25 15:40:18] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2024-05-25 15:40:18] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-25 15:40:18] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-25 15:40:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2024-05-25 15:40:19] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-25 15:40:19] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 9 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1279 ms
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 365 ms
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 0 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2024-05-25 15:40:22] [INFO ] After 3319ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 276 ms.
[2024-05-25 15:40:22] [INFO ] After 3951ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 19 Parikh solutions to 15 different solutions.
Parikh walk visited 5 properties in 310 ms.
Support contains 13 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 251 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 544 transition count 408
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 477 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 476 transition count 407
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 138 place count 476 transition count 298
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 237 rules applied. Total rules applied 375 place count 348 transition count 298
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 382 place count 341 transition count 291
Iterating global reduction 3 with 7 rules applied. Total rules applied 389 place count 341 transition count 291
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 657 place count 206 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 661 place count 204 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 663 place count 204 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 665 place count 202 transition count 163
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 670 place count 202 transition count 163
Applied a total of 670 rules in 135 ms. Remains 202 /551 variables (removed 349) and now considering 163/484 (removed 321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 202/551 places, 163/484 transitions.
Incomplete random walk after 10000 steps, including 410 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:40:23] [INFO ] Flow matrix only has 162 transitions (discarded 1 similar events)
// Phase 1: matrix 162 rows 202 cols
[2024-05-25 15:40:23] [INFO ] Computed 86 invariants in 3 ms
[2024-05-25 15:40:23] [INFO ] [Real]Absence check using 66 positive place invariants in 9 ms returned sat
[2024-05-25 15:40:23] [INFO ] [Real]Absence check using 66 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-25 15:40:23] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:40:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-25 15:40:23] [INFO ] After 11ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:23] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 10 ms returned sat
[2024-05-25 15:40:23] [INFO ] [Nat]Absence check using 66 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-25 15:40:23] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:40:23] [INFO ] After 11ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:40:23] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-25 15:40:23] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 163/163 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 202 transition count 159
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 198 transition count 159
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 198 transition count 155
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 19 place count 191 transition count 155
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 39 place count 180 transition count 146
Applied a total of 39 rules in 22 ms. Remains 180 /202 variables (removed 22) and now considering 146/163 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 180/202 places, 146/163 transitions.
Incomplete random walk after 10000 steps, including 532 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 209 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 931459 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 931459 steps, saw 343006 distinct states, run finished after 3003 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:40:26] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
// Phase 1: matrix 145 rows 180 cols
[2024-05-25 15:40:26] [INFO ] Computed 81 invariants in 5 ms
[2024-05-25 15:40:26] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2024-05-25 15:40:26] [INFO ] [Real]Absence check using 65 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-25 15:40:26] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:40:26] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-25 15:40:26] [INFO ] After 15ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:26] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2024-05-25 15:40:27] [INFO ] [Nat]Absence check using 65 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-25 15:40:27] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:40:27] [INFO ] After 17ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:40:27] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 15:40:27] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 146/146 transitions.
Applied a total of 0 rules in 13 ms. Remains 180 /180 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 180/180 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 146/146 transitions.
Applied a total of 0 rules in 13 ms. Remains 180 /180 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2024-05-25 15:40:27] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
[2024-05-25 15:40:27] [INFO ] Invariant cache hit.
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants in 145 ms returned [11, 13, 15, 17, 19, 21, 23, 25, 27, 28, 29, 30, 31, 32, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 35 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 150 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 145/180 places, 143/146 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 139 transition count 119
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 139 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 138 transition count 124
Applied a total of 14 rules in 16 ms. Remains 138 /145 variables (removed 7) and now considering 124/143 (removed 19) transitions.
[2024-05-25 15:40:27] [INFO ] Flow matrix only has 123 transitions (discarded 1 similar events)
// Phase 1: matrix 123 rows 138 cols
[2024-05-25 15:40:27] [INFO ] Computed 49 invariants in 1 ms
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-25 15:40:27] [INFO ] Flow matrix only has 123 transitions (discarded 1 similar events)
[2024-05-25 15:40:27] [INFO ] Invariant cache hit.
[2024-05-25 15:40:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [6, 28, 30, 32, 40, 74, 76, 78, 80, 82, 84, 86]
Discarding 12 places :
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 252 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/180 places, 117/146 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 113
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 122 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 118 transition count 100
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 118 transition count 100
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 118 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 117 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 116 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 116 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 22 place count 116 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 23 place count 115 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 29 place count 112 transition count 93
Applied a total of 29 rules in 20 ms. Remains 112 /126 variables (removed 14) and now considering 93/117 (removed 24) transitions.
[2024-05-25 15:40:27] [INFO ] Flow matrix only has 92 transitions (discarded 1 similar events)
// Phase 1: matrix 92 rows 112 cols
[2024-05-25 15:40:27] [INFO ] Computed 38 invariants in 1 ms
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants in 73 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 109/180 places, 93/146 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 90
Applied a total of 6 rules in 9 ms. Remains 106 /109 variables (removed 3) and now considering 90/93 (removed 3) transitions.
[2024-05-25 15:40:27] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
// Phase 1: matrix 89 rows 106 cols
[2024-05-25 15:40:27] [INFO ] Computed 35 invariants in 3 ms
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-25 15:40:27] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
[2024-05-25 15:40:27] [INFO ] Invariant cache hit.
[2024-05-25 15:40:27] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [24, 26, 28]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 197 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 103/180 places, 90/146 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 89 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 26 place count 86 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 86 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 85 transition count 77
Applied a total of 31 rules in 11 ms. Remains 85 /103 variables (removed 18) and now considering 77/90 (removed 13) transitions.
[2024-05-25 15:40:27] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
// Phase 1: matrix 76 rows 85 cols
[2024-05-25 15:40:27] [INFO ] Computed 27 invariants in 1 ms
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-25 15:40:27] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2024-05-25 15:40:27] [INFO ] Invariant cache hit.
[2024-05-25 15:40:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-25 15:40:28] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 85/180 places, 77/146 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 887 ms. Remains : 85/180 places, 77/146 transitions.
Finished random walk after 2622 steps, including 197 resets, run visited all 1 properties in 5 ms. (steps per millisecond=524 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 483 stabilizing places and 426 stable transitions
Graph (complete) has 1230 edges and 551 vertex of which 549 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 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))))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 475
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 475
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 471
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 471
Applied a total of 26 rules in 36 ms. Remains 538 /551 variables (removed 13) and now considering 471/484 (removed 13) transitions.
// Phase 1: matrix 471 rows 538 cols
[2024-05-25 15:40:28] [INFO ] Computed 107 invariants in 5 ms
[2024-05-25 15:40:28] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-25 15:40:28] [INFO ] Invariant cache hit.
[2024-05-25 15:40:29] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2024-05-25 15:40:29] [INFO ] Invariant cache hit.
[2024-05-25 15:40:29] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 471/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1148 ms. Remains : 538/551 places, 471/484 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 226 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s479 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][false, false, false]]
Stuttering criterion allowed to conclude after 176 steps with 0 reset in 16 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-00 finished in 1454 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((G((X(F(p0))&&(X(p1) U p2)))||p3))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 475
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 475
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 471
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 471
Applied a total of 26 rules in 37 ms. Remains 538 /551 variables (removed 13) and now considering 471/484 (removed 13) transitions.
[2024-05-25 15:40:30] [INFO ] Invariant cache hit.
[2024-05-25 15:40:30] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-25 15:40:30] [INFO ] Invariant cache hit.
[2024-05-25 15:40:30] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2024-05-25 15:40:30] [INFO ] Invariant cache hit.
[2024-05-25 15:40:31] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 471/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1087 ms. Remains : 538/551 places, 471/484 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s264 0), p0:(EQ s375 1), p2:(EQ s481 1), p1:(EQ s211 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 408 ms.
Product exploration explored 100000 steps with 33333 reset in 328 ms.
Computed a total of 470 stabilizing places and 413 stable transitions
Graph (complete) has 1209 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 470 stabilizing places and 413 stable transitions
Detected a total of 470/538 stabilizing places and 413/471 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p3)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 33 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-01 finished in 2213 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(G(p0))))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 476
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 476
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 473
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 473
Applied a total of 22 rules in 27 ms. Remains 540 /551 variables (removed 11) and now considering 473/484 (removed 11) transitions.
// Phase 1: matrix 473 rows 540 cols
[2024-05-25 15:40:32] [INFO ] Computed 107 invariants in 4 ms
[2024-05-25 15:40:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-25 15:40:32] [INFO ] Invariant cache hit.
[2024-05-25 15:40:33] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2024-05-25 15:40:33] [INFO ] Invariant cache hit.
[2024-05-25 15:40:33] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/551 places, 473/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1156 ms. Remains : 540/551 places, 473/484 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s501 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-02 finished in 1342 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((X(p0)||F((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 475
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 475
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 471
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 471
Applied a total of 26 rules in 48 ms. Remains 538 /551 variables (removed 13) and now considering 471/484 (removed 13) transitions.
// Phase 1: matrix 471 rows 538 cols
[2024-05-25 15:40:33] [INFO ] Computed 107 invariants in 4 ms
[2024-05-25 15:40:33] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-25 15:40:33] [INFO ] Invariant cache hit.
[2024-05-25 15:40:34] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2024-05-25 15:40:34] [INFO ] Invariant cache hit.
[2024-05-25 15:40:34] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 471/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1165 ms. Remains : 538/551 places, 471/484 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s431 1), p0:(OR (EQ s431 0) (EQ s522 0)), p2:(NEQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33336 reset in 355 ms.
Product exploration explored 100000 steps with 33357 reset in 368 ms.
Computed a total of 470 stabilizing places and 413 stable transitions
Graph (complete) has 1209 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 470 stabilizing places and 413 stable transitions
Detected a total of 470/538 stabilizing places and 413/471 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 912 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-25 15:40:37] [INFO ] Invariant cache hit.
[2024-05-25 15:40:37] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 15:40:37] [INFO ] [Nat]Absence check using 64 positive place invariants in 18 ms returned sat
[2024-05-25 15:40:37] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2024-05-25 15:40:38] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 337 ms
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2024-05-25 15:40:38] [INFO ] After 1086ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-25 15:40:38] [INFO ] After 1341ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 148 ms.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 471/471 transitions.
Graph (trivial) has 250 edges and 538 vertex of which 6 / 538 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 1202 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 531 transition count 394
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 463 transition count 394
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 138 place count 463 transition count 283
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 382 place count 330 transition count 283
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 664 place count 187 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 668 place count 185 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 670 place count 185 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 672 place count 183 transition count 149
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 677 place count 183 transition count 149
Applied a total of 677 rules in 61 ms. Remains 183 /538 variables (removed 355) and now considering 149/471 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 183/538 places, 149/471 transitions.
Incomplete random walk after 10000 steps, including 507 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :1
Finished Best-First random walk after 1134 steps, including 15 resets, run visited all 2 properties in 7 ms. (steps per millisecond=162 )
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 2949 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 471/471 transitions.
Applied a total of 0 rules in 8 ms. Remains 538 /538 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2024-05-25 15:40:42] [INFO ] Invariant cache hit.
[2024-05-25 15:40:43] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-25 15:40:43] [INFO ] Invariant cache hit.
[2024-05-25 15:40:43] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2024-05-25 15:40:43] [INFO ] Invariant cache hit.
[2024-05-25 15:40:44] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1340 ms. Remains : 538/538 places, 471/471 transitions.
Computed a total of 470 stabilizing places and 413 stable transitions
Graph (complete) has 1209 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 470 stabilizing places and 413 stable transitions
Detected a total of 470/538 stabilizing places and 413/471 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:40:45] [INFO ] Invariant cache hit.
[2024-05-25 15:40:45] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:40:45] [INFO ] [Nat]Absence check using 64 positive place invariants in 21 ms returned sat
[2024-05-25 15:40:45] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 15 ms returned sat
[2024-05-25 15:40:45] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 2 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 14 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1449 ms
[2024-05-25 15:40:47] [INFO ] After 1926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 211 ms.
[2024-05-25 15:40:47] [INFO ] After 2305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 94 ms.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 471/471 transitions.
Graph (trivial) has 250 edges and 538 vertex of which 6 / 538 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 1202 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 531 transition count 394
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 463 transition count 394
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 138 place count 463 transition count 283
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 382 place count 330 transition count 283
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 664 place count 187 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 668 place count 185 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 670 place count 185 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 672 place count 183 transition count 149
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 677 place count 183 transition count 149
Applied a total of 677 rules in 66 ms. Remains 183 /538 variables (removed 355) and now considering 149/471 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 183/538 places, 149/471 transitions.
Incomplete random walk after 10000 steps, including 449 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :1
Finished Best-First random walk after 397 steps, including 4 resets, run visited all 2 properties in 16 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 694 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2257 reset in 269 ms.
Product exploration explored 100000 steps with 2331 reset in 309 ms.
Built C files in :
/tmp/ltsmin8269732832974437051
[2024-05-25 15:40:50] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8269732832974437051
Running compilation step : cd /tmp/ltsmin8269732832974437051;'/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 1062 ms.
Running link step : cd /tmp/ltsmin8269732832974437051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin8269732832974437051;'/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/stateBased17154734132864501399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 471/471 transitions.
Applied a total of 0 rules in 18 ms. Remains 538 /538 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2024-05-25 15:41:05] [INFO ] Invariant cache hit.
[2024-05-25 15:41:05] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-25 15:41:05] [INFO ] Invariant cache hit.
[2024-05-25 15:41:06] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2024-05-25 15:41:06] [INFO ] Invariant cache hit.
[2024-05-25 15:41:06] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1220 ms. Remains : 538/538 places, 471/471 transitions.
Built C files in :
/tmp/ltsmin7647517283254842854
[2024-05-25 15:41:06] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7647517283254842854
Running compilation step : cd /tmp/ltsmin7647517283254842854;'/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 825 ms.
Running link step : cd /tmp/ltsmin7647517283254842854;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7647517283254842854;'/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/stateBased13385985802906161033.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:41:21] [INFO ] Flatten gal took : 54 ms
[2024-05-25 15:41:22] [INFO ] Flatten gal took : 48 ms
[2024-05-25 15:41:22] [INFO ] Time to serialize gal into /tmp/LTL10403849333463180024.gal : 14 ms
[2024-05-25 15:41:22] [INFO ] Time to serialize properties into /tmp/LTL2411448559412446296.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/LTL10403849333463180024.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8789176820987754407.hoa' '-atoms' '/tmp/LTL2411448559412446296.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...318
Loading property file /tmp/LTL2411448559412446296.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8789176820987754407.hoa
Detected timeout of ITS tools.
[2024-05-25 15:41:37] [INFO ] Flatten gal took : 19 ms
[2024-05-25 15:41:37] [INFO ] Flatten gal took : 25 ms
[2024-05-25 15:41:37] [INFO ] Time to serialize gal into /tmp/LTL3895869060122492603.gal : 5 ms
[2024-05-25 15:41:37] [INFO ] Time to serialize properties into /tmp/LTL5692327866731794132.ltl : 2 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/LTL3895869060122492603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5692327866731794132.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...275
Read 1 LTL properties
Checking formula 0 : !((G((X("((p564==0)||(p766==0))"))||(F(("(p564!=1)")&&(X(("(p564!=1)")U(("(p75!=1)")||(G("(p564!=1)"))))))))))
Formula 0 simplified : F(X!"((p564==0)||(p766==0))" & G(!"(p564!=1)" | X(!"(p564!=1)" M !"(p75!=1)")))
Detected timeout of ITS tools.
[2024-05-25 15:41:52] [INFO ] Flatten gal took : 42 ms
[2024-05-25 15:41:52] [INFO ] Applying decomposition
[2024-05-25 15:41:52] [INFO ] Flatten gal took : 33 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/graph7265541290564634498.txt' '-o' '/tmp/graph7265541290564634498.bin' '-w' '/tmp/graph7265541290564634498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7265541290564634498.bin' '-l' '-1' '-v' '-w' '/tmp/graph7265541290564634498.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:41:52] [INFO ] Decomposing Gal with order
[2024-05-25 15:41:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:41:52] [INFO ] Removed a total of 286 redundant transitions.
[2024-05-25 15:41:52] [INFO ] Flatten gal took : 68 ms
[2024-05-25 15:41:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 14 ms.
[2024-05-25 15:41:52] [INFO ] Time to serialize gal into /tmp/LTL286394107972423198.gal : 8 ms
[2024-05-25 15:41:52] [INFO ] Time to serialize properties into /tmp/LTL9188163136148462142.ltl : 1 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/LTL286394107972423198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9188163136148462142.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...253
Read 1 LTL properties
Checking formula 0 : !((G((X("((i0.i2.u149.p564==0)||(i19.i0.u187.p766==0))"))||(F(("(i0.i2.u149.p564!=1)")&&(X(("(i0.i2.u149.p564!=1)")U(("(i19.i0.u26.p75...198
Formula 0 simplified : F(X!"((i0.i2.u149.p564==0)||(i19.i0.u187.p766==0))" & G(!"(i0.i2.u149.p564!=1)" | X(!"(i0.i2.u149.p564!=1)" M !"(i19.i0.u26.p75!=1)"...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin54299362016696207
[2024-05-25 15:42:07] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin54299362016696207
Running compilation step : cd /tmp/ltsmin54299362016696207;'/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 944 ms.
Running link step : cd /tmp/ltsmin54299362016696207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin54299362016696207;'/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((LTLAPp0==true))||<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 109257 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||X((p1||(p2&&G(p3)))))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 476
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 476
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 472
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 472
Applied a total of 24 rules in 49 ms. Remains 539 /551 variables (removed 12) and now considering 472/484 (removed 12) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-25 15:42:22] [INFO ] Computed 107 invariants in 8 ms
[2024-05-25 15:42:23] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-25 15:42:23] [INFO ] Invariant cache hit.
[2024-05-25 15:42:23] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
[2024-05-25 15:42:23] [INFO ] Invariant cache hit.
[2024-05-25 15:42:24] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 472/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1356 ms. Remains : 539/551 places, 472/484 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s47 0), p1:(EQ s159 0), p2:(EQ s499 0), p3:(EQ s169 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 524 reset in 245 ms.
Product exploration explored 100000 steps with 520 reset in 272 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), true, (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 367 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:42:25] [INFO ] Invariant cache hit.
[2024-05-25 15:42:26] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:42:26] [INFO ] [Nat]Absence check using 64 positive place invariants in 22 ms returned sat
[2024-05-25 15:42:26] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 17 ms returned sat
[2024-05-25 15:42:26] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:42:26] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-25 15:42:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-25 15:42:26] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-25 15:42:26] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 249 edges and 539 vertex of which 6 / 539 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 1203 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 532 transition count 398
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 467 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 466 transition count 397
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 134 place count 466 transition count 286
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 376 place count 335 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 334 transition count 285
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 334 transition count 285
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 666 place count 188 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 670 place count 186 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 672 place count 186 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 674 place count 184 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 675 place count 184 transition count 148
Applied a total of 675 rules in 47 ms. Remains 184 /539 variables (removed 355) and now considering 148/472 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 184/539 places, 148/472 transitions.
Finished random walk after 261 steps, including 10 resets, run visited all 2 properties in 3 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), true, (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p0)), (F (AND (NOT p1) p2 p3)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 8 factoid took 811 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 16 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2024-05-25 15:42:27] [INFO ] Invariant cache hit.
[2024-05-25 15:42:28] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-25 15:42:28] [INFO ] Invariant cache hit.
[2024-05-25 15:42:28] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2024-05-25 15:42:28] [INFO ] Invariant cache hit.
[2024-05-25 15:42:29] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1235 ms. Remains : 539/539 places, 472/472 transitions.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), true, (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 245 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:42:29] [INFO ] Invariant cache hit.
[2024-05-25 15:42:30] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:42:30] [INFO ] [Nat]Absence check using 64 positive place invariants in 21 ms returned sat
[2024-05-25 15:42:30] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 16 ms returned sat
[2024-05-25 15:42:30] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:42:30] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:42:30] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:42:30] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2024-05-25 15:42:31] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 0 ms to minimize.
[2024-05-25 15:42:31] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:42:31] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 0 ms to minimize.
[2024-05-25 15:42:31] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 18 ms to minimize.
[2024-05-25 15:42:31] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:42:31] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-25 15:42:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1255 ms
[2024-05-25 15:42:31] [INFO ] After 1596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-25 15:42:31] [INFO ] After 1857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 249 edges and 539 vertex of which 6 / 539 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 1203 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 532 transition count 398
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 467 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 466 transition count 397
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 134 place count 466 transition count 286
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 376 place count 335 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 334 transition count 285
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 334 transition count 285
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 666 place count 188 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 670 place count 186 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 672 place count 186 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 674 place count 184 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 675 place count 184 transition count 148
Applied a total of 675 rules in 77 ms. Remains 184 /539 variables (removed 355) and now considering 148/472 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 184/539 places, 148/472 transitions.
Finished random walk after 4244 steps, including 220 resets, run visited all 3 properties in 32 ms. (steps per millisecond=132 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), true, (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p0)), (F (AND (NOT p1) p2 p3)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 8 factoid took 536 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Product exploration explored 100000 steps with 524 reset in 265 ms.
Product exploration explored 100000 steps with 524 reset in 300 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 248 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1204 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 532 transition count 464
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 62 place count 532 transition count 522
Deduced a syphon composed of 145 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 147 place count 532 transition count 522
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 173 place count 506 transition count 479
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 199 place count 506 transition count 479
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 1 with 173 rules applied. Total rules applied 372 place count 506 transition count 479
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 417 place count 461 transition count 434
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 462 place count 461 transition count 434
Deduced a syphon composed of 247 places in 0 ms
Applied a total of 462 rules in 158 ms. Remains 461 /539 variables (removed 78) and now considering 434/472 (removed 38) transitions.
[2024-05-25 15:42:34] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 434 rows 461 cols
[2024-05-25 15:42:34] [INFO ] Computed 107 invariants in 6 ms
[2024-05-25 15:42:35] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 461/539 places, 434/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 753 ms. Remains : 461/539 places, 434/472 transitions.
Built C files in :
/tmp/ltsmin1416171749465883207
[2024-05-25 15:42:35] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1416171749465883207
Running compilation step : cd /tmp/ltsmin1416171749465883207;'/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 988 ms.
Running link step : cd /tmp/ltsmin1416171749465883207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin1416171749465883207;'/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/stateBased15544362371714841135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 20 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-25 15:42:50] [INFO ] Computed 107 invariants in 6 ms
[2024-05-25 15:42:50] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-25 15:42:50] [INFO ] Invariant cache hit.
[2024-05-25 15:42:51] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2024-05-25 15:42:51] [INFO ] Invariant cache hit.
[2024-05-25 15:42:51] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1208 ms. Remains : 539/539 places, 472/472 transitions.
Built C files in :
/tmp/ltsmin690743643732891626
[2024-05-25 15:42:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin690743643732891626
Running compilation step : cd /tmp/ltsmin690743643732891626;'/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 848 ms.
Running link step : cd /tmp/ltsmin690743643732891626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin690743643732891626;'/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/stateBased9905934678662051083.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:43:06] [INFO ] Flatten gal took : 24 ms
[2024-05-25 15:43:06] [INFO ] Flatten gal took : 21 ms
[2024-05-25 15:43:06] [INFO ] Time to serialize gal into /tmp/LTL13135183081874912534.gal : 5 ms
[2024-05-25 15:43:06] [INFO ] Time to serialize properties into /tmp/LTL13743894867967660522.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/LTL13135183081874912534.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11853871305438308356.hoa' '-atoms' '/tmp/LTL13743894867967660522.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...320
Loading property file /tmp/LTL13743894867967660522.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11853871305438308356.hoa
Detected timeout of ITS tools.
[2024-05-25 15:43:21] [INFO ] Flatten gal took : 20 ms
[2024-05-25 15:43:21] [INFO ] Flatten gal took : 18 ms
[2024-05-25 15:43:21] [INFO ] Time to serialize gal into /tmp/LTL3845162420583754752.gal : 3 ms
[2024-05-25 15:43:21] [INFO ] Time to serialize properties into /tmp/LTL10257952610132089137.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/LTL3845162420583754752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10257952610132089137.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 : !((G(("(p55==0)")||(X(("(p212==0)")||(("(p734==0)")&&(G("(p223==0)"))))))))
Formula 0 simplified : F(!"(p55==0)" & X(!"(p212==0)" & (!"(p734==0)" | F!"(p223==0)")))
Detected timeout of ITS tools.
[2024-05-25 15:43:36] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:43:36] [INFO ] Applying decomposition
[2024-05-25 15:43:36] [INFO ] Flatten gal took : 13 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/graph10521740031301988993.txt' '-o' '/tmp/graph10521740031301988993.bin' '-w' '/tmp/graph10521740031301988993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10521740031301988993.bin' '-l' '-1' '-v' '-w' '/tmp/graph10521740031301988993.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:43:36] [INFO ] Decomposing Gal with order
[2024-05-25 15:43:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:43:36] [INFO ] Removed a total of 281 redundant transitions.
[2024-05-25 15:43:36] [INFO ] Flatten gal took : 27 ms
[2024-05-25 15:43:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-05-25 15:43:36] [INFO ] Time to serialize gal into /tmp/LTL12173176248438175113.gal : 6 ms
[2024-05-25 15:43:36] [INFO ] Time to serialize properties into /tmp/LTL5015366839003471602.ltl : 1 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/LTL12173176248438175113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5015366839003471602.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 : !((G(("(i6.u19.p55==0)")||(X(("(i15.i1.u59.p212==0)")||(("(i13.i0.u176.p734==0)")&&(G("(i2.u62.p223==0)"))))))))
Formula 0 simplified : F(!"(i6.u19.p55==0)" & X(!"(i15.i1.u59.p212==0)" & (!"(i13.i0.u176.p734==0)" | F!"(i2.u62.p223==0)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5707247913887531048
[2024-05-25 15:43:52] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5707247913887531048
Running compilation step : cd /tmp/ltsmin5707247913887531048;'/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 1040 ms.
Running link step : cd /tmp/ltsmin5707247913887531048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5707247913887531048;'/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' '[](((LTLAPp0==true)||X(((LTLAPp1==true)||((LTLAPp2==true)&&[]((LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 104301 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)||(X((p1||X(p1))) U ((p2&&X((p1||X(p1))))||X(G((p1||X(p1))))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 476
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 476
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 472
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 472
Applied a total of 24 rules in 59 ms. Remains 539 /551 variables (removed 12) and now considering 472/484 (removed 12) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-25 15:44:07] [INFO ] Computed 107 invariants in 7 ms
[2024-05-25 15:44:07] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-25 15:44:07] [INFO ] Invariant cache hit.
[2024-05-25 15:44:07] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-05-25 15:44:07] [INFO ] Invariant cache hit.
[2024-05-25 15:44:08] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 472/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1004 ms. Remains : 539/551 places, 472/484 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s363 1), p1:(NEQ s469 1), p2:(EQ s283 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33349 reset in 364 ms.
Product exploration explored 100000 steps with 33431 reset in 397 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 993 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:44:10] [INFO ] Invariant cache hit.
[2024-05-25 15:44:10] [INFO ] [Real]Absence check using 64 positive place invariants in 24 ms returned sat
[2024-05-25 15:44:10] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 30 ms returned sat
[2024-05-25 15:44:10] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:44:11] [INFO ] [Nat]Absence check using 64 positive place invariants in 20 ms returned sat
[2024-05-25 15:44:11] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-25 15:44:11] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:44:11] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:44:11] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:44:11] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 4 ms to minimize.
[2024-05-25 15:44:11] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:44:12] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:44:12] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:44:12] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:44:12] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:44:12] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:44:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1564 ms
[2024-05-25 15:44:13] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2024-05-25 15:44:13] [INFO ] After 2066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-25 15:44:13] [INFO ] After 2267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 250 edges and 539 vertex of which 6 / 539 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 1203 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 465 transition count 395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 464 transition count 395
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 138 place count 464 transition count 284
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 382 place count 331 transition count 284
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 664 place count 189 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 668 place count 187 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 670 place count 187 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 672 place count 185 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 673 place count 185 transition count 149
Applied a total of 673 rules in 86 ms. Remains 185 /539 variables (removed 354) and now considering 149/472 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 185/539 places, 149/472 transitions.
Finished random walk after 552 steps, including 21 resets, run visited all 2 properties in 25 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 12 factoid took 1997 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 397 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 14 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2024-05-25 15:44:16] [INFO ] Invariant cache hit.
[2024-05-25 15:44:16] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-25 15:44:16] [INFO ] Invariant cache hit.
[2024-05-25 15:44:17] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2024-05-25 15:44:17] [INFO ] Invariant cache hit.
[2024-05-25 15:44:17] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1307 ms. Remains : 539/539 places, 472/472 transitions.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 639 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:44:18] [INFO ] Invariant cache hit.
[2024-05-25 15:44:18] [INFO ] [Real]Absence check using 64 positive place invariants in 27 ms returned sat
[2024-05-25 15:44:18] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 15 ms returned sat
[2024-05-25 15:44:18] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:44:18] [INFO ] [Nat]Absence check using 64 positive place invariants in 20 ms returned sat
[2024-05-25 15:44:19] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-25 15:44:19] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:44:19] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:44:19] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:44:19] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:44:19] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 0 ms to minimize.
[2024-05-25 15:44:19] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 14 ms to minimize.
[2024-05-25 15:44:20] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:44:20] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:44:20] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:44:20] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:44:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1225 ms
[2024-05-25 15:44:20] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:44:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-25 15:44:20] [INFO ] After 1624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-25 15:44:20] [INFO ] After 1833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 250 edges and 539 vertex of which 6 / 539 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 1203 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 465 transition count 395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 464 transition count 395
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 138 place count 464 transition count 284
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 382 place count 331 transition count 284
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 664 place count 189 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 668 place count 187 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 670 place count 187 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 672 place count 185 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 673 place count 185 transition count 149
Applied a total of 673 rules in 39 ms. Remains 185 /539 variables (removed 354) and now considering 149/472 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 185/539 places, 149/472 transitions.
Finished random walk after 46 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 12 factoid took 1776 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 33280 reset in 418 ms.
Product exploration explored 100000 steps with 33325 reset in 405 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 250 edges and 539 vertex of which 6 / 539 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 1204 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 532 transition count 464
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 64 place count 532 transition count 523
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 149 place count 532 transition count 523
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 176 place count 505 transition count 478
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 203 place count 505 transition count 478
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 1 with 171 rules applied. Total rules applied 374 place count 505 transition count 478
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 419 place count 460 transition count 433
Deduced a syphon composed of 246 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 464 place count 460 transition count 433
Deduced a syphon composed of 246 places in 1 ms
Applied a total of 464 rules in 80 ms. Remains 460 /539 variables (removed 79) and now considering 433/472 (removed 39) transitions.
[2024-05-25 15:44:24] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 433 rows 460 cols
[2024-05-25 15:44:24] [INFO ] Computed 107 invariants in 28 ms
[2024-05-25 15:44:25] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 460/539 places, 433/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 531 ms. Remains : 460/539 places, 433/472 transitions.
Built C files in :
/tmp/ltsmin8500121536867001441
[2024-05-25 15:44:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8500121536867001441
Running compilation step : cd /tmp/ltsmin8500121536867001441;'/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 997 ms.
Running link step : cd /tmp/ltsmin8500121536867001441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8500121536867001441;'/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/stateBased16299293976826116271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 21 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-25 15:44:40] [INFO ] Computed 107 invariants in 7 ms
[2024-05-25 15:44:40] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-25 15:44:40] [INFO ] Invariant cache hit.
[2024-05-25 15:44:41] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2024-05-25 15:44:41] [INFO ] Invariant cache hit.
[2024-05-25 15:44:41] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1130 ms. Remains : 539/539 places, 472/472 transitions.
Built C files in :
/tmp/ltsmin15498733044568102729
[2024-05-25 15:44:41] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15498733044568102729
Running compilation step : cd /tmp/ltsmin15498733044568102729;'/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 747 ms.
Running link step : cd /tmp/ltsmin15498733044568102729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15498733044568102729;'/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/stateBased2929612474975310907.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:44:56] [INFO ] Flatten gal took : 45 ms
[2024-05-25 15:44:56] [INFO ] Flatten gal took : 34 ms
[2024-05-25 15:44:56] [INFO ] Time to serialize gal into /tmp/LTL14700286912610175976.gal : 7 ms
[2024-05-25 15:44:56] [INFO ] Time to serialize properties into /tmp/LTL14612662567505245670.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/LTL14700286912610175976.gal' '-t' 'CGAL' '-hoa' '/tmp/aut472144190321558197.hoa' '-atoms' '/tmp/LTL14612662567505245670.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...318
Loading property file /tmp/LTL14612662567505245670.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut472144190321558197.hoa
Detected timeout of ITS tools.
[2024-05-25 15:45:11] [INFO ] Flatten gal took : 29 ms
[2024-05-25 15:45:11] [INFO ] Flatten gal took : 24 ms
[2024-05-25 15:45:11] [INFO ] Time to serialize gal into /tmp/LTL6322743748840155599.gal : 5 ms
[2024-05-25 15:45:11] [INFO ] Time to serialize properties into /tmp/LTL4591746719631957365.ltl : 1 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/LTL6322743748840155599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4591746719631957365.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...275
Read 1 LTL properties
Checking formula 0 : !(((F("(p478==1)"))||((X(("(p670!=1)")||(X("(p670!=1)"))))U((X(G(("(p670!=1)")||(X("(p670!=1)")))))||(("(p352==1)")&&(X(("(p670!=1)")|...179
Formula 0 simplified : G!"(p478==1)" & (X(!"(p670!=1)" & X!"(p670!=1)") R (XF(!"(p670!=1)" & X!"(p670!=1)") & (!"(p352==1)" | X(!"(p670!=1)" & X!"(p670!=1)...160
Detected timeout of ITS tools.
[2024-05-25 15:45:26] [INFO ] Flatten gal took : 30 ms
[2024-05-25 15:45:26] [INFO ] Applying decomposition
[2024-05-25 15:45:27] [INFO ] Flatten gal took : 23 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/graph1090595806240101866.txt' '-o' '/tmp/graph1090595806240101866.bin' '-w' '/tmp/graph1090595806240101866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1090595806240101866.bin' '-l' '-1' '-v' '-w' '/tmp/graph1090595806240101866.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:45:27] [INFO ] Decomposing Gal with order
[2024-05-25 15:45:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:45:27] [INFO ] Removed a total of 285 redundant transitions.
[2024-05-25 15:45:27] [INFO ] Flatten gal took : 35 ms
[2024-05-25 15:45:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-25 15:45:27] [INFO ] Time to serialize gal into /tmp/LTL10266674939600253783.gal : 6 ms
[2024-05-25 15:45:27] [INFO ] Time to serialize properties into /tmp/LTL4142054033022721123.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/LTL10266674939600253783.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4142054033022721123.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 : !(((F("(i15.i1.i1.u131.p478==1)"))||((X(("(i11.u162.p670!=1)")||(X("(i11.u162.p670!=1)"))))U((X(G(("(i11.u162.p670!=1)")||(X("(i11.u16...257
Formula 0 simplified : G!"(i15.i1.i1.u131.p478==1)" & (X(!"(i11.u162.p670!=1)" & X!"(i11.u162.p670!=1)") R (XF(!"(i11.u162.p670!=1)" & X!"(i11.u162.p670!=1...238
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10268057312435958932
[2024-05-25 15:45:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10268057312435958932
Running compilation step : cd /tmp/ltsmin10268057312435958932;'/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 1038 ms.
Running link step : cd /tmp/ltsmin10268057312435958932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin10268057312435958932;'/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' '(<>((LTLAPp0==true))||(X(((LTLAPp1==true)||X((LTLAPp1==true)))) U (X([](((LTLAPp1==true)||X((LTLAPp1==true)))))||((LTLAPp2==true)&&X(((LTLAPp1==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-LTLFireability-05 finished in 110173 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||(F((p1||G(p2))) U p3))))'
Support contains 2 out of 551 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 : 551/551 places, 484/484 transitions.
Graph (trivial) has 259 edges and 551 vertex of which 6 / 551 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 1224 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 543 transition count 405
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 473 transition count 405
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 142 place count 473 transition count 293
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 388 place count 339 transition count 293
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 395 place count 332 transition count 286
Iterating global reduction 2 with 7 rules applied. Total rules applied 402 place count 332 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 402 place count 332 transition count 285
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 404 place count 331 transition count 285
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 682 place count 190 transition count 148
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 688 place count 187 transition count 154
Applied a total of 688 rules in 71 ms. Remains 187 /551 variables (removed 364) and now considering 154/484 (removed 330) transitions.
[2024-05-25 15:45:57] [INFO ] Flow matrix only has 153 transitions (discarded 1 similar events)
// Phase 1: matrix 153 rows 187 cols
[2024-05-25 15:45:57] [INFO ] Computed 81 invariants in 2 ms
[2024-05-25 15:45:57] [INFO ] Implicit Places using invariants in 196 ms returned [27, 28, 29, 30, 31, 36, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 200 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/551 places, 154/484 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 275 ms. Remains : 164/551 places, 154/484 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 1), p3:(EQ s67 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-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-07 finished in 365 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 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 476
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 476
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 472
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 472
Applied a total of 24 rules in 38 ms. Remains 539 /551 variables (removed 12) and now considering 472/484 (removed 12) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-25 15:45:57] [INFO ] Computed 107 invariants in 9 ms
[2024-05-25 15:46:04] [INFO ] Implicit Places using invariants in 6296 ms returned []
[2024-05-25 15:46:04] [INFO ] Invariant cache hit.
[2024-05-25 15:46:04] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 7007 ms to find 0 implicit places.
[2024-05-25 15:46:04] [INFO ] Invariant cache hit.
[2024-05-25 15:46:04] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 472/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7291 ms. Remains : 539/551 places, 472/484 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-08 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 s435 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]]
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 364 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 35 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-08 finished in 8153 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(G((p0 U p1)))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 476
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 476
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 473
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 473
Applied a total of 22 rules in 23 ms. Remains 540 /551 variables (removed 11) and now considering 473/484 (removed 11) transitions.
// Phase 1: matrix 473 rows 540 cols
[2024-05-25 15:46:05] [INFO ] Computed 107 invariants in 6 ms
[2024-05-25 15:46:06] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-25 15:46:06] [INFO ] Invariant cache hit.
[2024-05-25 15:46:06] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2024-05-25 15:46:06] [INFO ] Invariant cache hit.
[2024-05-25 15:46:06] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/551 places, 473/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1076 ms. Remains : 540/551 places, 473/484 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s214 1), p0:(EQ s96 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-11 finished in 1327 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&&G(p1))||(p2&&(p0 U X(p3)))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 476
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 476
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 473
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 473
Applied a total of 22 rules in 43 ms. Remains 540 /551 variables (removed 11) and now considering 473/484 (removed 11) transitions.
// Phase 1: matrix 473 rows 540 cols
[2024-05-25 15:46:07] [INFO ] Computed 107 invariants in 5 ms
[2024-05-25 15:46:07] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-25 15:46:07] [INFO ] Invariant cache hit.
[2024-05-25 15:46:08] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2024-05-25 15:46:08] [INFO ] Invariant cache hit.
[2024-05-25 15:46:08] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/551 places, 473/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1161 ms. Remains : 540/551 places, 473/484 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s36 1), p2:(EQ s307 0), p1:(EQ s307 1), p3:(EQ s492 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 189 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 1490 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||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 476
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 476
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 472
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 472
Applied a total of 24 rules in 39 ms. Remains 539 /551 variables (removed 12) and now considering 472/484 (removed 12) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-25 15:46:08] [INFO ] Computed 107 invariants in 4 ms
[2024-05-25 15:46:08] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-25 15:46:08] [INFO ] Invariant cache hit.
[2024-05-25 15:46:09] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2024-05-25 15:46:09] [INFO ] Invariant cache hit.
[2024-05-25 15:46:09] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 472/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 944 ms. Remains : 539/551 places, 472/484 transitions.
Stuttering acceptance computed with spot in 165 ms :[false, false, (NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s331 1) (EQ s521 1)), p1:(NEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 502 reset in 211 ms.
Product exploration explored 100000 steps with 510 reset in 218 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1212 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 232 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 711961 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 711961 steps, saw 113457 distinct states, run finished after 3002 ms. (steps per millisecond=237 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-25 15:46:13] [INFO ] Invariant cache hit.
[2024-05-25 15:46:13] [INFO ] [Real]Absence check using 64 positive place invariants in 22 ms returned sat
[2024-05-25 15:46:13] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 17 ms returned sat
[2024-05-25 15:46:13] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:46:14] [INFO ] [Nat]Absence check using 64 positive place invariants in 26 ms returned sat
[2024-05-25 15:46:14] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 18 ms returned sat
[2024-05-25 15:46:14] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:46:14] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2024-05-25 15:46:14] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2024-05-25 15:46:14] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:46:14] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2024-05-25 15:46:14] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:46:14] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:46:15] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:46:15] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:46:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 905 ms
[2024-05-25 15:46:15] [INFO ] After 1137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-25 15:46:15] [INFO ] After 1326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 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 1205 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 465 transition count 396
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 465 transition count 285
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 380 place count 332 transition count 285
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 668 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 672 place count 184 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 674 place count 184 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 676 place count 182 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 182 transition count 148
Applied a total of 677 rules in 38 ms. Remains 182 /539 variables (removed 357) and now considering 148/472 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 182/539 places, 148/472 transitions.
Incomplete random walk after 10000 steps, including 484 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Finished Best-First random walk after 8349 steps, including 132 resets, run visited all 1 properties in 20 ms. (steps per millisecond=417 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[false, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 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 1206 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 531 transition count 396
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 464 transition count 396
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 464 transition count 285
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 380 place count 331 transition count 285
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 666 place count 186 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 670 place count 184 transition count 151
Applied a total of 670 rules in 36 ms. Remains 184 /539 variables (removed 355) and now considering 151/472 (removed 321) transitions.
[2024-05-25 15:46:16] [INFO ] Flow matrix only has 150 transitions (discarded 1 similar events)
// Phase 1: matrix 150 rows 184 cols
[2024-05-25 15:46:16] [INFO ] Computed 81 invariants in 3 ms
[2024-05-25 15:46:16] [INFO ] Implicit Places using invariants in 265 ms returned [29, 30, 31, 32, 33, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 269 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/539 places, 151/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 160/539 places, 151/472 transitions.
Computed a total of 87 stabilizing places and 99 stable transitions
Computed a total of 87 stabilizing places and 99 stable transitions
Detected a total of 87/160 stabilizing places and 99/151 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1508 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 381 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 367 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 388 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1429 steps, run visited all 3 properties in 13 ms. (steps per millisecond=109 )
Probabilistic random walk after 1429 steps, saw 525 distinct states, run finished after 13 ms. (steps per millisecond=109 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 394 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13721 reset in 325 ms.
Stuttering criterion allowed to conclude after 59888 steps with 8210 reset in 213 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-14 finished in 9526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 263 edges and 551 vertex of which 6 / 551 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 1224 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 543 transition count 403
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 471 transition count 403
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 471 transition count 291
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 391 place count 338 transition count 291
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 400 place count 329 transition count 282
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 329 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 409 place count 329 transition count 281
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 411 place count 328 transition count 281
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 689 place count 187 transition count 144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 695 place count 184 transition count 150
Applied a total of 695 rules in 38 ms. Remains 184 /551 variables (removed 367) and now considering 150/484 (removed 334) transitions.
[2024-05-25 15:46:18] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 184 cols
[2024-05-25 15:46:18] [INFO ] Computed 82 invariants in 2 ms
[2024-05-25 15:46:18] [INFO ] Implicit Places using invariants in 269 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 160]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 271 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/551 places, 150/484 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 314 ms. Remains : 159/551 places, 150/484 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s89 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-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-15 finished in 391 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((X(p0)||F((p1&&X((p1 U (p2||G(p1)))))))))'
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||X((p1||(p2&&G(p3)))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-20-LTLFireability-04
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 551/551 places, 484/484 transitions.
Graph (trivial) has 260 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1224 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 543 transition count 405
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 473 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 472 transition count 404
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 144 place count 472 transition count 294
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 384 place count 342 transition count 294
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 392 place count 334 transition count 286
Iterating global reduction 3 with 8 rules applied. Total rules applied 400 place count 334 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 400 place count 334 transition count 285
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 402 place count 333 transition count 285
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 684 place count 190 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 690 place count 187 transition count 152
Applied a total of 690 rules in 57 ms. Remains 187 /551 variables (removed 364) and now considering 152/484 (removed 332) transitions.
[2024-05-25 15:46:19] [INFO ] Flow matrix only has 151 transitions (discarded 1 similar events)
// Phase 1: matrix 151 rows 187 cols
[2024-05-25 15:46:19] [INFO ] Computed 83 invariants in 1 ms
[2024-05-25 15:46:19] [INFO ] Implicit Places using invariants in 175 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 46, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 147]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 176 ms to find 25 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 162/551 places, 152/484 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 237 ms. Remains : 162/551 places, 152/484 transitions.
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s3 0), p1:(EQ s36 0), p2:(EQ s136 0), p3:(EQ s39 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16936 reset in 271 ms.
Product exploration explored 100000 steps with 17046 reset in 287 ms.
Computed a total of 84 stabilizing places and 96 stable transitions
Computed a total of 84 stabilizing places and 96 stable transitions
Detected a total of 84/162 stabilizing places and 96/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), true, (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 143 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 1710 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 404 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 403 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 420 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:46:20] [INFO ] Flow matrix only has 151 transitions (discarded 1 similar events)
// Phase 1: matrix 151 rows 162 cols
[2024-05-25 15:46:20] [INFO ] Computed 58 invariants in 4 ms
[2024-05-25 15:46:20] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:46:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2024-05-25 15:46:20] [INFO ] [Nat]Absence check using 40 positive and 18 generalized place invariants in 7 ms returned sat
[2024-05-25 15:46:20] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:46:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:46:20] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:46:20] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-25 15:46:20] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 152/152 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 162 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 161 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 161 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 159 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 159 transition count 148
Applied a total of 8 rules in 25 ms. Remains 159 /162 variables (removed 3) and now considering 148/152 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 159/162 places, 148/152 transitions.
Incomplete random walk after 10000 steps, including 542 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :2
Finished Best-First random walk after 1464 steps, including 26 resets, run visited all 1 properties in 4 ms. (steps per millisecond=366 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), true, (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p0)), (F (AND (NOT p1) p2 p3)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 6 factoid took 340 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-25 15:46:21] [INFO ] Flow matrix only has 151 transitions (discarded 1 similar events)
[2024-05-25 15:46:21] [INFO ] Invariant cache hit.
[2024-05-25 15:46:22] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-25 15:46:22] [INFO ] Flow matrix only has 151 transitions (discarded 1 similar events)
[2024-05-25 15:46:22] [INFO ] Invariant cache hit.
[2024-05-25 15:46:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:46:22] [INFO ] Implicit Places using invariants and state equation in 271 ms returned [6, 50, 52, 54, 62, 96, 98, 100, 102, 104, 106, 108]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 505 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/162 places, 152/152 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 148 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 148 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 146 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 146 transition count 147
Applied a total of 8 rules in 3 ms. Remains 146 /150 variables (removed 4) and now considering 147/152 (removed 5) transitions.
[2024-05-25 15:46:22] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
// Phase 1: matrix 146 rows 146 cols
[2024-05-25 15:46:22] [INFO ] Computed 46 invariants in 3 ms
[2024-05-25 15:46:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-25 15:46:22] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2024-05-25 15:46:22] [INFO ] Invariant cache hit.
[2024-05-25 15:46:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:46:22] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/162 places, 147/152 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 796 ms. Remains : 146/162 places, 147/152 transitions.
Computed a total of 68 stabilizing places and 91 stable transitions
Graph (complete) has 525 edges and 146 vertex of which 137 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Computed a total of 68 stabilizing places and 91 stable transitions
Detected a total of 68/146 stabilizing places and 91/147 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), true, (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 1714 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 410 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-25 15:46:23] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2024-05-25 15:46:23] [INFO ] Invariant cache hit.
[2024-05-25 15:46:23] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:46:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2024-05-25 15:46:23] [INFO ] [Nat]Absence check using 30 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-25 15:46:23] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:46:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:46:23] [INFO ] After 9ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:46:23] [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 8 ms.
[2024-05-25 15:46:23] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 147/147 transitions.
Graph (complete) has 501 edges and 146 vertex of which 137 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 137 transition count 139
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 134 transition count 139
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 17 place count 125 transition count 103
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 125 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 120 transition count 98
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 120 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 118 transition count 96
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 118 transition count 96
Applied a total of 41 rules in 11 ms. Remains 118 /146 variables (removed 28) and now considering 96/147 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 118/146 places, 96/147 transitions.
Incomplete random walk after 10000 steps, including 654 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 135 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), true, (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p0)), (F (AND (NOT p1) p2 p3)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 6 factoid took 366 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Product exploration explored 100000 steps with 16914 reset in 266 ms.
Product exploration explored 100000 steps with 16985 reset in 244 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 147/147 transitions.
Graph (complete) has 525 edges and 146 vertex of which 137 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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 137 transition count 143
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 13 place count 128 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 22 place count 128 transition count 107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 128 transition count 108
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 26 rules in 13 ms. Remains 128 /146 variables (removed 18) and now considering 108/147 (removed 39) transitions.
[2024-05-25 15:46:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 15:46:25] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
// Phase 1: matrix 107 rows 128 cols
[2024-05-25 15:46:25] [INFO ] Computed 41 invariants in 1 ms
[2024-05-25 15:46:25] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/146 places, 108/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 128/146 places, 108/147 transitions.
Built C files in :
/tmp/ltsmin14233608022103861829
[2024-05-25 15:46:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14233608022103861829
Running compilation step : cd /tmp/ltsmin14233608022103861829;'/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 404 ms.
Running link step : cd /tmp/ltsmin14233608022103861829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin14233608022103861829;'/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/stateBased6113040844750224841.hoa' '--buchi-type=spotba'
LTSmin run took 1108 ms.
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 8663 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)||(X((p1||X(p1))) U ((p2&&X((p1||X(p1))))||X(G((p1||X(p1))))))))'
[2024-05-25 15:46:27] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5179353870686893916
[2024-05-25 15:46:27] [INFO ] Computing symmetric may disable matrix : 484 transitions.
[2024-05-25 15:46:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:46:27] [INFO ] Computing symmetric may enable matrix : 484 transitions.
[2024-05-25 15:46:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:46:27] [INFO ] Applying decomposition
[2024-05-25 15:46:27] [INFO ] Flatten gal took : 23 ms
[2024-05-25 15:46:27] [INFO ] Computing Do-Not-Accords matrix : 484 transitions.
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/graph13116211803603166051.txt' '-o' '/tmp/graph13116211803603166051.bin' '-w' '/tmp/graph13116211803603166051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13116211803603166051.bin' '-l' '-1' '-v' '-w' '/tmp/graph13116211803603166051.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:46:27] [INFO ] Decomposing Gal with order
[2024-05-25 15:46:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:46:27] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:46:27] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5179353870686893916
Running compilation step : cd /tmp/ltsmin5179353870686893916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
[2024-05-25 15:46:27] [INFO ] Removed a total of 286 redundant transitions.
[2024-05-25 15:46:27] [INFO ] Flatten gal took : 37 ms
[2024-05-25 15:46:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2024-05-25 15:46:27] [INFO ] Time to serialize gal into /tmp/LTLFireability2901679497565581662.gal : 7 ms
[2024-05-25 15:46:27] [INFO ] Time to serialize properties into /tmp/LTLFireability10327693558167927713.ltl : 1 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/LTLFireability2901679497565581662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10327693558167927713.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...277
Read 2 LTL properties
Checking formula 0 : !((G((X("((i9.i3.u153.p564==0)||(i16.i0.u194.p766==0))"))||(F(("(i9.i3.u153.p564!=1)")&&(X(("(i9.i3.u153.p564!=1)")U(("(i16.i0.u27.p75...198
Formula 0 simplified : F(X!"((i9.i3.u153.p564==0)||(i16.i0.u194.p766==0))" & G(!"(i9.i3.u153.p564!=1)" | X(!"(i9.i3.u153.p564!=1)" M !"(i16.i0.u27.p75!=1)"...158
Compilation finished in 1234 ms.
Running link step : cd /tmp/ltsmin5179353870686893916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 102 ms.
Running LTSmin : cd /tmp/ltsmin5179353870686893916;'/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((LTLAPp0==true))||<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 16:08:31] [INFO ] Applying decomposition
[2024-05-25 16:08:31] [INFO ] Flatten gal took : 20 ms
[2024-05-25 16:08:31] [INFO ] Decomposing Gal with order
[2024-05-25 16:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:08:31] [INFO ] Removed a total of 146 redundant transitions.
[2024-05-25 16:08:31] [INFO ] Flatten gal took : 60 ms
[2024-05-25 16:08:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 471 ms.
[2024-05-25 16:08:32] [INFO ] Time to serialize gal into /tmp/LTLFireability6818817103620339028.gal : 23 ms
[2024-05-25 16:08:32] [INFO ] Time to serialize properties into /tmp/LTLFireability3302578175941126634.ltl : 1 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/LTLFireability6818817103620339028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3302578175941126634.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...276
Read 2 LTL properties
Checking formula 0 : !((G((X("((i0.i1.u167.p564==0)||(i1.u175.p766==0))"))||(F(("(i0.i1.u167.p564!=1)")&&(X(("(i0.i1.u167.p564!=1)")U(("(i0.i0.i0.i0.i0.i0....296
Formula 0 simplified : F(X!"((i0.i1.u167.p564==0)||(i1.u175.p766==0))" & G(!"(i0.i1.u167.p564!=1)" | X(!"(i0.i1.u167.p564!=1)" M !"(i0.i0.i0.i0.i0.i0.i0.i0...256
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5179353870686893916;'/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((LTLAPp0==true))||<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5179353870686893916;'/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' '(<>((LTLAPp7==true))||(X(((LTLAPp8==true)||X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(((LTLAPp8==true)||X((LTLAPp8==true)))))||X([](((LTLAPp8==true)||X((LTLAPp8==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: LTL layer: formula: (<>((LTLAPp7==true))||(X(((LTLAPp8==true)||X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(((LTLAPp8==true)||X((LTLAPp8==true)))))||X([](((LTLAPp8==true)||X((LTLAPp8==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.038: "(<>((LTLAPp7==true))||(X(((LTLAPp8==true)||X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(((LTLAPp8==true)||X((LTLAPp8==true)))))||X([](((LTLAPp8==true)||X((LTLAPp8==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.038: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.073: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.206: DFS-FIFO for weak LTL, using special progress label 495
pins2lts-mc-linux64( 0/ 8), 0.206: There are 496 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.206: State length is 552, there are 496 groups
pins2lts-mc-linux64( 0/ 8), 0.206: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.206: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.206: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.206: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.236: ~1 levels ~960 states ~4200 transitions
pins2lts-mc-linux64( 2/ 8), 0.260: ~1 levels ~1920 states ~8896 transitions
pins2lts-mc-linux64( 2/ 8), 0.306: ~1 levels ~3840 states ~19008 transitions
pins2lts-mc-linux64( 2/ 8), 0.403: ~1 levels ~7680 states ~40488 transitions
pins2lts-mc-linux64( 2/ 8), 0.589: ~1 levels ~15360 states ~86792 transitions
pins2lts-mc-linux64( 2/ 8), 0.996: ~1 levels ~30720 states ~204048 transitions
pins2lts-mc-linux64( 4/ 8), 1.864: ~1 levels ~61440 states ~511064 transitions
pins2lts-mc-linux64( 2/ 8), 3.145: ~1 levels ~122880 states ~991488 transitions
pins2lts-mc-linux64( 2/ 8), 5.856: ~1 levels ~245760 states ~2383760 transitions
pins2lts-mc-linux64( 2/ 8), 10.050: ~1 levels ~491520 states ~4621192 transitions
pins2lts-mc-linux64( 2/ 8), 19.271: ~1 levels ~983040 states ~10595848 transitions
pins2lts-mc-linux64( 2/ 8), 37.035: ~1 levels ~1966080 states ~21915160 transitions
pins2lts-mc-linux64( 2/ 8), 73.418: ~1 levels ~3932160 states ~45483104 transitions
pins2lts-mc-linux64( 2/ 8), 150.850: ~1 levels ~7864320 states ~96875048 transitions
pins2lts-mc-linux64( 0/ 8), 295.476: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 295.680:
pins2lts-mc-linux64( 0/ 8), 295.680: mean standard work distribution: 6.1% (states) 5.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 295.680:
pins2lts-mc-linux64( 0/ 8), 295.680: Explored 13895512 states 188491454 transitions, fanout: 13.565
pins2lts-mc-linux64( 0/ 8), 295.680: Total exploration time 295.450 sec (295.280 sec minimum, 295.325 sec on average)
pins2lts-mc-linux64( 0/ 8), 295.680: States per second: 47032, Transitions per second: 637981
pins2lts-mc-linux64( 0/ 8), 295.680:
pins2lts-mc-linux64( 0/ 8), 295.680: Progress states detected: 28338534
pins2lts-mc-linux64( 0/ 8), 295.680: Redundant explorations: -50.9663
pins2lts-mc-linux64( 0/ 8), 295.680:
pins2lts-mc-linux64( 0/ 8), 295.680: Queue width: 8B, total height: 24439673, memory: 186.46MB
pins2lts-mc-linux64( 0/ 8), 295.680: Tree memory: 472.2MB, 17.5 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 295.680: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 295.680: Stored 487 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 295.680: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 295.680: Est. total memory use: 658.7MB (~1210.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5179353870686893916;'/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' '(<>((LTLAPp7==true))||(X(((LTLAPp8==true)||X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(((LTLAPp8==true)||X((LTLAPp8==true)))))||X([](((LTLAPp8==true)||X((LTLAPp8==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5179353870686893916;'/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' '(<>((LTLAPp7==true))||(X(((LTLAPp8==true)||X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(((LTLAPp8==true)||X((LTLAPp8==true)))))||X([](((LTLAPp8==true)||X((LTLAPp8==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 16:30:37] [INFO ] Flatten gal took : 274 ms
[2024-05-25 16:30:38] [INFO ] Input system was already deterministic with 484 transitions.
[2024-05-25 16:30:38] [INFO ] Transformed 551 places.
[2024-05-25 16:30:38] [INFO ] Transformed 484 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 16:31:09] [INFO ] Time to serialize gal into /tmp/LTLFireability11487259048007092847.gal : 15 ms
[2024-05-25 16:31:09] [INFO ] Time to serialize properties into /tmp/LTLFireability13176296074654508603.ltl : 12 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/LTLFireability11487259048007092847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13176296074654508603.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X("((p564==0)||(p766==0))"))||(F(("(p564!=1)")&&(X(("(p564!=1)")U(("(p75!=1)")||(G("(p564!=1)"))))))))))
Formula 0 simplified : F(X!"((p564==0)||(p766==0))" & G(!"(p564!=1)" | X(!"(p564!=1)" M !"(p75!=1)")))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 3576900 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16126936 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
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-20, 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-171620415000378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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