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.r048-tajo-171620399800588.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 itstools
Input is BusinessProcesses-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 177K 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-18-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716337254703

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:20:56] [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-22 00:20:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:20:56] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-22 00:20:56] [INFO ] Transformed 717 places.
[2024-05-22 00:20:56] [INFO ] Transformed 642 transitions.
[2024-05-22 00:20:56] [INFO ] Found NUPN structural information;
[2024-05-22 00:20:56] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 102 place count 600 transition count 533
Iterating global reduction 1 with 94 rules applied. Total rules applied 196 place count 600 transition count 533
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 243 place count 553 transition count 486
Iterating global reduction 1 with 47 rules applied. Total rules applied 290 place count 553 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 552 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 552 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 551 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 551 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 295 place count 550 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 296 place count 550 transition count 483
Applied a total of 296 rules in 292 ms. Remains 550 /702 variables (removed 152) and now considering 483/627 (removed 144) transitions.
// Phase 1: matrix 483 rows 550 cols
[2024-05-22 00:20:57] [INFO ] Computed 106 invariants in 40 ms
[2024-05-22 00:20:57] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-22 00:20:57] [INFO ] Invariant cache hit.
[2024-05-22 00:20:58] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-22 00:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/550 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 77 places in 882 ms of which 27 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 13 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 4 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 4 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 102 places in 3641 ms of which 6 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 4 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 4 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 96 places in 206 ms of which 3 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 84 places in 214 ms of which 2 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 109 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 5 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 82 places in 232 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 6 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 129 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 4 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:24] [INFO ] Deduced a trap composed of 103 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:21:24] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 3 ms to minimize.
[2024-05-22 00:21:24] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:21:24] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:21:24] [INFO ] Deduced a trap composed of 99 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 128 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 111 places in 197 ms of which 2 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 97 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 109 places in 198 ms of which 5 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 103 places in 231 ms of which 6 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 9 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 101 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 101 places in 753 ms of which 4 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 20/166 constraints. Problems are: Problem set: 16 solved, 466 unsolved
[2024-05-22 00:21:28] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 5 ms to minimize.
SMT process timed out in 30328ms, After SMT, problems are : Problem set: 16 solved, 466 unsolved
Search for dead transitions found 16 dead transitions in 30347ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 550/702 places, 467/627 transitions.
Applied a total of 0 rules in 23 ms. Remains 550 /550 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31921 ms. Remains : 550/702 places, 467/627 transitions.
Support contains 42 out of 550 places after structural reductions.
[2024-05-22 00:21:29] [INFO ] Flatten gal took : 112 ms
[2024-05-22 00:21:29] [INFO ] Flatten gal took : 52 ms
[2024-05-22 00:21:29] [INFO ] Input system was already deterministic with 467 transitions.
RANDOM walk for 40000 steps (207 resets) in 2599 ms. (15 steps per ms) remains 14/31 properties
BEST_FIRST walk for 40001 steps (37 resets) in 303 ms. (131 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (38 resets) in 183 ms. (217 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (36 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 262 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (38 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (35 resets) in 96 ms. (412 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40002 steps (36 resets) in 117 ms. (339 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (38 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (38 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (36 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (37 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
// Phase 1: matrix 467 rows 550 cols
[2024-05-22 00:21:30] [INFO ] Computed 106 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 65/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 294/375 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 132/507 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 31/538 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 459/997 variables, 538/644 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 17/1014 variables, 9/653 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 11 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 3 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 94 places in 216 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 94 places in 206 ms of which 11 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1014 variables, 20/673 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 96 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
SMT process timed out in 5033ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 467/467 transitions.
Graph (complete) has 1194 edges and 550 vertex of which 549 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 (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 549 transition count 405
Reduce places removed 61 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 64 rules applied. Total rules applied 126 place count 488 transition count 402
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 485 transition count 402
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 129 place count 485 transition count 292
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 371 place count 353 transition count 292
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 379 place count 345 transition count 284
Iterating global reduction 3 with 8 rules applied. Total rules applied 387 place count 345 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 389 place count 345 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 390 place count 344 transition count 282
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 5 with 287 rules applied. Total rules applied 677 place count 199 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 678 place count 199 transition count 139
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 6 with 2 rules applied. Total rules applied 680 place count 198 transition count 142
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 688 place count 198 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 689 place count 197 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 690 place count 196 transition count 141
Applied a total of 690 rules in 102 ms. Remains 196 /550 variables (removed 354) and now considering 141/467 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 196/550 places, 141/467 transitions.
RANDOM walk for 40000 steps (3056 resets) in 969 ms. (41 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40002 steps (1049 resets) in 294 ms. (135 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (1051 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1048 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1051 resets) in 266 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1044 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1037 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1067 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1036 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
// Phase 1: matrix 141 rows 196 cols
[2024-05-22 00:21:37] [INFO ] Computed 80 invariants in 3 ms
[2024-05-22 00:21:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 60/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 29/102 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 27/129 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/130 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 141/271 variables, 130/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 66/337 variables, 66/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 31/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/337 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/337 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 287 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3029 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 196/196 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 60/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 29/102 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 27/129 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/130 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 141/271 variables, 130/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/271 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 66/337 variables, 66/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/337 variables, 31/296 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/337 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/337 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/337 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 298 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 196/196 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 10/10 constraints]
After SMT, in 4372ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 151 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 1326 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 492 stabilizing places and 418 stable transitions
Graph (complete) has 1194 edges and 550 vertex of which 549 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Graph (trivial) has 270 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1186 edges and 544 vertex of which 543 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 542 transition count 389
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 474 transition count 389
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 138 place count 474 transition count 274
Deduced a syphon composed of 115 places in 13 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 393 place count 334 transition count 274
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 404 place count 323 transition count 263
Iterating global reduction 2 with 11 rules applied. Total rules applied 415 place count 323 transition count 263
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 702 place count 178 transition count 121
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 704 place count 177 transition count 124
Applied a total of 704 rules in 79 ms. Remains 177 /550 variables (removed 373) and now considering 124/467 (removed 343) transitions.
// Phase 1: matrix 124 rows 177 cols
[2024-05-22 00:21:43] [INFO ] Computed 78 invariants in 3 ms
[2024-05-22 00:21:43] [INFO ] Implicit Places using invariants in 242 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 245 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/550 places, 124/467 transitions.
Applied a total of 0 rules in 11 ms. Remains 149 /149 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 149/550 places, 124/467 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-00 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||(!p1 U p0)))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Graph (trivial) has 267 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1186 edges and 544 vertex of which 543 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 68 place count 542 transition count 391
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 476 transition count 391
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 134 place count 476 transition count 277
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 387 place count 337 transition count 277
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 397 place count 327 transition count 267
Iterating global reduction 2 with 10 rules applied. Total rules applied 407 place count 327 transition count 267
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 696 place count 181 transition count 124
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 698 place count 180 transition count 127
Applied a total of 698 rules in 50 ms. Remains 180 /550 variables (removed 370) and now considering 127/467 (removed 340) transitions.
// Phase 1: matrix 127 rows 180 cols
[2024-05-22 00:21:44] [INFO ] Computed 78 invariants in 2 ms
[2024-05-22 00:21:44] [INFO ] Implicit Places using invariants in 188 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 203 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/550 places, 127/467 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 152/550 places, 127/467 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-01 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 537 transition count 454
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 537 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 537 transition count 453
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 532 transition count 448
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 532 transition count 448
Applied a total of 37 rules in 40 ms. Remains 532 /550 variables (removed 18) and now considering 448/467 (removed 19) transitions.
// Phase 1: matrix 448 rows 532 cols
[2024-05-22 00:21:44] [INFO ] Computed 106 invariants in 10 ms
[2024-05-22 00:21:44] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-22 00:21:44] [INFO ] Invariant cache hit.
[2024-05-22 00:21:45] [INFO ] Implicit Places using invariants and state equation in 644 ms returned [466]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 996 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/550 places, 448/467 transitions.
Applied a total of 0 rules in 10 ms. Remains 531 /531 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1046 ms. Remains : 531/550 places, 448/467 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-02
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-02 finished in 1328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X((p1 U X(p2))) U (p3&&X((p1 U X(p2))))))||p0))))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 540 transition count 457
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 540 transition count 457
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 537 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 537 transition count 454
Applied a total of 26 rules in 25 ms. Remains 537 /550 variables (removed 13) and now considering 454/467 (removed 13) transitions.
// Phase 1: matrix 454 rows 537 cols
[2024-05-22 00:21:45] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:21:46] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-22 00:21:46] [INFO ] Invariant cache hit.
[2024-05-22 00:21:47] [INFO ] Implicit Places using invariants and state equation in 956 ms returned [471]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1297 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 536/550 places, 454/467 transitions.
Applied a total of 0 rules in 8 ms. Remains 536 /536 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1330 ms. Remains : 536/550 places, 454/467 transitions.
Stuttering acceptance computed with spot in 448 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4953 steps with 27 reset in 20 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-03 finished in 1818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 536 transition count 453
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 536 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 536 transition count 452
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 531 transition count 447
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 531 transition count 447
Applied a total of 39 rules in 36 ms. Remains 531 /550 variables (removed 19) and now considering 447/467 (removed 20) transitions.
// Phase 1: matrix 447 rows 531 cols
[2024-05-22 00:21:47] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:21:47] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-22 00:21:48] [INFO ] Invariant cache hit.
[2024-05-22 00:21:48] [INFO ] Implicit Places using invariants and state equation in 704 ms returned [465]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 966 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/550 places, 447/467 transitions.
Applied a total of 0 rules in 7 ms. Remains 530 /530 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1009 ms. Remains : 530/550 places, 447/467 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-04
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-04 finished in 1176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&G(F(((p0&&X((p1||F(p2))))||G((p1||F(p2)))))))))))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 538 transition count 455
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 538 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 538 transition count 454
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 533 transition count 449
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 533 transition count 449
Applied a total of 35 rules in 32 ms. Remains 533 /550 variables (removed 17) and now considering 449/467 (removed 18) transitions.
// Phase 1: matrix 449 rows 533 cols
[2024-05-22 00:21:48] [INFO ] Computed 106 invariants in 3 ms
[2024-05-22 00:21:49] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-22 00:21:49] [INFO ] Invariant cache hit.
[2024-05-22 00:21:50] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned [467]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 449/467 transitions.
Applied a total of 0 rules in 7 ms. Remains 532 /532 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1403 ms. Remains : 532/550 places, 449/467 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 526 reset in 351 ms.
Product exploration explored 100000 steps with 529 reset in 638 ms.
Computed a total of 477 stabilizing places and 404 stable transitions
Graph (complete) has 1167 edges and 532 vertex of which 531 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 477 stabilizing places and 404 stable transitions
Detected a total of 477/532 stabilizing places and 404/449 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 393 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (207 resets) in 452 ms. (88 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (35 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (34 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (34 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
// Phase 1: matrix 449 rows 532 cols
[2024-05-22 00:21:52] [INFO ] Computed 105 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 302/360 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 11 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 10 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 144/504 variables, 32/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/520 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 441/961 variables, 520/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/961 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/961 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 17/978 variables, 9/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/978 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/981 variables, 3/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/981 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/981 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/981 variables, and 651 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1825 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 532/532 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 302/360 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 144/504 variables, 32/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/520 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 441/961 variables, 520/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/961 variables, 3/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/961 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/961 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/961 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 17/978 variables, 9/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/978 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/978 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 3/981 variables, 3/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/981 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/981 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 981/981 variables, and 668 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2348 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 532/532 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 28/28 constraints]
After SMT, in 4203ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 545 ms.
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 449/449 transitions.
Graph (trivial) has 250 edges and 532 vertex of which 6 / 532 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1152 edges and 527 vertex of which 526 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 (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 526 transition count 381
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 466 transition count 381
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 466 transition count 268
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 328 transition count 268
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 666 place count 180 transition count 123
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 668 place count 179 transition count 126
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 669 place count 179 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 670 place count 178 transition count 125
Applied a total of 670 rules in 57 ms. Remains 178 /532 variables (removed 354) and now considering 125/449 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 178/532 places, 125/449 transitions.
RANDOM walk for 40000 steps (2043 resets) in 623 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (538 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 127222 steps, run visited all 1 properties in 793 ms. (steps per millisecond=160 )
Probabilistic random walk after 127222 steps, saw 33385 distinct states, run finished after 809 ms. (steps per millisecond=157 ) properties seen :1
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 15 factoid took 1138 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 449/449 transitions.
Graph (trivial) has 250 edges and 532 vertex of which 6 / 532 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 1160 edges and 527 vertex of which 526 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 (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 525 transition count 381
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 465 transition count 381
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 465 transition count 268
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 327 transition count 268
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 664 place count 180 transition count 124
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 666 place count 179 transition count 127
Applied a total of 666 rules in 80 ms. Remains 179 /532 variables (removed 353) and now considering 127/449 (removed 322) transitions.
// Phase 1: matrix 127 rows 179 cols
[2024-05-22 00:22:00] [INFO ] Computed 77 invariants in 3 ms
[2024-05-22 00:22:00] [INFO ] Implicit Places using invariants in 304 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 306 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/532 places, 127/449 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 392 ms. Remains : 152/532 places, 127/449 transitions.
Computed a total of 129 stabilizing places and 109 stable transitions
Computed a total of 129 stabilizing places and 109 stable transitions
Detected a total of 129/152 stabilizing places and 109/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 629 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (5163 resets) in 1404 ms. (28 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40001 steps (1882 resets) in 282 ms. (141 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (1447 resets) in 129 ms. (307 steps per ms) remains 1/2 properties
// Phase 1: matrix 127 rows 152 cols
[2024-05-22 00:22:02] [INFO ] Computed 50 invariants in 1 ms
[2024-05-22 00:22:02] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/127 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:22:02] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/148 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 126/274 variables, 148/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/278 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/278 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/279 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 152/152 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/127 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/148 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 126/274 variables, 148/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/278 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/278 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/279 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 152/152 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 127/127 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 126
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 152 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 151 transition count 125
Applied a total of 3 rules in 20 ms. Remains 151 /152 variables (removed 1) and now considering 125/127 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 151/152 places, 125/127 transitions.
RANDOM walk for 40000 steps (2012 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (549 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 127217 steps, run visited all 1 properties in 382 ms. (steps per millisecond=333 )
Probabilistic random walk after 127217 steps, saw 33384 distinct states, run finished after 382 ms. (steps per millisecond=333 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 1190 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 11202 reset in 249 ms.
Product exploration explored 100000 steps with 11098 reset in 310 ms.
Built C files in :
/tmp/ltsmin1361990403684211909
[2024-05-22 00:22:05] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2024-05-22 00:22:05] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:22:05] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2024-05-22 00:22:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:22:05] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2024-05-22 00:22:05] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:22:05] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1361990403684211909
Running compilation step : cd /tmp/ltsmin1361990403684211909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 842 ms.
Running link step : cd /tmp/ltsmin1361990403684211909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin1361990403684211909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7696687331523785389.hoa' '--buchi-type=spotba'
LTSmin run took 11368 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 29317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)&&F(p2)) U X(!p2)))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 537 transition count 454
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 537 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 537 transition count 453
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 533 transition count 449
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 533 transition count 449
Applied a total of 35 rules in 59 ms. Remains 533 /550 variables (removed 17) and now considering 449/467 (removed 18) transitions.
// Phase 1: matrix 449 rows 533 cols
[2024-05-22 00:22:18] [INFO ] Computed 106 invariants in 3 ms
[2024-05-22 00:22:18] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-22 00:22:18] [INFO ] Invariant cache hit.
[2024-05-22 00:22:19] [INFO ] Implicit Places using invariants and state equation in 658 ms returned [467]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 924 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 449/467 transitions.
Applied a total of 0 rules in 7 ms. Remains 532 /532 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 990 ms. Remains : 532/550 places, 449/467 transitions.
Stuttering acceptance computed with spot in 237 ms :[p2, p2, p2, true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-07 finished in 1276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 537 transition count 454
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 537 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 537 transition count 453
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 532 transition count 448
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 532 transition count 448
Applied a total of 37 rules in 33 ms. Remains 532 /550 variables (removed 18) and now considering 448/467 (removed 19) transitions.
// Phase 1: matrix 448 rows 532 cols
[2024-05-22 00:22:19] [INFO ] Computed 106 invariants in 3 ms
[2024-05-22 00:22:19] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 00:22:19] [INFO ] Invariant cache hit.
[2024-05-22 00:22:20] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned [466]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1282 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/550 places, 448/467 transitions.
Applied a total of 0 rules in 12 ms. Remains 531 /531 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1328 ms. Remains : 531/550 places, 448/467 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Product exploration explored 100000 steps with 33333 reset in 347 ms.
Computed a total of 476 stabilizing places and 403 stable transitions
Graph (complete) has 1164 edges and 531 vertex of which 530 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 476 stabilizing places and 403 stable transitions
Detected a total of 476/531 stabilizing places and 403/448 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 36 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-10 finished in 2223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Graph (trivial) has 270 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1186 edges and 544 vertex of which 543 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 (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 542 transition count 389
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 474 transition count 389
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 138 place count 474 transition count 275
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 391 place count 335 transition count 275
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 402 place count 324 transition count 264
Iterating global reduction 2 with 11 rules applied. Total rules applied 413 place count 324 transition count 264
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 702 place count 178 transition count 121
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 704 place count 177 transition count 124
Applied a total of 704 rules in 57 ms. Remains 177 /550 variables (removed 373) and now considering 124/467 (removed 343) transitions.
// Phase 1: matrix 124 rows 177 cols
[2024-05-22 00:22:21] [INFO ] Computed 78 invariants in 1 ms
[2024-05-22 00:22:21] [INFO ] Implicit Places using invariants in 188 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 190 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/550 places, 124/467 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 149/550 places, 124/467 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-11 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U (p1 U p2))))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 537 transition count 454
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 537 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 537 transition count 453
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 534 transition count 450
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 534 transition count 450
Applied a total of 33 rules in 36 ms. Remains 534 /550 variables (removed 16) and now considering 450/467 (removed 17) transitions.
// Phase 1: matrix 450 rows 534 cols
[2024-05-22 00:22:22] [INFO ] Computed 106 invariants in 5 ms
[2024-05-22 00:22:22] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-22 00:22:22] [INFO ] Invariant cache hit.
[2024-05-22 00:22:23] [INFO ] Implicit Places using invariants and state equation in 962 ms returned [466]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1271 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 533/550 places, 450/467 transitions.
Applied a total of 0 rules in 8 ms. Remains 533 /533 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1315 ms. Remains : 533/550 places, 450/467 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), p0]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 546 reset in 395 ms.
Product exploration explored 100000 steps with 542 reset in 276 ms.
Computed a total of 477 stabilizing places and 404 stable transitions
Graph (complete) has 1166 edges and 533 vertex of which 532 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 477 stabilizing places and 404 stable transitions
Detected a total of 477/533 stabilizing places and 404/450 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 414 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 499 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
RANDOM walk for 40000 steps (206 resets) in 317 ms. (125 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (34 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (37 resets) in 394 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (38 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (37 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
// Phase 1: matrix 450 rows 533 cols
[2024-05-22 00:22:25] [INFO ] Computed 105 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 302/361 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 145/506 variables, 32/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 8 (OVERLAPS) 15/521 variables, 10/107 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 106 places in 249 ms of which 5 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 103 places in 211 ms of which 5 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 103 places in 212 ms of which 5 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 4 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 3 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 100 places in 181 ms of which 2 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 90 places in 219 ms of which 4 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 90 places in 3359 ms of which 28 ms to minimize.
SMT process timed out in 5492ms, After SMT, problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 450/450 transitions.
Graph (trivial) has 251 edges and 533 vertex of which 6 / 533 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1159 edges and 528 vertex of which 527 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 (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 527 transition count 382
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 467 transition count 382
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 122 place count 467 transition count 270
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 370 place count 331 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 371 place count 330 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 372 place count 330 transition count 269
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 669 place count 180 transition count 122
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 671 place count 179 transition count 125
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 179 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 673 place count 178 transition count 124
Applied a total of 673 rules in 53 ms. Remains 178 /533 variables (removed 355) and now considering 124/450 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 178/533 places, 124/450 transitions.
RANDOM walk for 251 steps (7 resets) in 6 ms. (35 steps per ms) remains 0/1 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 13 factoid took 1268 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
[2024-05-22 00:22:33] [INFO ] Invariant cache hit.
[2024-05-22 00:22:33] [INFO ] [Real]Absence check using 63 positive place invariants in 24 ms returned sat
[2024-05-22 00:22:33] [INFO ] [Real]Absence check using 63 positive and 42 generalized place invariants in 28 ms returned sat
[2024-05-22 00:22:34] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2024-05-22 00:22:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:35] [INFO ] [Nat]Absence check using 63 positive place invariants in 44 ms returned sat
[2024-05-22 00:22:35] [INFO ] [Nat]Absence check using 63 positive and 42 generalized place invariants in 41 ms returned sat
[2024-05-22 00:22:36] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2024-05-22 00:22:36] [INFO ] Computed and/alt/rep : 445/817/445 causal constraints (skipped 4 transitions) in 53 ms.
[2024-05-22 00:22:38] [INFO ] Added : 209 causal constraints over 42 iterations in 1761 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 450/450 transitions.
Graph (trivial) has 247 edges and 533 vertex of which 4 / 533 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1163 edges and 530 vertex of which 529 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 (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 528 transition count 386
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 469 transition count 386
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 120 place count 469 transition count 274
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 368 place count 333 transition count 274
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 663 place count 184 transition count 128
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 665 place count 183 transition count 131
Applied a total of 665 rules in 28 ms. Remains 183 /533 variables (removed 350) and now considering 131/450 (removed 319) transitions.
// Phase 1: matrix 131 rows 183 cols
[2024-05-22 00:22:38] [INFO ] Computed 78 invariants in 1 ms
[2024-05-22 00:22:38] [INFO ] Implicit Places using invariants in 220 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 222 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/533 places, 131/450 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 155/533 places, 131/450 transitions.
Computed a total of 131 stabilizing places and 111 stable transitions
Computed a total of 131 stabilizing places and 111 stable transitions
Detected a total of 131/155 stabilizing places and 111/131 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2 p0))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 16 factoid took 694 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
RANDOM walk for 40000 steps (3692 resets) in 334 ms. (119 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (1189 resets) in 215 ms. (185 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1210 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1233 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1214 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1236 resets) in 123 ms. (322 steps per ms) remains 3/5 properties
// Phase 1: matrix 131 rows 155 cols
[2024-05-22 00:22:39] [INFO ] Computed 50 invariants in 1 ms
[2024-05-22 00:22:39] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 51/286 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/36 constraints, Generalized P Invariants (flows): 0/14 constraints, State Equation: 0/155 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2 p0))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 19 factoid took 1512 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
[2024-05-22 00:22:42] [INFO ] Invariant cache hit.
[2024-05-22 00:22:42] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-05-22 00:22:42] [INFO ] [Real]Absence check using 36 positive and 14 generalized place invariants in 6 ms returned sat
[2024-05-22 00:22:42] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-22 00:22:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 00:22:42] [INFO ] [Nat]Absence check using 36 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-22 00:22:42] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-22 00:22:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 00:22:42] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 00:22:42] [INFO ] Computed and/alt/rep : 114/399/114 causal constraints (skipped 12 transitions) in 10 ms.
[2024-05-22 00:22:42] [INFO ] Added : 62 causal constraints over 13 iterations in 171 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-12 finished in 21374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Graph (trivial) has 270 edges and 550 vertex of which 7 / 550 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1186 edges and 544 vertex of which 543 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 (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 542 transition count 390
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 475 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 474 transition count 389
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 138 place count 474 transition count 274
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 393 place count 334 transition count 274
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 405 place count 322 transition count 262
Iterating global reduction 3 with 12 rules applied. Total rules applied 417 place count 322 transition count 262
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 281 rules applied. Total rules applied 698 place count 180 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 700 place count 179 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 701 place count 178 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 702 place count 177 transition count 125
Applied a total of 702 rules in 67 ms. Remains 177 /550 variables (removed 373) and now considering 125/467 (removed 342) transitions.
// Phase 1: matrix 125 rows 177 cols
[2024-05-22 00:22:43] [INFO ] Computed 77 invariants in 1 ms
[2024-05-22 00:22:43] [INFO ] Implicit Places using invariants in 284 ms returned [43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 285 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/550 places, 125/467 transitions.
Applied a total of 0 rules in 4 ms. Remains 166 /166 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 166/550 places, 125/467 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-13 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((X(p2)||p1)))))'
Support contains 5 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 536 transition count 453
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 536 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 536 transition count 452
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 531 transition count 447
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 531 transition count 447
Applied a total of 39 rules in 41 ms. Remains 531 /550 variables (removed 19) and now considering 447/467 (removed 20) transitions.
// Phase 1: matrix 447 rows 531 cols
[2024-05-22 00:22:43] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:22:44] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-22 00:22:44] [INFO ] Invariant cache hit.
[2024-05-22 00:22:44] [INFO ] Implicit Places using invariants and state equation in 692 ms returned [465]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1016 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/550 places, 447/467 transitions.
Applied a total of 0 rules in 10 ms. Remains 530 /530 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1067 ms. Remains : 530/550 places, 447/467 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 475 stabilizing places and 402 stable transitions
Graph (complete) has 1163 edges and 530 vertex of which 529 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 475 stabilizing places and 402 stable transitions
Detected a total of 475/530 stabilizing places and 402/447 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 29 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-14 finished in 1616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 4 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 467/467 transitions.
Graph (complete) has 1194 edges and 550 vertex of which 549 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 (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 65 place count 548 transition count 401
Reduce places removed 64 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 484 transition count 398
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 481 transition count 398
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 135 place count 481 transition count 280
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 396 place count 338 transition count 280
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 409 place count 325 transition count 267
Iterating global reduction 3 with 13 rules applied. Total rules applied 422 place count 325 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 424 place count 325 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 425 place count 324 transition count 265
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 5 with 283 rules applied. Total rules applied 708 place count 181 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 709 place count 181 transition count 124
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 6 with 2 rules applied. Total rules applied 711 place count 180 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 712 place count 179 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 713 place count 178 transition count 126
Applied a total of 713 rules in 52 ms. Remains 178 /550 variables (removed 372) and now considering 126/467 (removed 341) transitions.
// Phase 1: matrix 126 rows 178 cols
[2024-05-22 00:22:45] [INFO ] Computed 77 invariants in 1 ms
[2024-05-22 00:22:45] [INFO ] Implicit Places using invariants in 187 ms returned [38, 39, 40, 41, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 188 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/550 places, 126/467 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 164/550 places, 126/467 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-15 finished in 330 ms.
All properties solved by simple procedures.
Total runtime 109619 ms.

BK_STOP 1716337365905

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-18, 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 r048-tajo-171620399800588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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