Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813400132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BusinessProcesses-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813400132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 161K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748606347092

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 11:59:09] [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]
[2025-05-30 11:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:59:10] [INFO ] Load time of PNML (sax parser for PT used): 429 ms
[2025-05-30 11:59:10] [INFO ] Transformed 650 places.
[2025-05-30 11:59:10] [INFO ] Transformed 580 transitions.
[2025-05-30 11:59:10] [INFO ] Found NUPN structural information;
[2025-05-30 11:59:10] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 710 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 27 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 86 place count 560 transition count 493
Iterating global reduction 1 with 83 rules applied. Total rules applied 169 place count 560 transition count 493
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 207 place count 522 transition count 455
Iterating global reduction 1 with 38 rules applied. Total rules applied 245 place count 522 transition count 455
Applied a total of 245 rules in 272 ms. Remains 522 /646 variables (removed 124) and now considering 455/576 (removed 121) transitions.
// Phase 1: matrix 455 rows 522 cols
[2025-05-30 11:59:11] [INFO ] Computed 105 invariants in 53 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:12] [INFO ] Implicit Places using invariants in 1543 ms returned []
[2025-05-30 11:59:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:15] [INFO ] Implicit Places using invariants and state equation in 2057 ms returned []
Implicit Place search using SMT with State Equation took 3676 ms to find 0 implicit places.
Running 454 sub problems to find dead transitions.
[2025-05-30 11:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 1/522 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:44] [INFO ] Deduced a trap composed of 68 places in 504 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:45] [INFO ] Deduced a trap composed of 88 places in 494 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:45] [INFO ] Deduced a trap composed of 89 places in 333 ms of which 63 ms to minimize.
SMT process timed out in 30640ms, After SMT, problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 30671ms
Starting structural reductions in LTL mode, iteration 1 : 522/646 places, 455/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34661 ms. Remains : 522/646 places, 455/576 transitions.
Support contains 50 out of 522 places after structural reductions.
[2025-05-30 11:59:46] [INFO ] Flatten gal took : 135 ms
[2025-05-30 11:59:46] [INFO ] Flatten gal took : 72 ms
[2025-05-30 11:59:46] [INFO ] Input system was already deterministic with 455 transitions.
RANDOM walk for 40000 steps (259 resets) in 2259 ms. (17 steps per ms) remains 24/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
[2025-05-30 11:59:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 185/221 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 166/387 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 129/516 variables, 46/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 451/967 variables, 516/621 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:49] [INFO ] Deduced a trap composed of 15 places in 421 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:49] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:50] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:50] [INFO ] Deduced a trap composed of 20 places in 337 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:50] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:51] [INFO ] Deduced a trap composed of 23 places in 406 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:51] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:52] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:52] [INFO ] Deduced a trap composed of 82 places in 470 ms of which 107 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 967/977 variables, and 630 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 516/522 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 185/221 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 166/387 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 129/516 variables, 46/113 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:53] [INFO ] Deduced a trap composed of 14 places in 359 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:54] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:54] [INFO ] Deduced a trap composed of 29 places in 360 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:55] [INFO ] Deduced a trap composed of 30 places in 334 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:55] [INFO ] Deduced a trap composed of 34 places in 310 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:55] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:56] [INFO ] Deduced a trap composed of 80 places in 302 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:56] [INFO ] Deduced a trap composed of 81 places in 383 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:56] [INFO ] Deduced a trap composed of 81 places in 386 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:57] [INFO ] Deduced a trap composed of 81 places in 327 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:57] [INFO ] Deduced a trap composed of 81 places in 350 ms of which 61 ms to minimize.
SMT process timed out in 10143ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 455/455 transitions.
Graph (complete) has 1161 edges and 522 vertex of which 521 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 521 transition count 405
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 472 transition count 403
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 470 transition count 403
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 103 place count 470 transition count 300
Deduced a syphon composed of 103 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 327 place count 349 transition count 300
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 335 place count 341 transition count 292
Iterating global reduction 3 with 8 rules applied. Total rules applied 343 place count 341 transition count 292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 343 place count 341 transition count 291
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 345 place count 340 transition count 291
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 597 place count 212 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 598 place count 212 transition count 166
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 599 place count 212 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 600 place count 211 transition count 165
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 607 place count 211 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 608 place count 210 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 609 place count 209 transition count 164
Applied a total of 609 rules in 234 ms. Remains 209 /522 variables (removed 313) and now considering 164/455 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 209/522 places, 164/455 transitions.
RANDOM walk for 40000 steps (3073 resets) in 1727 ms. (23 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4003 steps (74 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (68 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (76 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (75 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (68 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (74 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (71 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (74 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (67 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (60 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (72 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (73 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (72 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (81 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (72 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (70 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (72 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (70 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (68 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (69 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (71 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
// Phase 1: matrix 164 rows 209 cols
[2025-05-30 11:59:58] [INFO ] Computed 82 invariants in 6 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 74/107 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 21/128 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 31/159 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:59] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:59] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:59] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:59] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:59] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:59] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:59] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:00] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:00] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:00] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:00] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:00] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:00] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:00] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 13 ms to minimize.
Problem AtomicPropp19 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 14/70 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 4/163 variables, 4/74 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:01] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 1/75 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 164/327 variables, 163/238 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:01] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:01] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:02] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:02] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 22 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 4/242 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/242 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 46/373 variables, 46/288 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/373 variables, 22/310 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:03] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:03] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:03] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:03] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:03] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:03] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:04] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:04] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:04] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:04] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:04] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:04] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 31 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/373 variables, 12/322 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 0/373 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 322 constraints, problems are : Problem set: 1 solved, 20 unsolved in 7676 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 74/106 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/127 variables, 18/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 32/159 variables, 23/56 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 16/72 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 4/163 variables, 4/76 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 3/79 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 164/327 variables, 163/242 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 13/255 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 46/373 variables, 46/301 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 22/323 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/373 variables, 7/330 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/373 variables, 12/342 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 0/342 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 0/373 variables, 0/342 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 342 constraints, problems are : Problem set: 1 solved, 20 unsolved in 4584 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12279ms problems are : Problem set: 1 solved, 20 unsolved
Parikh walk visited 3 properties in 319 ms.
Support contains 25 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 164/164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 209 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 207 transition count 162
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 207 transition count 157
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 15 place count 201 transition count 157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 198 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 197 transition count 153
Applied a total of 23 rules in 25 ms. Remains 197 /209 variables (removed 12) and now considering 153/164 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 197/209 places, 153/164 transitions.
RANDOM walk for 40000 steps (3601 resets) in 444 ms. (89 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (99 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (116 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (112 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (96 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (103 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (98 resets) in 48 ms. (81 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (95 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (113 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (110 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (102 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (97 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (113 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (100 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (100 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (113 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (111 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (109 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 6697 steps, run visited all 17 properties in 136 ms. (steps per millisecond=49 )
Probabilistic random walk after 6697 steps, saw 2017 distinct states, run finished after 142 ms. (steps per millisecond=47 ) properties seen :17
FORMULA BusinessProcesses-PT-17-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 215 stabilizing places and 187 stable transitions
Graph (complete) has 1161 edges and 522 vertex of which 521 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((p0 U p1))) U (!p2||X((F(p0) U p2))))))'
Support contains 5 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Graph (trivial) has 246 edges and 522 vertex of which 7 / 522 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1154 edges and 516 vertex of which 515 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 514 transition count 390
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 458 transition count 390
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 114 place count 458 transition count 281
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 352 place count 329 transition count 281
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 366 place count 315 transition count 267
Iterating global reduction 2 with 14 rules applied. Total rules applied 380 place count 315 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 380 place count 315 transition count 266
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 382 place count 314 transition count 266
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 641 place count 182 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 643 place count 181 transition count 143
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 649 place count 181 transition count 143
Applied a total of 649 rules in 164 ms. Remains 181 /522 variables (removed 341) and now considering 143/455 (removed 312) transitions.
// Phase 1: matrix 143 rows 181 cols
[2025-05-30 12:00:12] [INFO ] Computed 80 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:13] [INFO ] Implicit Places using invariants in 603 ms returned [1, 2, 3, 4, 5, 8, 9, 35, 36, 37, 38, 45, 46, 47, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 622 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/522 places, 143/455 transitions.
Applied a total of 0 rules in 15 ms. Remains 159 /159 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 802 ms. Remains : 159/522 places, 143/455 transitions.
Stuttering acceptance computed with spot in 566 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-00
Product exploration explored 100000 steps with 17930 reset in 789 ms.
Product exploration explored 100000 steps with 17835 reset in 393 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 167 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (7969 resets) in 1602 ms. (24 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (2460 resets) in 269 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2521 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2519 resets) in 303 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2500 resets) in 303 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (2491 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2568 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2561 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2530 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2537 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 490 steps, run visited all 9 properties in 15 ms. (steps per millisecond=32 )
Probabilistic random walk after 490 steps, saw 233 distinct states, run finished after 15 ms. (steps per millisecond=32 ) properties seen :9
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR p2 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 17 factoid took 632 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 143/143 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 159 cols
[2025-05-30 12:00:17] [INFO ] Computed 58 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:17] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-05-30 12:00:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 12:00:18] [INFO ] Implicit Places using invariants and state equation in 708 ms returned [3, 28, 30, 32, 39, 41, 43, 45, 47, 55, 57, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 986 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/159 places, 143/143 transitions.
Graph (complete) has 397 edges and 127 vertex of which 120 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 120 transition count 127
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 107 transition count 127
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 36 place count 98 transition count 99
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 98 transition count 99
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 98 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 96 transition count 97
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 52 place count 93 transition count 94
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 93 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 73 place count 82 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 80 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 80 transition count 84
Applied a total of 78 rules in 40 ms. Remains 80 /127 variables (removed 47) and now considering 84/143 (removed 59) transitions.
// Phase 1: matrix 84 rows 80 cols
[2025-05-30 12:00:18] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:18] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-05-30 12:00:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 12:00:19] [INFO ] Implicit Places using invariants and state equation in 304 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 446 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/159 places, 84/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1490 ms. Remains : 79/159 places, 84/143 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Graph (complete) has 265 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 210 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8182 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (2450 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2555 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (2567 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2561 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2554 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2546 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2525 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2522 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (2559 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 295 steps, run visited all 9 properties in 8 ms. (steps per millisecond=36 )
Probabilistic random walk after 295 steps, saw 152 distinct states, run finished after 8 ms. (steps per millisecond=36 ) properties seen :9
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR p2 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 17 factoid took 705 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18225 reset in 157 ms.
Product exploration explored 100000 steps with 18226 reset in 188 ms.
Built C files in :
/tmp/ltsmin10316353066543354074
[2025-05-30 12:00:21] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2025-05-30 12:00:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:00:21] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2025-05-30 12:00:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:00:21] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2025-05-30 12:00:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:00:21] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10316353066543354074
Running compilation step : cd /tmp/ltsmin10316353066543354074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 488 ms.
Running link step : cd /tmp/ltsmin10316353066543354074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin10316353066543354074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4934913540993232730.hoa' '--buchi-type=spotba'
LTSmin run took 161 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-00 finished in 9825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&((p1 U X(p2)) U (G((p1 U X(p2)))||(!p3&&(p1 U X(p2))))))))))'
Support contains 8 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 505 transition count 438
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 505 transition count 438
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 502 transition count 435
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 502 transition count 435
Applied a total of 40 rules in 44 ms. Remains 502 /522 variables (removed 20) and now considering 435/455 (removed 20) transitions.
// Phase 1: matrix 435 rows 502 cols
[2025-05-30 12:00:22] [INFO ] Computed 105 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:23] [INFO ] Implicit Places using invariants in 707 ms returned []
[2025-05-30 12:00:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:25] [INFO ] Implicit Places using invariants and state equation in 2811 ms returned []
Implicit Place search using SMT with State Equation took 3520 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-05-30 12:00:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:50] [INFO ] Deduced a trap composed of 62 places in 265 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:50] [INFO ] Deduced a trap composed of 62 places in 413 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:51] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:51] [INFO ] Deduced a trap composed of 62 places in 285 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:51] [INFO ] Deduced a trap composed of 62 places in 402 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:52] [INFO ] Deduced a trap composed of 62 places in 378 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:52] [INFO ] Deduced a trap composed of 62 places in 353 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:52] [INFO ] Deduced a trap composed of 62 places in 360 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:53] [INFO ] Deduced a trap composed of 62 places in 346 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:53] [INFO ] Deduced a trap composed of 62 places in 333 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:53] [INFO ] Deduced a trap composed of 62 places in 327 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:54] [INFO ] Deduced a trap composed of 62 places in 296 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:54] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:54] [INFO ] Deduced a trap composed of 62 places in 344 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:55] [INFO ] Deduced a trap composed of 62 places in 365 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:55] [INFO ] Deduced a trap composed of 62 places in 346 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:55] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:56] [INFO ] Deduced a trap composed of 83 places in 243 ms of which 61 ms to minimize.
SMT process timed out in 30302ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 30305ms
Starting structural reductions in LTL mode, iteration 1 : 502/522 places, 435/455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33872 ms. Remains : 502/522 places, 435/455 transitions.
Stuttering acceptance computed with spot in 445 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 702 reset in 306 ms.
Product exploration explored 100000 steps with 707 reset in 361 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1137 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (NOT (AND p3 p0))), (X (NOT p3)), (X (NOT (AND (NOT p3) p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 p0 (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 174 ms. Reduced automaton from 9 states, 26 edges and 4 AP (stutter sensitive) to 9 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 19 to 16
RANDOM walk for 40000 steps (263 resets) in 388 ms. (102 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (33 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (46 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (43 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (32 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (32 resets) in 145 ms. (273 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (33 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (47 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (47 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
[2025-05-30 12:00:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf10 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem apf12 is UNSAT
At refinement iteration 1 (OVERLAPS) 145/153 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:58] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 2 ms to minimize.
Problem apf8 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 206/359 variables, 53/60 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:59] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:59] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:59] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:59] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 5/65 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/65 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 135/494 variables, 44/109 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/109 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/496 variables, 2/111 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/111 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 431/927 variables, 496/607 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:00] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:00] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:00] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 3/610 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/610 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 9/936 variables, 5/615 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:01] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/936 variables, 1/616 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/616 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/937 variables, 1/617 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/937 variables, 0/617 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/937 variables, 0/617 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 937/937 variables, and 617 constraints, problems are : Problem set: 7 solved, 5 unsolved in 4036 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 145/153 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 206/359 variables, 53/60 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 6/66 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/66 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 135/494 variables, 44/110 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 2/112 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 0/112 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/496 variables, 2/114 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 0/114 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 431/927 variables, 496/610 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 2/612 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:03] [INFO ] Deduced a trap along path composed of 3 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:03] [INFO ] Deduced a trap along path composed of 3 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap along path composed of 3 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap along path composed of 9 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap along path composed of 6 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap along path composed of 4 places in 135 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap along path composed of 4 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap along path composed of 4 places in 91 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:04] [INFO ] Deduced a trap along path composed of 6 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:05] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:05] [INFO ] Deduced a trap along path composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 12/624 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/927 variables, 0/624 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 9/936 variables, 5/629 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/936 variables, 3/632 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/936 variables, 1/633 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:06] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:06] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/936 variables, 2/635 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:06] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/936 variables, 1/636 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/936 variables, 0/636 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 1/937 variables, 1/637 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/937 variables, 0/637 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 937/937 variables, and 637 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 5/12 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 13/13 constraints]
After SMT, in 9070ms problems are : Problem set: 7 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 435/435 transitions.
Graph (complete) has 1137 edges and 502 vertex of which 501 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 501 transition count 386
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 453 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 451 transition count 384
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 101 place count 451 transition count 278
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 332 place count 326 transition count 278
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 279 rules applied. Total rules applied 611 place count 184 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 612 place count 184 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 613 place count 184 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 614 place count 183 transition count 139
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 624 place count 183 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 625 place count 182 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 626 place count 181 transition count 138
Applied a total of 626 rules in 68 ms. Remains 181 /502 variables (removed 321) and now considering 138/435 (removed 297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 181/502 places, 138/435 transitions.
RANDOM walk for 40000 steps (3775 resets) in 400 ms. (99 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1235 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1326 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1222 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1331 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1208 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 623 steps, run visited all 5 properties in 15 ms. (steps per millisecond=41 )
Probabilistic random walk after 623 steps, saw 321 distinct states, run finished after 15 ms. (steps per millisecond=41 ) properties seen :5
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (NOT (AND p3 p0))), (X (NOT p3)), (X (NOT (AND (NOT p3) p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 p0 (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p3))), (G (OR p0 p2)), (G (OR (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) p2)), (G (OR p0 p1 p2)), (G (OR p0 (NOT p1))), (G (OR (NOT p0) p3 (NOT p1) p2)), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p3) p2))), (F p3), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 32 factoid took 627 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), true, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), true, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 8 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 435/435 transitions.
Applied a total of 0 rules in 18 ms. Remains 502 /502 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2025-05-30 12:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:10] [INFO ] Implicit Places using invariants in 645 ms returned []
[2025-05-30 12:01:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:12] [INFO ] Implicit Places using invariants and state equation in 2276 ms returned []
Implicit Place search using SMT with State Equation took 2923 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-05-30 12:01:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:36] [INFO ] Deduced a trap composed of 62 places in 418 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:37] [INFO ] Deduced a trap composed of 62 places in 407 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:37] [INFO ] Deduced a trap composed of 62 places in 409 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:37] [INFO ] Deduced a trap composed of 62 places in 287 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:38] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:38] [INFO ] Deduced a trap composed of 62 places in 282 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:38] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:39] [INFO ] Deduced a trap composed of 62 places in 394 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:39] [INFO ] Deduced a trap composed of 62 places in 270 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:39] [INFO ] Deduced a trap composed of 62 places in 382 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:40] [INFO ] Deduced a trap composed of 62 places in 286 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:40] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:40] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:41] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:41] [INFO ] Deduced a trap composed of 62 places in 354 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:41] [INFO ] Deduced a trap composed of 62 places in 342 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:42] [INFO ] Deduced a trap composed of 62 places in 372 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:42] [INFO ] Deduced a trap composed of 83 places in 401 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:43] [INFO ] Deduced a trap composed of 83 places in 451 ms of which 275 ms to minimize.
SMT process timed out in 30475ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 30476ms
Finished structural reductions in LTL mode , in 1 iterations and 33419 ms. Remains : 502/502 places, 435/435 transitions.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1137 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), true, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (262 resets) in 195 ms. (204 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (46 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (47 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (33 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
[2025-05-30 12:01:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 206/359 variables, 53/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 135/494 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/496 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 431/927 variables, 496/601 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/936 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/937 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/937 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/937 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 937/937 variables, and 607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:45] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 206/359 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:45] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:45] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:45] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:45] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:45] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:45] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:45] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:46] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:46] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:46] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:46] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:46] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:47] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:47] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:47] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:47] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:47] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:48] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:48] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 135/494 variables, 44/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:48] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:48] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:48] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/496 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 431/927 variables, 496/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:49] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:49] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:49] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:50] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:50] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 18 ms to minimize.
SMT process timed out in 6412ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 435/435 transitions.
Graph (complete) has 1137 edges and 502 vertex of which 501 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 501 transition count 386
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 453 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 451 transition count 384
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 101 place count 451 transition count 278
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 332 place count 326 transition count 278
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 279 rules applied. Total rules applied 611 place count 184 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 612 place count 184 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 613 place count 184 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 614 place count 183 transition count 139
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 624 place count 183 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 625 place count 182 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 626 place count 181 transition count 138
Applied a total of 626 rules in 78 ms. Remains 181 /502 variables (removed 321) and now considering 138/435 (removed 297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 181/502 places, 138/435 transitions.
RANDOM walk for 40000 steps (3742 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1237 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1277 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1354 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1347 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 623 steps, run visited all 4 properties in 16 ms. (steps per millisecond=38 )
Probabilistic random walk after 623 steps, saw 321 distinct states, run finished after 16 ms. (steps per millisecond=38 ) properties seen :4
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0) p3))), (F p2), (F p1), (F (NOT p0)), (F p3), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 4 factoid took 341 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), true, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), true, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), true, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 697 reset in 280 ms.
Product exploration explored 100000 steps with 703 reset in 400 ms.
Applying partial POR strategy [false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), true, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 8 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 435/435 transitions.
Graph (complete) has 1137 edges and 502 vertex of which 501 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
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 501 transition count 434
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 75 Pre rules applied. Total rules applied 51 place count 501 transition count 488
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 126 place count 501 transition count 488
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 142 place count 485 transition count 457
Deduced a syphon composed of 109 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 158 place count 485 transition count 457
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 1 with 166 rules applied. Total rules applied 324 place count 485 transition count 457
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 361 place count 448 transition count 420
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 398 place count 448 transition count 420
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 240 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 400 place count 448 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 401 place count 448 transition count 423
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 403 place count 446 transition count 419
Deduced a syphon composed of 238 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 405 place count 446 transition count 419
Deduced a syphon composed of 238 places in 0 ms
Applied a total of 405 rules in 123 ms. Remains 446 /502 variables (removed 56) and now considering 419/435 (removed 16) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:01:53] [INFO ] Redundant transitions in 38 ms returned []
Running 418 sub problems to find dead transitions.
// Phase 1: matrix 419 rows 446 cols
[2025-05-30 12:01:53] [INFO ] Computed 105 invariants in 26 ms
[2025-05-30 12:01:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 61/102 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:13] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:13] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:14] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:14] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:15] [INFO ] Deduced a trap composed of 30 places in 409 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:15] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:15] [INFO ] Deduced a trap composed of 31 places in 420 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:16] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:16] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:16] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:17] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:17] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:17] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:18] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:18] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:18] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:19] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:19] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:19] [INFO ] Deduced a trap composed of 30 places in 397 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:19] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 30 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/125 constraints. Problems are: Problem set: 55 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:20] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:20] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:21] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:21] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:21] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 12 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:22] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 10 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:22] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 11 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:22] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 11 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:23] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 10 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:23] [INFO ] Deduced a trap composed of 3 places in 316 ms of which 10 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:02:23] [INFO ] Deduced a trap composed of 3 places in 355 ms of which 16 ms to minimize.
SMT process timed out in 30459ms, After SMT, problems are : Problem set: 61 solved, 357 unsolved
Search for dead transitions found 61 dead transitions in 30461ms
Found 61 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 61 transitions
Dead transitions reduction (with SMT) removed 61 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 446/502 places, 358/435 transitions.
Graph (complete) has 1406 edges and 446 vertex of which 392 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.3 ms
Discarding 54 places :
Also discarding 0 output transitions
Deduced a syphon composed of 184 places in 1 ms
Applied a total of 1 rules in 27 ms. Remains 392 /446 variables (removed 54) and now considering 358/358 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/502 places, 358/435 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30662 ms. Remains : 392/502 places, 358/435 transitions.
Built C files in :
/tmp/ltsmin17340345672052919993
[2025-05-30 12:02:24] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17340345672052919993
Running compilation step : cd /tmp/ltsmin17340345672052919993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1290 ms.
Running link step : cd /tmp/ltsmin17340345672052919993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17340345672052919993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10850971068974612265.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 435/435 transitions.
Applied a total of 0 rules in 12 ms. Remains 502 /502 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 502 cols
[2025-05-30 12:02:39] [INFO ] Computed 105 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:02:39] [INFO ] Implicit Places using invariants in 660 ms returned []
[2025-05-30 12:02:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:02:42] [INFO ] Implicit Places using invariants and state equation in 2614 ms returned []
Implicit Place search using SMT with State Equation took 3277 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-05-30 12:02:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:04] [INFO ] Deduced a trap composed of 62 places in 361 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:05] [INFO ] Deduced a trap composed of 62 places in 359 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:05] [INFO ] Deduced a trap composed of 62 places in 363 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:06] [INFO ] Deduced a trap composed of 62 places in 355 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:06] [INFO ] Deduced a trap composed of 62 places in 393 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:06] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:07] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:07] [INFO ] Deduced a trap composed of 62 places in 380 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:07] [INFO ] Deduced a trap composed of 62 places in 371 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:08] [INFO ] Deduced a trap composed of 62 places in 357 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:08] [INFO ] Deduced a trap composed of 62 places in 255 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:08] [INFO ] Deduced a trap composed of 62 places in 355 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:09] [INFO ] Deduced a trap composed of 62 places in 372 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:09] [INFO ] Deduced a trap composed of 62 places in 240 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:09] [INFO ] Deduced a trap composed of 62 places in 361 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:10] [INFO ] Deduced a trap composed of 62 places in 336 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:10] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:10] [INFO ] Deduced a trap composed of 83 places in 375 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:11] [INFO ] Deduced a trap composed of 83 places in 700 ms of which 405 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:12] [INFO ] Deduced a trap composed of 62 places in 270 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/937 variables, and 125 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:21] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:21] [INFO ] Deduced a trap composed of 76 places in 386 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:21] [INFO ] Deduced a trap composed of 81 places in 358 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:22] [INFO ] Deduced a trap composed of 81 places in 350 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:22] [INFO ] Deduced a trap composed of 81 places in 391 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:23] [INFO ] Deduced a trap composed of 81 places in 253 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:23] [INFO ] Deduced a trap composed of 63 places in 382 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:23] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:24] [INFO ] Deduced a trap composed of 47 places in 408 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:24] [INFO ] Deduced a trap composed of 83 places in 328 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:25] [INFO ] Deduced a trap composed of 68 places in 286 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:25] [INFO ] Deduced a trap composed of 68 places in 284 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:25] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:25] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:26] [INFO ] Deduced a trap composed of 63 places in 386 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:26] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:27] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:27] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:28] [INFO ] Deduced a trap composed of 25 places in 364 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:28] [INFO ] Deduced a trap composed of 17 places in 352 ms of which 29 ms to minimize.
Problem TDEAD379 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 3 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:29] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:29] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:29] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:30] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:30] [INFO ] Deduced a trap composed of 82 places in 355 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:31] [INFO ] Deduced a trap composed of 82 places in 401 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:31] [INFO ] Deduced a trap composed of 82 places in 400 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:31] [INFO ] Deduced a trap composed of 80 places in 277 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:32] [INFO ] Deduced a trap composed of 80 places in 245 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:32] [INFO ] Deduced a trap composed of 80 places in 396 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:32] [INFO ] Deduced a trap composed of 61 places in 217 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:33] [INFO ] Deduced a trap composed of 61 places in 257 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:33] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:33] [INFO ] Deduced a trap composed of 61 places in 354 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:34] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:34] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:34] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:35] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:35] [INFO ] Deduced a trap composed of 82 places in 256 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:35] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 47 ms to minimize.
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 10 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:36] [INFO ] Deduced a trap composed of 61 places in 292 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:36] [INFO ] Deduced a trap composed of 61 places in 233 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:37] [INFO ] Deduced a trap composed of 61 places in 222 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:37] [INFO ] Deduced a trap composed of 82 places in 429 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:38] [INFO ] Deduced a trap composed of 82 places in 383 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:38] [INFO ] Deduced a trap composed of 82 places in 376 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:39] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:39] [INFO ] Deduced a trap composed of 82 places in 378 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:39] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:40] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:40] [INFO ] Deduced a trap composed of 61 places in 302 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:40] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:42] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:42] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:03:42] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 16 ms to minimize.
SMT process timed out in 60182ms, After SMT, problems are : Problem set: 10 solved, 424 unsolved
Search for dead transitions found 10 dead transitions in 60183ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/502 places, 425/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63488 ms. Remains : 502/502 places, 425/435 transitions.
Built C files in :
/tmp/ltsmin425734072588144727
[2025-05-30 12:03:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin425734072588144727
Running compilation step : cd /tmp/ltsmin425734072588144727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1113 ms.
Running link step : cd /tmp/ltsmin425734072588144727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin425734072588144727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14550345048269903834.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 12:03:57] [INFO ] Flatten gal took : 33 ms
[2025-05-30 12:03:57] [INFO ] Flatten gal took : 31 ms
[2025-05-30 12:03:57] [INFO ] Time to serialize gal into /tmp/LTL14857955180258905486.gal : 9 ms
[2025-05-30 12:03:57] [INFO ] Time to serialize properties into /tmp/LTL13723890347509432760.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14857955180258905486.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10003231039643872253.hoa' '-atoms' '/tmp/LTL13723890347509432760.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13723890347509432760.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10003231039643872253.hoa
Detected timeout of ITS tools.
[2025-05-30 12:04:13] [INFO ] Flatten gal took : 26 ms
[2025-05-30 12:04:13] [INFO ] Flatten gal took : 26 ms
[2025-05-30 12:04:13] [INFO ] Time to serialize gal into /tmp/LTL720405611508161337.gal : 6 ms
[2025-05-30 12:04:13] [INFO ] Time to serialize properties into /tmp/LTL8470433558513349840.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL720405611508161337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8470433558513349840.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(("(p68!=1)")U((G("(p68!=1)"))||(("(p68!=1)")&&((("(((p75==1)&&(p340==1))&&(p611==1))")U(X("((p68==1)||(((p75==1)&&(p340==1))&&(p6...428
Formula 0 simplified : X(("((p526==1)||(((p182==1)&&(p391==1))&&(p566==1)))" U (!"(((p75==1)&&(p340==1))&&(p611==1))" R X!"((p68==1)||(((p75==1)&&(p340==1)...187
Detected timeout of ITS tools.
[2025-05-30 12:04:28] [INFO ] Flatten gal took : 26 ms
[2025-05-30 12:04:28] [INFO ] Applying decomposition
[2025-05-30 12:04:28] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8115576210118624933.txt' '-o' '/tmp/graph8115576210118624933.bin' '-w' '/tmp/graph8115576210118624933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8115576210118624933.bin' '-l' '-1' '-v' '-w' '/tmp/graph8115576210118624933.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:04:28] [INFO ] Decomposing Gal with order
[2025-05-30 12:04:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:04:28] [INFO ] Removed a total of 269 redundant transitions.
[2025-05-30 12:04:28] [INFO ] Flatten gal took : 112 ms
[2025-05-30 12:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 27 ms.
[2025-05-30 12:04:28] [INFO ] Time to serialize gal into /tmp/LTL10295373330384229545.gal : 17 ms
[2025-05-30 12:04:28] [INFO ] Time to serialize properties into /tmp/LTL5470349959104765037.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10295373330384229545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5470349959104765037.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(("(i13.i0.u26.p68!=1)")U((G("(i13.i0.u26.p68!=1)"))||(("(i13.i0.u26.p68!=1)")&&((("(((i13.i0.u27.p75==1)&&(i13.i1.u112.p340==1))&...729
Formula 0 simplified : X(("((i3.i0.u148.p526==1)||(((i5.i0.u61.p182==1)&&(i4.i1.u122.p391==1))&&(i5.i0.u154.p566==1)))" U (!"(((i13.i0.u27.p75==1)&&(i13.i1...316
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t186, t194, t206, t288, t301, t436, t437, t439, t440, t448, i0.i0.u62.t229, i...1393
Computing Next relation with stutter on 1312 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-17-LTLFireability-02 finished in 261433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1 U p2))||X(G(p3))))'
Support contains 4 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 505 transition count 438
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 505 transition count 438
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 502 transition count 435
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 502 transition count 435
Applied a total of 40 rules in 33 ms. Remains 502 /522 variables (removed 20) and now considering 435/455 (removed 20) transitions.
// Phase 1: matrix 435 rows 502 cols
[2025-05-30 12:04:43] [INFO ] Computed 105 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:44] [INFO ] Implicit Places using invariants in 490 ms returned []
[2025-05-30 12:04:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:46] [INFO ] Implicit Places using invariants and state equation in 2447 ms returned []
Implicit Place search using SMT with State Equation took 2944 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-05-30 12:04:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:09] [INFO ] Deduced a trap composed of 63 places in 297 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:09] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:09] [INFO ] Deduced a trap composed of 63 places in 373 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:10] [INFO ] Deduced a trap composed of 63 places in 278 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:10] [INFO ] Deduced a trap composed of 62 places in 414 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:11] [INFO ] Deduced a trap composed of 62 places in 387 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:11] [INFO ] Deduced a trap composed of 62 places in 365 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:11] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:12] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:12] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:12] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:13] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:13] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:13] [INFO ] Deduced a trap composed of 62 places in 423 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:14] [INFO ] Deduced a trap composed of 62 places in 427 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:14] [INFO ] Deduced a trap composed of 62 places in 319 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:14] [INFO ] Deduced a trap composed of 62 places in 304 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:15] [INFO ] Deduced a trap composed of 62 places in 311 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:15] [INFO ] Deduced a trap composed of 62 places in 301 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:15] [INFO ] Deduced a trap composed of 62 places in 410 ms of which 79 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:16] [INFO ] Deduced a trap composed of 63 places in 410 ms of which 88 ms to minimize.
SMT process timed out in 30156ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 30160ms
Starting structural reductions in LTL mode, iteration 1 : 502/522 places, 435/455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33140 ms. Remains : 502/522 places, 435/455 transitions.
Stuttering acceptance computed with spot in 299 ms :[true, (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-03
Product exploration explored 100000 steps with 660 reset in 300 ms.
Product exploration explored 100000 steps with 657 reset in 355 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1136 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 p3))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (AND (NOT p2) (NOT p1) p3)), (X (AND (NOT p2) (NOT p1) (NOT p0) p3)), (X (NOT (AND (NOT p2) p1 (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) p3))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 34 factoid took 261 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p3)]
RANDOM walk for 40000 steps (261 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (44 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 563645 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 563645 steps, saw 94036 distinct states, run finished after 3010 ms. (steps per millisecond=187 ) properties seen :0
[2025-05-30 12:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 252/358 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/494 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/496 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 431/927 variables, 496/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/936 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/937 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/937 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/937 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 937/937 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 252/358 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:22] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:22] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:22] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:22] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:22] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:22] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:22] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:23] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 136/494 variables, 44/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:23] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/496 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 431/927 variables, 496/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:23] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:23] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:23] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:23] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:24] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 5/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:24] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:24] [INFO ] Deduced a trap along path composed of 6 places in 87 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:24] [INFO ] Deduced a trap along path composed of 5 places in 64 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:24] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 4/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/927 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/936 variables, 5/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/936 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/937 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/937 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/937 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 937/937 variables, and 626 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3235 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 3690ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 435/435 transitions.
Graph (trivial) has 228 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1129 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 496 transition count 377
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 446 transition count 377
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 102 place count 446 transition count 270
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 335 place count 320 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 336 place count 319 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 337 place count 319 transition count 269
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 614 place count 178 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 616 place count 177 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 618 place count 177 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 620 place count 175 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 621 place count 175 transition count 135
Applied a total of 621 rules in 48 ms. Remains 175 /502 variables (removed 327) and now considering 135/435 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 175/502 places, 135/435 transitions.
RANDOM walk for 695 steps (17 resets) in 8 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 p3))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (AND (NOT p2) (NOT p1) p3)), (X (AND (NOT p2) (NOT p1) (NOT p0) p3)), (X (NOT (AND (NOT p2) p1 (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) p3))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT p3))
Knowledge based reduction with 34 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-03 finished in 41578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X((F(p0)||X(p1)))) U (p2 U p3)))'
Support contains 8 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 506 transition count 439
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 506 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 504 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 504 transition count 437
Applied a total of 36 rules in 33 ms. Remains 504 /522 variables (removed 18) and now considering 437/455 (removed 18) transitions.
// Phase 1: matrix 437 rows 504 cols
[2025-05-30 12:05:25] [INFO ] Computed 105 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:25] [INFO ] Implicit Places using invariants in 492 ms returned []
[2025-05-30 12:05:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:28] [INFO ] Implicit Places using invariants and state equation in 2507 ms returned []
Implicit Place search using SMT with State Equation took 3004 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2025-05-30 12:05:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:50] [INFO ] Deduced a trap composed of 62 places in 266 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:50] [INFO ] Deduced a trap composed of 83 places in 369 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:50] [INFO ] Deduced a trap composed of 83 places in 377 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:51] [INFO ] Deduced a trap composed of 83 places in 369 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:51] [INFO ] Deduced a trap composed of 83 places in 364 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:52] [INFO ] Deduced a trap composed of 62 places in 329 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:52] [INFO ] Deduced a trap composed of 83 places in 267 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:52] [INFO ] Deduced a trap composed of 83 places in 259 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:53] [INFO ] Deduced a trap composed of 83 places in 393 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:53] [INFO ] Deduced a trap composed of 83 places in 531 ms of which 226 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:54] [INFO ] Deduced a trap composed of 81 places in 320 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:54] [INFO ] Deduced a trap composed of 76 places in 299 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:54] [INFO ] Deduced a trap composed of 76 places in 305 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:55] [INFO ] Deduced a trap composed of 80 places in 390 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:55] [INFO ] Deduced a trap composed of 81 places in 411 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:55] [INFO ] Deduced a trap composed of 81 places in 284 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:56] [INFO ] Deduced a trap composed of 81 places in 407 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:56] [INFO ] Deduced a trap composed of 81 places in 288 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:56] [INFO ] Deduced a trap composed of 81 places in 404 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:57] [INFO ] Deduced a trap composed of 75 places in 237 ms of which 53 ms to minimize.
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:57] [INFO ] Deduced a trap composed of 62 places in 363 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:58] [INFO ] Deduced a trap composed of 83 places in 267 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:58] [INFO ] Deduced a trap composed of 83 places in 388 ms of which 88 ms to minimize.
SMT process timed out in 30414ms, After SMT, problems are : Problem set: 11 solved, 425 unsolved
Search for dead transitions found 11 dead transitions in 30415ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 504/522 places, 426/455 transitions.
Applied a total of 0 rules in 17 ms. Remains 504 /504 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33471 ms. Remains : 504/522 places, 426/455 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-04
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-04 finished in 33860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Graph (trivial) has 248 edges and 522 vertex of which 7 / 522 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1154 edges and 516 vertex of which 515 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 514 transition count 388
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 456 transition count 388
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 118 place count 456 transition count 281
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 352 place count 329 transition count 281
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 365 place count 316 transition count 268
Iterating global reduction 2 with 13 rules applied. Total rules applied 378 place count 316 transition count 268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 378 place count 316 transition count 266
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 382 place count 314 transition count 266
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 651 place count 177 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 653 place count 176 transition count 138
Applied a total of 653 rules in 72 ms. Remains 176 /522 variables (removed 346) and now considering 138/455 (removed 317) transitions.
// Phase 1: matrix 138 rows 176 cols
[2025-05-30 12:05:59] [INFO ] Computed 80 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:59] [INFO ] Implicit Places using invariants in 278 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 282 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/522 places, 138/455 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 361 ms. Remains : 154/522 places, 138/455 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-05
Product exploration explored 100000 steps with 21805 reset in 320 ms.
Product exploration explored 100000 steps with 21627 reset in 295 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
RANDOM walk for 40000 steps (9888 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3053 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 137 steps, run visited all 1 properties in 6 ms. (steps per millisecond=22 )
Probabilistic random walk after 137 steps, saw 87 distinct states, run finished after 6 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Stuttering acceptance computed with spot in 42 ms :[p0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 154 cols
[2025-05-30 12:06:00] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:00] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-05-30 12:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 12:06:01] [INFO ] Implicit Places using invariants and state equation in 805 ms returned [3, 25, 27, 29, 36, 38, 40, 42, 44, 51, 53, 59, 61, 63, 65, 67, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 1069 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/154 places, 138/138 transitions.
Graph (complete) has 401 edges and 123 vertex of which 114 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 114 transition count 122
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 102 transition count 122
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 37 place count 90 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 90 transition count 82
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 90 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 88 transition count 80
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 85 transition count 77
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 85 transition count 77
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 79 place count 73 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 83 place count 71 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 71 transition count 66
Applied a total of 84 rules in 20 ms. Remains 71 /123 variables (removed 52) and now considering 66/138 (removed 72) transitions.
// Phase 1: matrix 66 rows 71 cols
[2025-05-30 12:06:01] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:01] [INFO ] Implicit Places using invariants in 89 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/154 places, 66/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1186 ms. Remains : 68/154 places, 66/138 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
RANDOM walk for 40000 steps (10106 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3127 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 101 steps, run visited all 1 properties in 5 ms. (steps per millisecond=20 )
Probabilistic random walk after 101 steps, saw 65 distinct states, run finished after 5 ms. (steps per millisecond=20 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
Product exploration explored 100000 steps with 22107 reset in 111 ms.
Product exploration explored 100000 steps with 22222 reset in 133 ms.
Built C files in :
/tmp/ltsmin14562691866404971675
[2025-05-30 12:06:02] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2025-05-30 12:06:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:06:02] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2025-05-30 12:06:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:06:02] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2025-05-30 12:06:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:06:02] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14562691866404971675
Running compilation step : cd /tmp/ltsmin14562691866404971675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 252 ms.
Running link step : cd /tmp/ltsmin14562691866404971675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14562691866404971675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13873668484238498603.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-05 finished in 3707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X(p0) U p1))) U p1))'
Support contains 1 out of 522 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Graph (trivial) has 245 edges and 522 vertex of which 7 / 522 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1154 edges and 516 vertex of which 515 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 514 transition count 390
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 458 transition count 390
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 114 place count 458 transition count 284
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 346 place count 332 transition count 284
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 358 place count 320 transition count 272
Iterating global reduction 2 with 12 rules applied. Total rules applied 370 place count 320 transition count 272
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 370 place count 320 transition count 270
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 374 place count 318 transition count 270
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 644 place count 181 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 646 place count 180 transition count 141
Applied a total of 646 rules in 37 ms. Remains 180 /522 variables (removed 342) and now considering 141/455 (removed 314) transitions.
// Phase 1: matrix 141 rows 180 cols
[2025-05-30 12:06:02] [INFO ] Computed 81 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:03] [INFO ] Implicit Places using invariants in 391 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 394 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/522 places, 141/455 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 436 ms. Remains : 157/522 places, 141/455 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-08 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Support contains 3 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 506 transition count 439
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 506 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 504 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 504 transition count 437
Applied a total of 36 rules in 31 ms. Remains 504 /522 variables (removed 18) and now considering 437/455 (removed 18) transitions.
// Phase 1: matrix 437 rows 504 cols
[2025-05-30 12:06:03] [INFO ] Computed 105 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:03] [INFO ] Implicit Places using invariants in 556 ms returned []
[2025-05-30 12:06:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:05] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2025-05-30 12:06:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:29] [INFO ] Deduced a trap composed of 62 places in 387 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:29] [INFO ] Deduced a trap composed of 62 places in 352 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:30] [INFO ] Deduced a trap composed of 62 places in 327 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:30] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:30] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:30] [INFO ] Deduced a trap composed of 62 places in 262 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:31] [INFO ] Deduced a trap composed of 62 places in 349 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:31] [INFO ] Deduced a trap composed of 64 places in 356 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:32] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:32] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:32] [INFO ] Deduced a trap composed of 63 places in 385 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:33] [INFO ] Deduced a trap composed of 64 places in 358 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:33] [INFO ] Deduced a trap composed of 63 places in 367 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:33] [INFO ] Deduced a trap composed of 63 places in 365 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:34] [INFO ] Deduced a trap composed of 63 places in 254 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:34] [INFO ] Deduced a trap composed of 63 places in 352 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:34] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:35] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:35] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:36] [INFO ] Deduced a trap composed of 63 places in 290 ms of which 33 ms to minimize.
SMT process timed out in 30308ms, After SMT, problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 30310ms
Starting structural reductions in LTL mode, iteration 1 : 504/522 places, 437/455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32747 ms. Remains : 504/522 places, 437/455 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-09 finished in 32966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0 U (p1&&F(p0))) U X(X(p1))))||G(p2))))'
Support contains 5 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 505 transition count 438
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 505 transition count 438
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 502 transition count 435
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 502 transition count 435
Applied a total of 40 rules in 34 ms. Remains 502 /522 variables (removed 20) and now considering 435/455 (removed 20) transitions.
// Phase 1: matrix 435 rows 502 cols
[2025-05-30 12:06:36] [INFO ] Computed 105 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:37] [INFO ] Implicit Places using invariants in 632 ms returned []
[2025-05-30 12:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:39] [INFO ] Implicit Places using invariants and state equation in 2513 ms returned []
Implicit Place search using SMT with State Equation took 3151 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-05-30 12:06:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:01] [INFO ] Deduced a trap composed of 63 places in 377 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:02] [INFO ] Deduced a trap composed of 63 places in 366 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:02] [INFO ] Deduced a trap composed of 63 places in 355 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:02] [INFO ] Deduced a trap composed of 63 places in 364 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:03] [INFO ] Deduced a trap composed of 63 places in 332 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:03] [INFO ] Deduced a trap composed of 63 places in 330 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:03] [INFO ] Deduced a trap composed of 63 places in 322 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:04] [INFO ] Deduced a trap composed of 63 places in 329 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:04] [INFO ] Deduced a trap composed of 84 places in 331 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:04] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:05] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:05] [INFO ] Deduced a trap composed of 63 places in 370 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:06] [INFO ] Deduced a trap composed of 82 places in 386 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:06] [INFO ] Deduced a trap composed of 77 places in 343 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:06] [INFO ] Deduced a trap composed of 82 places in 349 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:07] [INFO ] Deduced a trap composed of 78 places in 359 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:07] [INFO ] Deduced a trap composed of 82 places in 396 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:07] [INFO ] Deduced a trap composed of 82 places in 260 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:08] [INFO ] Deduced a trap composed of 77 places in 214 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:08] [INFO ] Deduced a trap composed of 77 places in 323 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:09] [INFO ] Deduced a trap composed of 84 places in 370 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:09] [INFO ] Deduced a trap composed of 84 places in 363 ms of which 94 ms to minimize.
SMT process timed out in 30226ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 30227ms
Starting structural reductions in LTL mode, iteration 1 : 502/522 places, 435/455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33413 ms. Remains : 502/522 places, 435/455 transitions.
Stuttering acceptance computed with spot in 1130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 34615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Graph (trivial) has 248 edges and 522 vertex of which 7 / 522 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1154 edges and 516 vertex of which 515 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 514 transition count 388
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 456 transition count 388
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 118 place count 456 transition count 280
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 354 place count 328 transition count 280
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 367 place count 315 transition count 267
Iterating global reduction 2 with 13 rules applied. Total rules applied 380 place count 315 transition count 267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 380 place count 315 transition count 265
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 384 place count 313 transition count 265
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 651 place count 177 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 653 place count 176 transition count 138
Applied a total of 653 rules in 39 ms. Remains 176 /522 variables (removed 346) and now considering 138/455 (removed 317) transitions.
// Phase 1: matrix 138 rows 176 cols
[2025-05-30 12:07:10] [INFO ] Computed 80 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:11] [INFO ] Implicit Places using invariants in 346 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 349 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/522 places, 138/455 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 393 ms. Remains : 154/522 places, 138/455 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-11 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Graph (trivial) has 248 edges and 522 vertex of which 7 / 522 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1154 edges and 516 vertex of which 515 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 514 transition count 388
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 456 transition count 388
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 118 place count 456 transition count 281
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 352 place count 329 transition count 281
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 366 place count 315 transition count 267
Iterating global reduction 2 with 14 rules applied. Total rules applied 380 place count 315 transition count 267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 380 place count 315 transition count 265
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 384 place count 313 transition count 265
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 647 place count 179 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 649 place count 178 transition count 140
Applied a total of 649 rules in 41 ms. Remains 178 /522 variables (removed 344) and now considering 140/455 (removed 315) transitions.
// Phase 1: matrix 140 rows 178 cols
[2025-05-30 12:07:11] [INFO ] Computed 80 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:11] [INFO ] Implicit Places using invariants in 304 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 305 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/522 places, 140/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 351 ms. Remains : 156/522 places, 140/455 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 17797 reset in 250 ms.
Product exploration explored 100000 steps with 17753 reset in 291 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (7900 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2427 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 610 steps, run visited all 1 properties in 11 ms. (steps per millisecond=55 )
Probabilistic random walk after 610 steps, saw 285 distinct states, run finished after 12 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 156 cols
[2025-05-30 12:07:12] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:13] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-30 12:07:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 12:07:13] [INFO ] Implicit Places using invariants and state equation in 725 ms returned [3, 26, 28, 30, 37, 39, 41, 43, 45, 52, 54, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 951 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/156 places, 140/140 transitions.
Graph (complete) has 396 edges and 124 vertex of which 115 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 115 transition count 123
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 102 transition count 123
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 38 place count 91 transition count 87
Iterating global reduction 2 with 11 rules applied. Total rules applied 49 place count 91 transition count 87
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 91 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 89 transition count 85
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 86 transition count 82
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 86 transition count 82
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 77 place count 75 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 73 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 73 transition count 72
Applied a total of 82 rules in 16 ms. Remains 73 /124 variables (removed 51) and now considering 72/140 (removed 68) transitions.
// Phase 1: matrix 72 rows 73 cols
[2025-05-30 12:07:13] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:14] [INFO ] Implicit Places using invariants in 115 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/156 places, 72/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 72 /72 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1093 ms. Remains : 72/156 places, 72/140 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8049 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2439 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 333 steps, run visited all 1 properties in 6 ms. (steps per millisecond=55 )
Probabilistic random walk after 333 steps, saw 172 distinct states, run finished after 6 ms. (steps per millisecond=55 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18219 reset in 109 ms.
Product exploration explored 100000 steps with 18195 reset in 115 ms.
Built C files in :
/tmp/ltsmin6466335783001783618
[2025-05-30 12:07:14] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-05-30 12:07:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:07:14] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-05-30 12:07:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:07:14] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-05-30 12:07:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:07:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6466335783001783618
Running compilation step : cd /tmp/ltsmin6466335783001783618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin6466335783001783618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6466335783001783618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6594430870227002362.hoa' '--buchi-type=spotba'
LTSmin run took 219 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-12 finished in 4086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 505 transition count 438
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 505 transition count 438
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 502 transition count 435
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 502 transition count 435
Applied a total of 40 rules in 31 ms. Remains 502 /522 variables (removed 20) and now considering 435/455 (removed 20) transitions.
// Phase 1: matrix 435 rows 502 cols
[2025-05-30 12:07:15] [INFO ] Computed 105 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:16] [INFO ] Implicit Places using invariants in 643 ms returned []
[2025-05-30 12:07:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:18] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-05-30 12:07:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:41] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:41] [INFO ] Deduced a trap composed of 62 places in 300 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:42] [INFO ] Deduced a trap composed of 62 places in 261 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:42] [INFO ] Deduced a trap composed of 62 places in 269 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:42] [INFO ] Deduced a trap composed of 62 places in 403 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:43] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:43] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:43] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:43] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:44] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:44] [INFO ] Deduced a trap composed of 62 places in 390 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:44] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:45] [INFO ] Deduced a trap composed of 62 places in 283 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:45] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:45] [INFO ] Deduced a trap composed of 62 places in 285 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:46] [INFO ] Deduced a trap composed of 62 places in 392 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:46] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:46] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:46] [INFO ] Deduced a trap composed of 62 places in 343 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:47] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:48] [INFO ] Deduced a trap composed of 62 places in 353 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:48] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:48] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 64 ms to minimize.
SMT process timed out in 30228ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 30230ms
Starting structural reductions in LTL mode, iteration 1 : 502/522 places, 435/455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33206 ms. Remains : 502/522 places, 435/455 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 367 ms.
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1136 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 207 stabilizing places and 179 stable transitions
Detected a total of 207/502 stabilizing places and 179/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-13 finished in 34020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p2)))))))'
Support contains 3 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 506 transition count 439
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 506 transition count 439
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 503 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 503 transition count 436
Applied a total of 38 rules in 33 ms. Remains 503 /522 variables (removed 19) and now considering 436/455 (removed 19) transitions.
// Phase 1: matrix 436 rows 503 cols
[2025-05-30 12:07:49] [INFO ] Computed 105 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:50] [INFO ] Implicit Places using invariants in 683 ms returned []
[2025-05-30 12:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:52] [INFO ] Implicit Places using invariants and state equation in 2615 ms returned []
Implicit Place search using SMT with State Equation took 3300 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2025-05-30 12:07:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:16] [INFO ] Deduced a trap composed of 63 places in 282 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:16] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:16] [INFO ] Deduced a trap composed of 63 places in 271 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:16] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:17] [INFO ] Deduced a trap composed of 63 places in 388 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:17] [INFO ] Deduced a trap composed of 63 places in 374 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:18] [INFO ] Deduced a trap composed of 63 places in 360 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:18] [INFO ] Deduced a trap composed of 63 places in 365 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:18] [INFO ] Deduced a trap composed of 63 places in 331 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:19] [INFO ] Deduced a trap composed of 63 places in 315 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:19] [INFO ] Deduced a trap composed of 63 places in 347 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:19] [INFO ] Deduced a trap composed of 63 places in 369 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:20] [INFO ] Deduced a trap composed of 63 places in 357 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:20] [INFO ] Deduced a trap composed of 63 places in 364 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:21] [INFO ] Deduced a trap composed of 63 places in 347 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:21] [INFO ] Deduced a trap composed of 84 places in 363 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:21] [INFO ] Deduced a trap composed of 82 places in 351 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:22] [INFO ] Deduced a trap composed of 82 places in 404 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:22] [INFO ] Deduced a trap composed of 77 places in 373 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:23] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 63 ms to minimize.
SMT process timed out in 30203ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Starting structural reductions in LTL mode, iteration 1 : 503/522 places, 436/455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33541 ms. Remains : 503/522 places, 436/455 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-14 finished in 33830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X((p1||X(X((p2 U p3)))))))))'
Support contains 6 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 455/455 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 506 transition count 439
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 506 transition count 439
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 503 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 503 transition count 436
Applied a total of 38 rules in 48 ms. Remains 503 /522 variables (removed 19) and now considering 436/455 (removed 19) transitions.
// Phase 1: matrix 436 rows 503 cols
[2025-05-30 12:08:23] [INFO ] Computed 105 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:23] [INFO ] Implicit Places using invariants in 561 ms returned []
[2025-05-30 12:08:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:26] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 3061 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2025-05-30 12:08:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 62/101 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:51] [INFO ] Deduced a trap composed of 64 places in 412 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:52] [INFO ] Deduced a trap composed of 84 places in 369 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:52] [INFO ] Deduced a trap composed of 84 places in 418 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:53] [INFO ] Deduced a trap composed of 84 places in 375 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:53] [INFO ] Deduced a trap composed of 84 places in 384 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:53] [INFO ] Deduced a trap composed of 84 places in 341 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:54] [INFO ] Deduced a trap composed of 84 places in 440 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:54] [INFO ] Deduced a trap composed of 84 places in 381 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:55] [INFO ] Deduced a trap composed of 84 places in 342 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:55] [INFO ] Deduced a trap composed of 85 places in 358 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:55] [INFO ] Deduced a trap composed of 85 places in 222 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:55] [INFO ] Deduced a trap composed of 85 places in 218 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:56] [INFO ] Deduced a trap composed of 85 places in 279 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:56] [INFO ] Deduced a trap composed of 85 places in 281 ms of which 49 ms to minimize.
SMT process timed out in 30134ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 30135ms
Starting structural reductions in LTL mode, iteration 1 : 503/522 places, 436/455 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33246 ms. Remains : 503/522 places, 436/455 transitions.
Stuttering acceptance computed with spot in 767 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 657 reset in 289 ms.
Product exploration explored 100000 steps with 661 reset in 488 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1137 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/503 stabilizing places and 178/436 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 236 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 41 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 837 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (264 resets) in 406 ms. (98 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 472894 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :16 out of 18
Probabilistic random walk after 472894 steps, saw 79526 distinct states, run finished after 3007 ms. (steps per millisecond=157 ) properties seen :16
[2025-05-30 12:09:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 152/939 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 5/62 constraints, Generalized P Invariants (flows): 0/43 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 p1 p3 (NOT p2))), (G (OR p0 p3 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 p3))), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p3 p2))), (F (NOT (OR p0 p1 p3 p2))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F p3), (F p1), (F p2), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1 p3)))]
Knowledge based reduction with 9 factoid took 829 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 727 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 787 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2025-05-30 12:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:09:05] [INFO ] [Real]Absence check using 62 positive place invariants in 143 ms returned sat
[2025-05-30 12:09:05] [INFO ] [Real]Absence check using 62 positive and 43 generalized place invariants in 63 ms returned sat
[2025-05-30 12:09:08] [INFO ] [Real]Absence check using state equation in 2796 ms returned sat
[2025-05-30 12:09:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:09:08] [INFO ] [Nat]Absence check using 62 positive place invariants in 97 ms returned sat
[2025-05-30 12:09:08] [INFO ] [Nat]Absence check using 62 positive and 43 generalized place invariants in 184 ms returned sat
[2025-05-30 12:09:13] [INFO ] [Nat]Absence check using state equation in 4743 ms returned sat
[2025-05-30 12:09:13] [INFO ] Computed and/alt/rep : 430/835/430 causal constraints (skipped 5 transitions) in 35 ms.
[2025-05-30 12:09:21] [INFO ] Added : 278 causal constraints over 56 iterations in 7819 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 436/436 transitions.
Applied a total of 0 rules in 16 ms. Remains 503 /503 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2025-05-30 12:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:22] [INFO ] Implicit Places using invariants in 528 ms returned []
[2025-05-30 12:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:24] [INFO ] Implicit Places using invariants and state equation in 2280 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2025-05-30 12:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 62/101 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:51] [INFO ] Deduced a trap composed of 64 places in 367 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:51] [INFO ] Deduced a trap composed of 84 places in 335 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:52] [INFO ] Deduced a trap composed of 84 places in 303 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:52] [INFO ] Deduced a trap composed of 84 places in 272 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:52] [INFO ] Deduced a trap composed of 84 places in 361 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:53] [INFO ] Deduced a trap composed of 84 places in 415 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:53] [INFO ] Deduced a trap composed of 84 places in 416 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:54] [INFO ] Deduced a trap composed of 84 places in 382 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:54] [INFO ] Deduced a trap composed of 84 places in 363 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:54] [INFO ] Deduced a trap composed of 85 places in 364 ms of which 89 ms to minimize.
SMT process timed out in 30402ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 30405ms
Finished structural reductions in LTL mode , in 1 iterations and 33237 ms. Remains : 503/503 places, 436/436 transitions.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1137 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/503 stabilizing places and 178/436 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 676 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (262 resets) in 372 ms. (107 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (46 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (42 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
[2025-05-30 12:09:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 146/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 231/383 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:56] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:56] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:56] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:56] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:57] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:57] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:57] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:57] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:57] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:58] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:58] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:58] [INFO ] Deduced a trap composed of 72 places in 253 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:58] [INFO ] Deduced a trap composed of 72 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:59] [INFO ] Deduced a trap composed of 72 places in 253 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:59] [INFO ] Deduced a trap composed of 72 places in 240 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:59] [INFO ] Deduced a trap composed of 72 places in 245 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:59] [INFO ] Deduced a trap composed of 73 places in 253 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:00] [INFO ] Deduced a trap composed of 73 places in 253 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:00] [INFO ] Deduced a trap composed of 73 places in 243 ms of which 47 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:00] [INFO ] Deduced a trap composed of 73 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:00] [INFO ] Deduced a trap composed of 72 places in 235 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:01] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:01] [INFO ] Deduced a trap composed of 73 places in 286 ms of which 54 ms to minimize.
SMT process timed out in 5257ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 436/436 transitions.
Graph (trivial) has 225 edges and 503 vertex of which 6 / 503 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 1130 edges and 498 vertex of which 497 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 497 transition count 379
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 448 transition count 379
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 100 place count 448 transition count 272
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 334 place count 321 transition count 272
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 607 place count 182 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 609 place count 181 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 611 place count 181 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 613 place count 179 transition count 140
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 618 place count 179 transition count 140
Applied a total of 618 rules in 54 ms. Remains 179 /503 variables (removed 324) and now considering 140/436 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 179/503 places, 140/436 transitions.
RANDOM walk for 2288 steps (59 resets) in 34 ms. (65 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p0 p3))), (F (NOT p0)), (F p3), (F p2), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p3))))]
Knowledge based reduction with 7 factoid took 760 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 749 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 713 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2025-05-30 12:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:10:04] [INFO ] [Real]Absence check using 62 positive place invariants in 201 ms returned sat
[2025-05-30 12:10:04] [INFO ] [Real]Absence check using 62 positive and 43 generalized place invariants in 80 ms returned sat
[2025-05-30 12:10:08] [INFO ] [Real]Absence check using state equation in 3676 ms returned sat
[2025-05-30 12:10:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:10:08] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2025-05-30 12:10:08] [INFO ] [Nat]Absence check using 62 positive and 43 generalized place invariants in 114 ms returned sat
[2025-05-30 12:10:13] [INFO ] [Nat]Absence check using state equation in 4514 ms returned sat
[2025-05-30 12:10:13] [INFO ] Computed and/alt/rep : 430/835/430 causal constraints (skipped 5 transitions) in 49 ms.
[2025-05-30 12:10:20] [INFO ] Added : 278 causal constraints over 56 iterations in 6870 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 742 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 656 reset in 289 ms.
Product exploration explored 100000 steps with 661 reset in 508 ms.
Built C files in :
/tmp/ltsmin8972872156618166124
[2025-05-30 12:10:21] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8972872156618166124
Running compilation step : cd /tmp/ltsmin8972872156618166124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1222 ms.
Running link step : cd /tmp/ltsmin8972872156618166124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8972872156618166124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15444813723372054225.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-15 finished in 120022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&((p1 U X(p2)) U (G((p1 U X(p2)))||(!p3&&(p1 U X(p2))))))))))'
[2025-05-30 12:10:23] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13473677759786678648
[2025-05-30 12:10:23] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2025-05-30 12:10:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:10:23] [INFO ] Applying decomposition
[2025-05-30 12:10:23] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2025-05-30 12:10:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:10:23] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17270882301762580316.txt' '-o' '/tmp/graph17270882301762580316.bin' '-w' '/tmp/graph17270882301762580316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17270882301762580316.bin' '-l' '-1' '-v' '-w' '/tmp/graph17270882301762580316.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:10:23] [INFO ] Decomposing Gal with order
[2025-05-30 12:10:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:10:23] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2025-05-30 12:10:23] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:10:23] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13473677759786678648
Running compilation step : cd /tmp/ltsmin13473677759786678648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 12:10:23] [INFO ] Removed a total of 257 redundant transitions.
[2025-05-30 12:10:23] [INFO ] Flatten gal took : 50 ms
[2025-05-30 12:10:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2025-05-30 12:10:23] [INFO ] Time to serialize gal into /tmp/LTLFireability12222764709683183196.gal : 9 ms
[2025-05-30 12:10:23] [INFO ] Time to serialize properties into /tmp/LTLFireability15184769077584911958.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12222764709683183196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15184769077584911958.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(("(i6.u26.p68!=1)")U((G("(i6.u26.p68!=1)"))||(("(i6.u26.p68!=1)")&&((("(((i6.u27.p75==1)&&(i6.u115.p340==1))&&(i16.u143.p611==1))...652
Formula 0 simplified : X(("((i7.u155.p526==1)||(((i2.u63.p182==1)&&(i15.i1.i1.u127.p391==1))&&(i2.u162.p566==1)))" U (!"(((i6.u27.p75==1)&&(i6.u115.p340==1...287
Compilation finished in 1754 ms.
Running link step : cd /tmp/ltsmin13473677759786678648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13473677759786678648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&(((LTLAPp1==true) U X((LTLAPp2==true))) U ([](((LTLAPp1==true) U X((LTLAPp2==true))))||(!(LTLAPp3==true)&&((LTLAPp1==true) U X((LTLAPp2==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t69, t186, t194, t288, t301, t435, t436, t439, t448, i0.u140.t82, i0.u141.t79...1426
Computing Next relation with stutter on 1312 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.045: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.045: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.101: LTL layer: formula: X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&(((LTLAPp1==true) U X((LTLAPp2==true))) U ([](((LTLAPp1==true) U X((LTLAPp2==true))))||(!(LTLAPp3==true)&&((LTLAPp1==true) U X((LTLAPp2==true))))))))))
pins2lts-mc-linux64( 6/ 8), 0.101: "X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&(((LTLAPp1==true) U X((LTLAPp2==true))) U ([](((LTLAPp1==true) U X((LTLAPp2==true))))||(!(LTLAPp3==true)&&((LTLAPp1==true) U X((LTLAPp2==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.101: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.114: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.115: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.140: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.449: There are 460 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.449: State length is 523, there are 481 groups
pins2lts-mc-linux64( 0/ 8), 0.449: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.449: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.449: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.449: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.563: [Blue] ~120 levels ~960 states ~3824 transitions
pins2lts-mc-linux64( 5/ 8), 0.624: [Blue] ~141 levels ~1920 states ~7528 transitions
pins2lts-mc-linux64( 5/ 8), 0.700: [Blue] ~141 levels ~3840 states ~16544 transitions
pins2lts-mc-linux64( 1/ 8), 0.864: [Blue] ~144 levels ~7680 states ~36328 transitions
pins2lts-mc-linux64( 5/ 8), 1.195: [Blue] ~141 levels ~15360 states ~83128 transitions
pins2lts-mc-linux64( 5/ 8), 1.787: [Blue] ~141 levels ~30720 states ~175296 transitions
pins2lts-mc-linux64( 5/ 8), 2.809: [Blue] ~141 levels ~61440 states ~364248 transitions
pins2lts-mc-linux64( 6/ 8), 4.659: [Blue] ~148 levels ~122880 states ~740232 transitions
pins2lts-mc-linux64( 1/ 8), 8.037: [Blue] ~144 levels ~245760 states ~1686264 transitions
pins2lts-mc-linux64( 3/ 8), 13.897: [Blue] ~140 levels ~491520 states ~3278136 transitions
pins2lts-mc-linux64( 4/ 8), 23.860: [Blue] ~149 levels ~983040 states ~7126072 transitions
pins2lts-mc-linux64( 4/ 8), 42.019: [Blue] ~149 levels ~1966080 states ~15234848 transitions
pins2lts-mc-linux64( 4/ 8), 78.340: [Blue] ~149 levels ~3932160 states ~31540384 transitions
pins2lts-mc-linux64( 0/ 8), 150.701: [Blue] ~140 levels ~7864320 states ~63176896 transitions
pins2lts-mc-linux64( 0/ 8), 296.009: [Blue] ~140 levels ~15728640 states ~129609256 transitions
pins2lts-mc-linux64( 5/ 8), 489.789: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 489.863:
pins2lts-mc-linux64( 0/ 8), 489.863: Explored 24072491 states 221349257 transitions, fanout: 9.195
pins2lts-mc-linux64( 0/ 8), 489.863: Total exploration time 489.400 sec (489.340 sec minimum, 489.361 sec on average)
pins2lts-mc-linux64( 0/ 8), 489.863: States per second: 49188, Transitions per second: 452287
pins2lts-mc-linux64( 0/ 8), 489.863:
pins2lts-mc-linux64( 0/ 8), 489.863: State space has 23771552 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 489.863: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 489.863: blue states: 24072491 (101.27%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 489.863: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 489.863: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 489.863:
pins2lts-mc-linux64( 0/ 8), 489.863: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 489.863:
pins2lts-mc-linux64( 0/ 8), 489.863: Queue width: 8B, total height: 1142, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 489.863: Tree memory: 437.4MB, 19.3 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 489.863: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 489.863: Stored 460 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 489.863: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 489.863: Est. total memory use: 437.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13473677759786678648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&(((LTLAPp1==true) U X((LTLAPp2==true))) U ([](((LTLAPp1==true) U X((LTLAPp2==true))))||(!(LTLAPp3==true)&&((LTLAPp1==true) U X((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13473677759786678648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&(((LTLAPp1==true) U X((LTLAPp2==true))) U ([](((LTLAPp1==true) U X((LTLAPp2==true))))||(!(LTLAPp3==true)&&((LTLAPp1==true) U X((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 12:34:08] [INFO ] Applying decomposition
[2025-05-30 12:34:08] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:34:08] [INFO ] Decomposing Gal with order
[2025-05-30 12:34:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:34:08] [INFO ] Removed a total of 137 redundant transitions.
[2025-05-30 12:34:08] [INFO ] Flatten gal took : 44 ms
[2025-05-30 12:34:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 186 ms.
[2025-05-30 12:34:08] [INFO ] Time to serialize gal into /tmp/LTLFireability13896303108422220574.gal : 21 ms
[2025-05-30 12:34:08] [INFO ] Time to serialize properties into /tmp/LTLFireability16611410595994969278.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13896303108422220574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16611410595994969278.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u34.p68!=1)")U((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...2004
Formula 0 simplified : X(("((i1.u222.p526==1)||(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u57.p182==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....791
Detected timeout of ITS tools.
[2025-05-30 12:57:58] [INFO ] Flatten gal took : 1785 ms
[2025-05-30 12:58:00] [INFO ] Input system was already deterministic with 455 transitions.
[2025-05-30 12:58:01] [INFO ] Transformed 522 places.
[2025-05-30 12:58:01] [INFO ] Transformed 455 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 12:58:31] [INFO ] Time to serialize gal into /tmp/LTLFireability16406832085528071765.gal : 7 ms
[2025-05-30 12:58:31] [INFO ] Time to serialize properties into /tmp/LTLFireability11479415228592441099.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16406832085528071765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11479415228592441099.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("(p68!=1)")U((G("(p68!=1)"))||(("(p68!=1)")&&((("(((p75==1)&&(p340==1))&&(p611==1))")U(X("((p68==1)||(((p75==1)&&(p340==1))&&(p6...428
Formula 0 simplified : X(("((p526==1)||(((p182==1)&&(p391==1))&&(p566==1)))" U (!"(((p75==1)&&(p340==1))&&(p611==1))" R X!"((p68==1)||(((p75==1)&&(p340==1)...187

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-17"
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-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-17, 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 r030-smll-174853813400132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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