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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716651571217

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-19
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:39:33] [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:39:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:39:33] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-25 15:39:33] [INFO ] Transformed 772 places.
[2024-05-25 15:39:33] [INFO ] Transformed 685 transitions.
[2024-05-25 15:39:33] [INFO ] Found NUPN structural information;
[2024-05-25 15:39:33] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 211 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 2 formulas.
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 106 place count 651 transition count 572
Iterating global reduction 1 with 98 rules applied. Total rules applied 204 place count 651 transition count 572
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 255 place count 600 transition count 521
Iterating global reduction 1 with 51 rules applied. Total rules applied 306 place count 600 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 307 place count 599 transition count 520
Iterating global reduction 1 with 1 rules applied. Total rules applied 308 place count 599 transition count 520
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 309 place count 598 transition count 519
Iterating global reduction 1 with 1 rules applied. Total rules applied 310 place count 598 transition count 519
Applied a total of 310 rules in 211 ms. Remains 598 /757 variables (removed 159) and now considering 519/670 (removed 151) transitions.
// Phase 1: matrix 519 rows 598 cols
[2024-05-25 15:39:33] [INFO ] Computed 117 invariants in 40 ms
[2024-05-25 15:39:34] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-25 15:39:34] [INFO ] Invariant cache hit.
[2024-05-25 15:39:34] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2024-05-25 15:39:34] [INFO ] Invariant cache hit.
[2024-05-25 15:39:35] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 598/757 places, 519/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1778 ms. Remains : 598/757 places, 519/670 transitions.
Support contains 37 out of 598 places after structural reductions.
[2024-05-25 15:39:35] [INFO ] Flatten gal took : 82 ms
[2024-05-25 15:39:35] [INFO ] Flatten gal took : 46 ms
[2024-05-25 15:39:35] [INFO ] Input system was already deterministic with 519 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 30) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2024-05-25 15:39:36] [INFO ] Invariant cache hit.
[2024-05-25 15:39:36] [INFO ] [Real]Absence check using 71 positive place invariants in 23 ms returned sat
[2024-05-25 15:39:36] [INFO ] [Real]Absence check using 71 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-25 15:39:37] [INFO ] After 574ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14 real:4
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 6 ms to minimize.
[2024-05-25 15:39:37] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:39:38] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:39:38] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2024-05-25 15:39:38] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:39:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 823 ms
[2024-05-25 15:39:38] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-25 15:39:38] [INFO ] Deduced a trap composed of 113 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:39:38] [INFO ] Deduced a trap composed of 110 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:39:39] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:39:39] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 1 ms to minimize.
[2024-05-25 15:39:39] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:39:39] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:39:39] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:39:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2317 ms
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 111 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 114 places in 159 ms of which 0 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:39:41] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:39:42] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 114 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 112 places in 162 ms of which 3 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 2 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:39:45] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:39:45] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:39:45] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:39:45] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:39:45] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 0 ms to minimize.
[2024-05-25 15:39:45] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 0 ms to minimize.
[2024-05-25 15:39:46] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:39:46] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:39:46] [INFO ] Deduced a trap composed of 112 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:39:46] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:39:46] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:39:46] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:39:46] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 3 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 0 ms to minimize.
[2024-05-25 15:39:47] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:39:48] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 1 ms to minimize.
[2024-05-25 15:39:48] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 0 ms to minimize.
[2024-05-25 15:39:48] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 0 ms to minimize.
[2024-05-25 15:39:48] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 7543 ms
[2024-05-25 15:39:48] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 2 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:39:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 702 ms
[2024-05-25 15:39:49] [INFO ] After 12848ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-25 15:39:49] [INFO ] After 13296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-25 15:39:50] [INFO ] [Nat]Absence check using 71 positive place invariants in 25 ms returned sat
[2024-05-25 15:39:50] [INFO ] [Nat]Absence check using 71 positive and 46 generalized place invariants in 19 ms returned sat
[2024-05-25 15:39:51] [INFO ] After 880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-25 15:39:51] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:39:51] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-25 15:39:51] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-25 15:39:51] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:39:51] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:39:51] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-05-25 15:39:52] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-05-25 15:39:52] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:39:52] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:39:52] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:39:52] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:39:52] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2024-05-25 15:39:52] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 0 ms to minimize.
[2024-05-25 15:39:52] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:39:53] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:39:53] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:39:53] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:39:53] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:39:53] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 0 ms to minimize.
[2024-05-25 15:39:53] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2313 ms
[2024-05-25 15:39:53] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:39:53] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:39:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2024-05-25 15:39:54] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 0 ms to minimize.
[2024-05-25 15:39:54] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:39:54] [INFO ] Deduced a trap composed of 114 places in 159 ms of which 0 ms to minimize.
[2024-05-25 15:39:54] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 0 ms to minimize.
[2024-05-25 15:39:54] [INFO ] Deduced a trap composed of 110 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:39:54] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:39:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1152 ms
[2024-05-25 15:39:55] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 1 ms to minimize.
[2024-05-25 15:39:55] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 0 ms to minimize.
[2024-05-25 15:39:55] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:39:55] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:39:55] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:39:56] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:39:56] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:39:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1285 ms
[2024-05-25 15:39:57] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:39:57] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:39:57] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:39:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 385 ms
[2024-05-25 15:39:57] [INFO ] After 7119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 771 ms.
[2024-05-25 15:39:58] [INFO ] After 8412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 5 properties in 294 ms.
Support contains 16 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (complete) has 1316 edges and 598 vertex of which 597 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 597 transition count 452
Reduce places removed 66 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 69 rules applied. Total rules applied 136 place count 531 transition count 449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 139 place count 528 transition count 449
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 139 place count 528 transition count 329
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 401 place count 386 transition count 329
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 412 place count 375 transition count 318
Iterating global reduction 3 with 11 rules applied. Total rules applied 423 place count 375 transition count 318
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 309 rules applied. Total rules applied 732 place count 218 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 733 place count 218 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 735 place count 217 transition count 168
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 743 place count 217 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 216 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 745 place count 215 transition count 167
Applied a total of 745 rules in 160 ms. Remains 215 /598 variables (removed 383) and now considering 167/519 (removed 352) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 215/598 places, 167/519 transitions.
Incomplete random walk after 10000 steps, including 1331 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 429 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 428 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 442 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 432 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Finished probabilistic random walk after 285969 steps, run visited all 12 properties in 1090 ms. (steps per millisecond=262 )
Probabilistic random walk after 285969 steps, saw 105770 distinct states, run finished after 1091 ms. (steps per millisecond=262 ) properties seen :12
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 540 stabilizing places and 471 stable transitions
Graph (complete) has 1316 edges and 598 vertex of which 597 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 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 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 504
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 500
Applied a total of 38 rules in 42 ms. Remains 579 /598 variables (removed 19) and now considering 500/519 (removed 19) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-25 15:40:02] [INFO ] Computed 117 invariants in 17 ms
[2024-05-25 15:40:02] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-25 15:40:02] [INFO ] Invariant cache hit.
[2024-05-25 15:40:03] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2024-05-25 15:40:03] [INFO ] Invariant cache hit.
[2024-05-25 15:40:03] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 500/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1390 ms. Remains : 579/598 places, 500/519 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 235 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-01 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 s367 0)], 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 132 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-01 finished in 1706 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) U G(p1))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 582 transition count 503
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 582 transition count 503
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 578 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 578 transition count 499
Applied a total of 40 rules in 38 ms. Remains 578 /598 variables (removed 20) and now considering 499/519 (removed 20) transitions.
// Phase 1: matrix 499 rows 578 cols
[2024-05-25 15:40:03] [INFO ] Computed 117 invariants in 8 ms
[2024-05-25 15:40:04] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-25 15:40:04] [INFO ] Invariant cache hit.
[2024-05-25 15:40:04] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2024-05-25 15:40:04] [INFO ] Invariant cache hit.
[2024-05-25 15:40:04] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/598 places, 499/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1187 ms. Remains : 578/598 places, 499/519 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s489 1), p0:(EQ s556 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-04 finished in 1455 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&&F(p1)&&(p2 U p3)))))'
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 585 transition count 506
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 585 transition count 506
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 582 transition count 503
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 582 transition count 503
Applied a total of 32 rules in 48 ms. Remains 582 /598 variables (removed 16) and now considering 503/519 (removed 16) transitions.
// Phase 1: matrix 503 rows 582 cols
[2024-05-25 15:40:05] [INFO ] Computed 117 invariants in 10 ms
[2024-05-25 15:40:05] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-25 15:40:05] [INFO ] Invariant cache hit.
[2024-05-25 15:40:06] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2024-05-25 15:40:06] [INFO ] Invariant cache hit.
[2024-05-25 15:40:06] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/598 places, 503/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1421 ms. Remains : 582/598 places, 503/519 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s399 1), p3:(EQ s511 1), p2:(EQ s5 1), p1:(EQ s527 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 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-05 finished in 1658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 593 vertex of which 592 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 437
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 437
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 150 place count 517 transition count 313
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 422 place count 369 transition count 313
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 436 place count 355 transition count 299
Iterating global reduction 2 with 14 rules applied. Total rules applied 450 place count 355 transition count 299
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 307 rules applied. Total rules applied 757 place count 199 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 759 place count 198 transition count 151
Applied a total of 759 rules in 60 ms. Remains 198 /598 variables (removed 400) and now considering 151/519 (removed 368) transitions.
// Phase 1: matrix 151 rows 198 cols
[2024-05-25 15:40:06] [INFO ] Computed 88 invariants in 4 ms
[2024-05-25 15:40:07] [INFO ] Implicit Places using invariants in 127 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 130 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 151/519 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 170/598 places, 151/519 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s14 1) (NEQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21412 reset in 339 ms.
Product exploration explored 100000 steps with 21308 reset in 253 ms.
Computed a total of 147 stabilizing places and 133 stable transitions
Computed a total of 147 stabilizing places and 133 stable transitions
Detected a total of 147/170 stabilizing places and 133/151 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2465 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 761 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 161 steps, run visited all 1 properties in 5 ms. (steps per millisecond=32 )
Probabilistic random walk after 161 steps, saw 100 distinct states, run finished after 6 ms. (steps per millisecond=26 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 151/151 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 170 cols
[2024-05-25 15:40:08] [INFO ] Computed 60 invariants in 2 ms
[2024-05-25 15:40:08] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-25 15:40:08] [INFO ] Invariant cache hit.
[2024-05-25 15:40:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:40:08] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [1, 3, 5, 10, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 61, 76, 78, 82, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 343 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/170 places, 151/151 transitions.
Graph (complete) has 429 edges and 136 vertex of which 125 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 125 transition count 133
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 112 transition count 133
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 40 place count 99 transition count 92
Iterating global reduction 2 with 13 rules applied. Total rules applied 53 place count 99 transition count 92
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 99 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 96 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 62 place count 93 transition count 86
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 93 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 68 place count 93 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 92 transition count 83
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 84 place count 84 transition count 76
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 6 with 2 rules applied. Total rules applied 86 place count 83 transition count 75
Applied a total of 86 rules in 18 ms. Remains 83 /136 variables (removed 53) and now considering 75/151 (removed 76) transitions.
// Phase 1: matrix 75 rows 83 cols
[2024-05-25 15:40:08] [INFO ] Computed 21 invariants in 4 ms
[2024-05-25 15:40:08] [INFO ] Implicit Places using invariants in 53 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/170 places, 75/151 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 439 ms. Remains : 80/170 places, 75/151 transitions.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/80 stabilizing places and 57/75 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2486 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 740 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 120 steps, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Probabilistic random walk after 120 steps, saw 73 distinct states, run finished after 4 ms. (steps per millisecond=30 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21999 reset in 100 ms.
Product exploration explored 100000 steps with 21985 reset in 110 ms.
Built C files in :
/tmp/ltsmin8017315415053929877
[2024-05-25 15:40:09] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2024-05-25 15:40:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:09] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2024-05-25 15:40:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:09] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2024-05-25 15:40:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8017315415053929877
Running compilation step : cd /tmp/ltsmin8017315415053929877;'/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 300 ms.
Running link step : cd /tmp/ltsmin8017315415053929877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8017315415053929877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7512074198025734203.hoa' '--buchi-type=spotba'
LTSmin run took 2469 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-LTLFireability-06 finished in 5253 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)||(p1 U X(p2)))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 585 transition count 506
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 585 transition count 506
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 581 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 581 transition count 502
Applied a total of 34 rules in 52 ms. Remains 581 /598 variables (removed 17) and now considering 502/519 (removed 17) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-25 15:40:12] [INFO ] Computed 117 invariants in 5 ms
[2024-05-25 15:40:12] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-25 15:40:12] [INFO ] Invariant cache hit.
[2024-05-25 15:40:13] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2024-05-25 15:40:13] [INFO ] Invariant cache hit.
[2024-05-25 15:40:13] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 581/598 places, 502/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1594 ms. Remains : 581/598 places, 502/519 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(EQ s332 1), p1:(EQ s349 1), p2:(NEQ s460 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 377 ms.
Product exploration explored 100000 steps with 33333 reset in 316 ms.
Computed a total of 524 stabilizing places and 455 stable transitions
Graph (complete) has 1296 edges and 581 vertex of which 580 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 524 stabilizing places and 455 stable transitions
Detected a total of 524/581 stabilizing places and 455/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 41 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-07 finished in 2589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 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 1310 edges and 593 vertex of which 592 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 591 transition count 438
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 518 transition count 438
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 148 place count 518 transition count 312
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 425 place count 367 transition count 312
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 438 place count 354 transition count 299
Iterating global reduction 2 with 13 rules applied. Total rules applied 451 place count 354 transition count 299
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 756 place count 199 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 758 place count 198 transition count 152
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 764 place count 198 transition count 152
Applied a total of 764 rules in 61 ms. Remains 198 /598 variables (removed 400) and now considering 152/519 (removed 367) transitions.
// Phase 1: matrix 152 rows 198 cols
[2024-05-25 15:40:14] [INFO ] Computed 87 invariants in 2 ms
[2024-05-25 15:40:14] [INFO ] Implicit Places using invariants in 133 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 148 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 152/519 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 170/598 places, 152/519 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s114 1), p1:(EQ s130 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-08 finished in 351 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(X(p0)) U (!p0||F((p1||X(p2)))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 504
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 500
Applied a total of 38 rules in 35 ms. Remains 579 /598 variables (removed 19) and now considering 500/519 (removed 19) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-25 15:40:15] [INFO ] Computed 117 invariants in 5 ms
[2024-05-25 15:40:15] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-25 15:40:15] [INFO ] Invariant cache hit.
[2024-05-25 15:40:16] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
[2024-05-25 15:40:16] [INFO ] Invariant cache hit.
[2024-05-25 15:40:16] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 500/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1581 ms. Remains : 579/598 places, 500/519 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s13 1), p1:(EQ s356 1), p2:(EQ s7 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][false, false, false, false]]
Product exploration explored 100000 steps with 852 reset in 239 ms.
Stack based approach found an accepted trace after 58373 steps with 510 reset with depth 47 and stack size 47 in 169 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-09 finished in 2181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((p1||G(p2)))))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (trivial) has 289 edges and 598 vertex of which 6 / 598 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 1310 edges and 593 vertex of which 592 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 437
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 437
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 150 place count 517 transition count 311
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 427 place count 366 transition count 311
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 441 place count 352 transition count 297
Iterating global reduction 2 with 14 rules applied. Total rules applied 455 place count 352 transition count 297
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 301 rules applied. Total rules applied 756 place count 199 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 758 place count 198 transition count 152
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 764 place count 198 transition count 152
Applied a total of 764 rules in 60 ms. Remains 198 /598 variables (removed 400) and now considering 152/519 (removed 367) transitions.
// Phase 1: matrix 152 rows 198 cols
[2024-05-25 15:40:17] [INFO ] Computed 87 invariants in 3 ms
[2024-05-25 15:40:17] [INFO ] Implicit Places using invariants in 226 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 229 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 152/519 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 296 ms. Remains : 170/598 places, 152/519 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s130 0), p1:(EQ s71 1), p0:(EQ s130 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21177 reset in 302 ms.
Product exploration explored 100000 steps with 21120 reset in 289 ms.
Computed a total of 147 stabilizing places and 134 stable transitions
Computed a total of 147 stabilizing places and 134 stable transitions
Detected a total of 147/170 stabilizing places and 134/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 1280 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1705 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 689 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 703 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 702 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 152 rows 170 cols
[2024-05-25 15:40:20] [INFO ] Computed 59 invariants in 2 ms
[2024-05-25 15:40:20] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned sat
[2024-05-25 15:40:20] [INFO ] [Real]Absence check using 42 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-25 15:40:20] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-25 15:40:20] [INFO ] [Nat]Absence check using 42 positive place invariants in 10 ms returned sat
[2024-05-25 15:40:20] [INFO ] [Nat]Absence check using 42 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 15:40:20] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-25 15:40:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:40:20] [INFO ] After 20ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-25 15:40:20] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-25 15:40:20] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 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 170 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 170 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 168 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 168 transition count 149
Applied a total of 6 rules in 15 ms. Remains 168 /170 variables (removed 2) and now considering 149/152 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 168/170 places, 149/152 transitions.
Finished random walk after 312 steps, including 15 resets, run visited all 1 properties in 1 ms. (steps per millisecond=312 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 1086 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-10 finished in 4478 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 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 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 1310 edges and 593 vertex of which 592 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 437
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 437
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 150 place count 517 transition count 312
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 275 rules applied. Total rules applied 425 place count 367 transition count 312
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 439 place count 353 transition count 298
Iterating global reduction 2 with 14 rules applied. Total rules applied 453 place count 353 transition count 298
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 301 rules applied. Total rules applied 754 place count 200 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 756 place count 199 transition count 153
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 762 place count 199 transition count 153
Applied a total of 762 rules in 79 ms. Remains 199 /598 variables (removed 399) and now considering 153/519 (removed 366) transitions.
// Phase 1: matrix 153 rows 199 cols
[2024-05-25 15:40:21] [INFO ] Computed 87 invariants in 3 ms
[2024-05-25 15:40:22] [INFO ] Implicit Places using invariants in 228 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 231 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/598 places, 153/519 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 315 ms. Remains : 171/598 places, 153/519 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s68 1) (AND (EQ s17 1) (EQ s87 1) (EQ s133 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-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-11 finished in 383 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))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 584 transition count 505
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 584 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 581 transition count 502
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 581 transition count 502
Applied a total of 34 rules in 91 ms. Remains 581 /598 variables (removed 17) and now considering 502/519 (removed 17) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-25 15:40:22] [INFO ] Computed 117 invariants in 3 ms
[2024-05-25 15:40:22] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-05-25 15:40:22] [INFO ] Invariant cache hit.
[2024-05-25 15:40:23] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2024-05-25 15:40:23] [INFO ] Invariant cache hit.
[2024-05-25 15:40:23] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 581/598 places, 502/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1692 ms. Remains : 581/598 places, 502/519 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s484 1) (EQ s175 1)), p1:(EQ s498 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1311 steps with 6 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-12 finished in 1810 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(G(p0))&&F(p1))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 504
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 500
Applied a total of 38 rules in 45 ms. Remains 579 /598 variables (removed 19) and now considering 500/519 (removed 19) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-25 15:40:24] [INFO ] Computed 117 invariants in 4 ms
[2024-05-25 15:40:24] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-25 15:40:24] [INFO ] Invariant cache hit.
[2024-05-25 15:40:24] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
[2024-05-25 15:40:24] [INFO ] Invariant cache hit.
[2024-05-25 15:40:25] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 500/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1258 ms. Remains : 579/598 places, 500/519 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NEQ s70 1) (NEQ s73 1)), p0:(EQ s511 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 175 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-13 finished in 1432 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)||X((p1||G((p1||X(G(p2)))))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 504
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 504
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 580 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 580 transition count 501
Applied a total of 36 rules in 35 ms. Remains 580 /598 variables (removed 18) and now considering 501/519 (removed 18) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-25 15:40:25] [INFO ] Computed 117 invariants in 4 ms
[2024-05-25 15:40:25] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-25 15:40:25] [INFO ] Invariant cache hit.
[2024-05-25 15:40:26] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2024-05-25 15:40:26] [INFO ] Invariant cache hit.
[2024-05-25 15:40:26] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/598 places, 501/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1167 ms. Remains : 580/598 places, 501/519 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s537 1), p1:(EQ s202 1), p2:(EQ s507 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-14 finished in 1365 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) U X((X(X(G(!p1)))||(p2 U p1)))))'
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 584 transition count 505
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 580 transition count 501
Applied a total of 36 rules in 35 ms. Remains 580 /598 variables (removed 18) and now considering 501/519 (removed 18) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-25 15:40:26] [INFO ] Computed 117 invariants in 9 ms
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-25 15:40:27] [INFO ] Invariant cache hit.
[2024-05-25 15:40:27] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2024-05-25 15:40:27] [INFO ] Invariant cache hit.
[2024-05-25 15:40:28] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/598 places, 501/519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1339 ms. Remains : 580/598 places, 501/519 transitions.
Stuttering acceptance computed with spot in 253 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s378 1) (EQ s487 1)), p1:(AND (EQ s127 1) (EQ s405 1) (EQ s545 1)), p2:(EQ s487 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 549 reset in 289 ms.
Product exploration explored 100000 steps with 553 reset in 329 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 364 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 735637 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 735637 steps, saw 114105 distinct states, run finished after 3002 ms. (steps per millisecond=245 ) properties seen :5
Running SMT prover for 1 properties.
[2024-05-25 15:40:33] [INFO ] Invariant cache hit.
[2024-05-25 15:40:33] [INFO ] [Real]Absence check using 70 positive place invariants in 22 ms returned sat
[2024-05-25 15:40:33] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 22 ms returned sat
[2024-05-25 15:40:33] [INFO ] After 232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 403 ms
[2024-05-25 15:40:34] [INFO ] After 661ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:34] [INFO ] After 832ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:34] [INFO ] [Nat]Absence check using 70 positive place invariants in 25 ms returned sat
[2024-05-25 15:40:34] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 33 ms returned sat
[2024-05-25 15:40:34] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 2 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 82 places in 268 ms of which 1 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 85 places in 169 ms of which 0 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 0 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:40:36] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:40:37] [INFO ] Deduced a trap composed of 109 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-25 15:40:38] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4441 ms
[2024-05-25 15:40:38] [INFO ] After 4731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-25 15:40:38] [INFO ] After 4926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 269 edges and 580 vertex of which 6 / 580 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1289 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 510 transition count 306
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 401 place count 362 transition count 306
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 323 rules applied. Total rules applied 724 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 726 place count 197 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 197 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 730 place count 195 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 731 place count 195 transition count 148
Applied a total of 731 rules in 33 ms. Remains 195 /580 variables (removed 385) and now considering 148/501 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 195/580 places, 148/501 transitions.
Incomplete random walk after 10000 steps, including 461 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Finished Best-First random walk after 124 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 12 factoid took 1147 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 370 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 17 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-25 15:40:40] [INFO ] Invariant cache hit.
[2024-05-25 15:40:41] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 15:40:41] [INFO ] Invariant cache hit.
[2024-05-25 15:40:41] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2024-05-25 15:40:41] [INFO ] Invariant cache hit.
[2024-05-25 15:40:42] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1216 ms. Remains : 580/580 places, 501/501 transitions.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 348 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 53 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:40:43] [INFO ] Invariant cache hit.
[2024-05-25 15:40:43] [INFO ] [Real]Absence check using 70 positive place invariants in 22 ms returned sat
[2024-05-25 15:40:43] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-25 15:40:43] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:40:43] [INFO ] [Nat]Absence check using 70 positive place invariants in 18 ms returned sat
[2024-05-25 15:40:43] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 21 ms returned sat
[2024-05-25 15:40:44] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:40:44] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2024-05-25 15:40:45] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1776 ms
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 640 ms
[2024-05-25 15:40:46] [INFO ] After 3102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-25 15:40:47] [INFO ] After 3505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 579 transition count 437
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 516 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 514 transition count 435
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 131 place count 514 transition count 311
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 404 place count 365 transition count 311
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 323 rules applied. Total rules applied 727 place count 201 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 728 place count 201 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 730 place count 200 transition count 154
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 736 place count 200 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 199 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 198 transition count 153
Applied a total of 738 rules in 50 ms. Remains 198 /580 variables (removed 382) and now considering 153/501 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 198/580 places, 153/501 transitions.
Incomplete random walk after 10000 steps, including 1083 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 262 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 269 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Finished probabilistic random walk after 12879 steps, run visited all 4 properties in 72 ms. (steps per millisecond=178 )
Probabilistic random walk after 12879 steps, saw 4616 distinct states, run finished after 72 ms. (steps per millisecond=178 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 12 factoid took 997 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 300 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 551 reset in 315 ms.
Product exploration explored 100000 steps with 553 reset in 324 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 245 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 579 transition count 500
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 579 transition count 566
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 579 transition count 566
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 557 transition count 525
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 557 transition count 525
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 323 places in 1 ms
Iterating global reduction 1 with 193 rules applied. Total rules applied 390 place count 557 transition count 525
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 436 place count 511 transition count 479
Deduced a syphon composed of 277 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 482 place count 511 transition count 479
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 485 place count 511 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 486 place count 511 transition count 490
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 489 place count 508 transition count 484
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 492 place count 508 transition count 484
Deduced a syphon composed of 277 places in 0 ms
Applied a total of 492 rules in 149 ms. Remains 508 /580 variables (removed 72) and now considering 484/501 (removed 17) transitions.
[2024-05-25 15:40:50] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 484 rows 508 cols
[2024-05-25 15:40:50] [INFO ] Computed 117 invariants in 9 ms
[2024-05-25 15:40:51] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/580 places, 484/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 612 ms. Remains : 508/580 places, 484/501 transitions.
Built C files in :
/tmp/ltsmin7993630816679161087
[2024-05-25 15:40:51] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7993630816679161087
Running compilation step : cd /tmp/ltsmin7993630816679161087;'/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 1005 ms.
Running link step : cd /tmp/ltsmin7993630816679161087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7993630816679161087;'/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/stateBased3700281574497510925.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 13 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-25 15:41:06] [INFO ] Computed 117 invariants in 3 ms
[2024-05-25 15:41:06] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-25 15:41:06] [INFO ] Invariant cache hit.
[2024-05-25 15:41:07] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2024-05-25 15:41:07] [INFO ] Invariant cache hit.
[2024-05-25 15:41:07] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1208 ms. Remains : 580/580 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin5506898389179932652
[2024-05-25 15:41:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5506898389179932652
Running compilation step : cd /tmp/ltsmin5506898389179932652;'/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 815 ms.
Running link step : cd /tmp/ltsmin5506898389179932652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5506898389179932652;'/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/stateBased4562479524490658033.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:41:22] [INFO ] Flatten gal took : 44 ms
[2024-05-25 15:41:22] [INFO ] Flatten gal took : 35 ms
[2024-05-25 15:41:22] [INFO ] Time to serialize gal into /tmp/LTL7661586551620329227.gal : 8 ms
[2024-05-25 15:41:22] [INFO ] Time to serialize properties into /tmp/LTL3959147465213016542.prop : 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/LTL7661586551620329227.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12165828669405541571.hoa' '-atoms' '/tmp/LTL3959147465213016542.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/LTL3959147465213016542.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12165828669405541571.hoa
Detected timeout of ITS tools.
[2024-05-25 15:41:38] [INFO ] Flatten gal took : 22 ms
[2024-05-25 15:41:38] [INFO ] Flatten gal took : 20 ms
[2024-05-25 15:41:38] [INFO ] Time to serialize gal into /tmp/LTL16912418984847455287.gal : 4 ms
[2024-05-25 15:41:38] [INFO ] Time to serialize properties into /tmp/LTL5226379019713808410.ltl : 5 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/LTL16912418984847455287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5226379019713808410.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 : !(((F("((p449==1)&&(p606==1))"))U(X((X(X(G(!("(((p146==1)&&(p482==1))&&(p737==1))")))))||(("(p606==1)")U("(((p146==1)&&(p482==1))&&(p7...169
Formula 0 simplified : G!"((p449==1)&&(p606==1))" R X(XXF"(((p146==1)&&(p482==1))&&(p737==1))" & (!"(p606==1)" R !"(((p146==1)&&(p482==1))&&(p737==1))"))
Detected timeout of ITS tools.
[2024-05-25 15:41:53] [INFO ] Flatten gal took : 27 ms
[2024-05-25 15:41:53] [INFO ] Applying decomposition
[2024-05-25 15:41:53] [INFO ] Flatten gal took : 26 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/graph4158336926265447042.txt' '-o' '/tmp/graph4158336926265447042.bin' '-w' '/tmp/graph4158336926265447042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4158336926265447042.bin' '-l' '-1' '-v' '-w' '/tmp/graph4158336926265447042.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:41:53] [INFO ] Decomposing Gal with order
[2024-05-25 15:41:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:41:53] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-25 15:41:53] [INFO ] Flatten gal took : 99 ms
[2024-05-25 15:41:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 24 ms.
[2024-05-25 15:41:53] [INFO ] Time to serialize gal into /tmp/LTL1383248356929891999.gal : 11 ms
[2024-05-25 15:41:53] [INFO ] Time to serialize properties into /tmp/LTL4722206982945350742.ltl : 3 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/LTL1383248356929891999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4722206982945350742.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...254
Read 1 LTL properties
Checking formula 0 : !(((F("((i2.i2.u134.p449==1)&&(i16.i1.u158.p606==1))"))U(X((X(X(G(!("(((i7.i0.u49.p146==1)&&(i17.i1.u142.p482==1))&&(i16.i1.u158.p737=...272
Formula 0 simplified : G!"((i2.i2.u134.p449==1)&&(i16.i1.u158.p606==1))" R X(XXF"(((i7.i0.u49.p146==1)&&(i17.i1.u142.p482==1))&&(i16.i1.u158.p737==1))" & (...256
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t219, t303, t316, t324, t406, t409, t482, t483, t487, t489, t491, t492, t494...1630
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5957809690979433517
[2024-05-25 15:42:08] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5957809690979433517
Running compilation step : cd /tmp/ltsmin5957809690979433517;'/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 1050 ms.
Running link step : cd /tmp/ltsmin5957809690979433517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5957809690979433517;'/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)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-19-LTLFireability-15 finished in 117014 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) U X((X(X(G(!p1)))||(p2 U p1)))))'
[2024-05-25 15:42:23] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11996942246379773198
[2024-05-25 15:42:23] [INFO ] Computing symmetric may disable matrix : 519 transitions.
[2024-05-25 15:42:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:23] [INFO ] Computing symmetric may enable matrix : 519 transitions.
[2024-05-25 15:42:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:23] [INFO ] Applying decomposition
[2024-05-25 15:42:23] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:42:24] [INFO ] Computing Do-Not-Accords matrix : 519 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/graph5148053511597448948.txt' '-o' '/tmp/graph5148053511597448948.bin' '-w' '/tmp/graph5148053511597448948.weights'
[2024-05-25 15:42:24] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:24] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11996942246379773198
Running compilation step : cd /tmp/ltsmin11996942246379773198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5148053511597448948.bin' '-l' '-1' '-v' '-w' '/tmp/graph5148053511597448948.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:42:24] [INFO ] Decomposing Gal with order
[2024-05-25 15:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:42:24] [INFO ] Removed a total of 291 redundant transitions.
[2024-05-25 15:42:24] [INFO ] Flatten gal took : 55 ms
[2024-05-25 15:42:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 19 ms.
[2024-05-25 15:42:24] [INFO ] Time to serialize gal into /tmp/LTLFireability13975872306978553104.gal : 31 ms
[2024-05-25 15:42:24] [INFO ] Time to serialize properties into /tmp/LTLFireability12699909876574155085.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/LTLFireability13975872306978553104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12699909876574155085.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...278
Read 1 LTL properties
Checking formula 0 : !(((F("((i11.i2.u138.p449==1)&&(i19.i0.u163.p606==1))"))U(X((X(X(G(!("(((i3.u48.p146==1)&&(i17.i0.u146.p482==1))&&(i19.i1.u165.p737==1...267
Formula 0 simplified : G!"((i11.i2.u138.p449==1)&&(i19.i0.u163.p606==1))" R X(XXF"(((i3.u48.p146==1)&&(i17.i0.u146.p482==1))&&(i19.i1.u165.p737==1))" & (!"...251
Compilation finished in 1277 ms.
Running link step : cd /tmp/ltsmin11996942246379773198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin11996942246379773198;'/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)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t320, t332, t406, t409, t483, t489, t491, t494, t496, t514, i0.i0.u98.t212, i0.i0.u16...1811
Computing Next relation with stutter on 109584 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.070: LTL layer: formula: (<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))
pins2lts-mc-linux64( 7/ 8), 0.070: "(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.071: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.148: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.163: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.248: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.395: DFS-FIFO for weak LTL, using special progress label 523
pins2lts-mc-linux64( 0/ 8), 0.395: There are 524 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.395: State length is 599, there are 538 groups
pins2lts-mc-linux64( 0/ 8), 0.395: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.395: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.395: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.395: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.724: ~1 levels ~960 states ~4728 transitions
pins2lts-mc-linux64( 7/ 8), 0.808: ~1 levels ~1920 states ~10032 transitions
pins2lts-mc-linux64( 4/ 8), 1.022: ~1 levels ~3840 states ~25408 transitions
pins2lts-mc-linux64( 5/ 8), 1.465: ~1 levels ~7680 states ~54560 transitions
pins2lts-mc-linux64( 5/ 8), 2.600: ~1 levels ~15360 states ~114456 transitions
pins2lts-mc-linux64( 0/ 8), 3.744: ~1 levels ~30720 states ~244464 transitions
pins2lts-mc-linux64( 5/ 8), 6.176: ~1 levels ~61440 states ~543064 transitions
pins2lts-mc-linux64( 5/ 8), 11.059: ~1 levels ~122880 states ~1181832 transitions
pins2lts-mc-linux64( 4/ 8), 19.633: ~1 levels ~245760 states ~2500720 transitions
pins2lts-mc-linux64( 4/ 8), 37.296: ~1 levels ~491520 states ~5208736 transitions
pins2lts-mc-linux64( 4/ 8), 57.724: ~1 levels ~983040 states ~11175016 transitions
pins2lts-mc-linux64( 6/ 8), 84.522: ~1 levels ~1966080 states ~21135256 transitions
pins2lts-mc-linux64( 0/ 8), 143.347: ~1 levels ~3932160 states ~46939816 transitions
pins2lts-mc-linux64( 0/ 8), 260.411: ~1 levels ~7864320 states ~99812328 transitions
pins2lts-mc-linux64( 0/ 8), 492.065: ~1 levels ~15728640 states ~210462192 transitions
pins2lts-mc-linux64( 7/ 8), 651.730: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 651.865:
pins2lts-mc-linux64( 0/ 8), 651.865: mean standard work distribution: 1.6% (states) 4.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 651.865:
pins2lts-mc-linux64( 0/ 8), 651.866: Explored 20228870 states 278833002 transitions, fanout: 13.784
pins2lts-mc-linux64( 0/ 8), 651.866: Total exploration time 651.470 sec (651.300 sec minimum, 651.366 sec on average)
pins2lts-mc-linux64( 0/ 8), 651.866: States per second: 31051, Transitions per second: 428006
pins2lts-mc-linux64( 0/ 8), 651.866:
pins2lts-mc-linux64( 0/ 8), 651.866: Progress states detected: 40370019
pins2lts-mc-linux64( 0/ 8), 651.866: Redundant explorations: -49.8914
pins2lts-mc-linux64( 0/ 8), 651.866:
pins2lts-mc-linux64( 0/ 8), 651.866: Queue width: 8B, total height: 32877966, memory: 250.84MB
pins2lts-mc-linux64( 0/ 8), 651.866: Tree memory: 564.0MB, 14.6 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 651.866: Tree fill ratio (roots/leafs): 30.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 651.866: Stored 525 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 651.866: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 651.866: Est. total memory use: 814.8MB (~1274.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11996942246379773198;'/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)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11996942246379773198;'/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)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==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:03:22] [INFO ] Applying decomposition
[2024-05-25 16:03:23] [INFO ] Flatten gal took : 287 ms
[2024-05-25 16:03:23] [INFO ] Decomposing Gal with order
[2024-05-25 16:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:03:23] [INFO ] Removed a total of 141 redundant transitions.
[2024-05-25 16:03:24] [INFO ] Flatten gal took : 331 ms
[2024-05-25 16:03:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 1028 ms.
[2024-05-25 16:03:26] [INFO ] Time to serialize gal into /tmp/LTLFireability13974494694685283699.gal : 49 ms
[2024-05-25 16:03:26] [INFO ] Time to serialize properties into /tmp/LTLFireability12156881658789317147.ltl : 4 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/LTLFireability13974494694685283699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12156881658789317147.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...278
Read 1 LTL properties
Checking formula 0 : !(((F("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p449==1)&&(i1.u182.p606==1))"))U(X((X(X(G(!("(((...536
Formula 0 simplified : G!"((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p449==1)&&(i1.u182.p606==1))" R X(XXF"(((i0.i0.i0....520
Detected timeout of ITS tools.
[2024-05-25 16:24:25] [INFO ] Flatten gal took : 607 ms
[2024-05-25 16:24:26] [INFO ] Input system was already deterministic with 519 transitions.
[2024-05-25 16:24:26] [INFO ] Transformed 598 places.
[2024-05-25 16:24:26] [INFO ] Transformed 519 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:24:56] [INFO ] Time to serialize gal into /tmp/LTLFireability15023752700896355120.gal : 8 ms
[2024-05-25 16:24:56] [INFO ] Time to serialize properties into /tmp/LTLFireability17581514457863851445.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/LTLFireability15023752700896355120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17581514457863851445.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 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((p449==1)&&(p606==1))"))U(X((X(X(G(!("(((p146==1)&&(p482==1))&&(p737==1))")))))||(("(p606==1)")U("(((p146==1)&&(p482==1))&&(p7...169
Formula 0 simplified : G!"((p449==1)&&(p606==1))" R X(XXF"(((p146==1)&&(p482==1))&&(p737==1))" & (!"(p606==1)" R !"(((p146==1)&&(p482==1))&&(p737==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 163408 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16202096 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-19"
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-19, 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-171620415000373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "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 ;