Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920000084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is MedleyA-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 160K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717364310844

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 21:38:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:38:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:38:34] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2024-06-02 21:38:34] [INFO ] Transformed 150 places.
[2024-06-02 21:38:34] [INFO ] Transformed 478 transitions.
[2024-06-02 21:38:34] [INFO ] Found NUPN structural information;
[2024-06-02 21:38:34] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 117 transition count 421
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 117 transition count 421
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 111 transition count 389
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 111 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 110 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 110 transition count 385
Applied a total of 80 rules in 106 ms. Remains 110 /150 variables (removed 40) and now considering 385/469 (removed 84) transitions.
[2024-06-02 21:38:34] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
// Phase 1: matrix 313 rows 110 cols
[2024-06-02 21:38:34] [INFO ] Computed 23 invariants in 37 ms
[2024-06-02 21:38:35] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-06-02 21:38:35] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
[2024-06-02 21:38:35] [INFO ] Invariant cache hit.
[2024-06-02 21:38:35] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-06-02 21:38:35] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-06-02 21:38:35] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
[2024-06-02 21:38:35] [INFO ] Invariant cache hit.
[2024-06-02 21:38:35] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/110 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 21:38:41] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 25 ms to minimize.
[2024-06-02 21:38:41] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 7 ms to minimize.
[2024-06-02 21:38:41] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-02 21:38:42] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:38:42] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:38:42] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:38:42] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:38:42] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:38:42] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:38:42] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:38:43] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:38:43] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:38:43] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:38:43] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:38:43] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
[2024-06-02 21:38:44] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:38:44] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:38:44] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:38:44] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-02 21:38:44] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 21:38:45] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:38:45] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:38:46] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:38:46] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:38:46] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:38:46] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:38:46] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:38:46] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:38:46] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 2 ms to minimize.
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 3 ms to minimize.
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 4 ms to minimize.
[2024-06-02 21:38:47] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:38:48] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 17/60 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 21:38:49] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:38:49] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:38:49] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 3/63 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 21:38:51] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/64 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 21:38:54] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:38:54] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:38:54] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 3/67 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/67 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 313/423 variables, 110/177 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 158/335 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/335 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 12 (OVERLAPS) 0/423 variables, 0/335 constraints. Problems are: Problem set: 108 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 335 constraints, problems are : Problem set: 108 solved, 276 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 110/110 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 108 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 14/14 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 44/67 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 21:39:08] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:39:09] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/69 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/69 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 313/423 variables, 110/179 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 158/337 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 276/613 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 21:39:25] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:39:30] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 2/615 constraints. Problems are: Problem set: 108 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 615 constraints, problems are : Problem set: 108 solved, 276 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 110/110 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 276/384 constraints, Known Traps: 48/48 constraints]
After SMT, in 61173ms problems are : Problem set: 108 solved, 276 unsolved
Search for dead transitions found 108 dead transitions in 61230ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/150 places, 277/469 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62412 ms. Remains : 110/150 places, 277/469 transitions.
Support contains 46 out of 110 places after structural reductions.
[2024-06-02 21:39:37] [INFO ] Flatten gal took : 80 ms
[2024-06-02 21:39:37] [INFO ] Flatten gal took : 39 ms
[2024-06-02 21:39:37] [INFO ] Input system was already deterministic with 277 transitions.
Support contains 43 out of 110 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (3138 resets) in 2378 ms. (16 steps per ms) remains 20/27 properties
BEST_FIRST walk for 4004 steps (53 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (34 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (49 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (55 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (55 resets) in 50 ms. (78 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (63 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (51 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (52 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (48 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (52 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (50 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (63 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (51 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (51 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (52 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
// Phase 1: matrix 277 rows 110 cols
[2024-06-02 21:39:38] [INFO ] Computed 23 invariants in 10 ms
[2024-06-02 21:39:38] [INFO ] State equation strengthened by 122 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/67 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 3 (OVERLAPS) 39/106 variables, 13/22 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/22 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/109 variables, 1/23 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 276/385 variables, 109/132 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 122/254 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/254 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 2/387 variables, 1/255 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/255 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/387 variables, 0/255 constraints. Problems are: Problem set: 7 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 255 constraints, problems are : Problem set: 7 solved, 13 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 110/110 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 33/59 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/63 variables, 2/9 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 13 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 43/106 variables, 13/22 constraints. Problems are: Problem set: 8 solved, 12 unsolved
[2024-06-02 21:39:39] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:39:39] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:39:39] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 4 ms to minimize.
[2024-06-02 21:39:40] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:39:40] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:39:40] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:39:40] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:39:40] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 14 ms to minimize.
[2024-06-02 21:39:40] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 9/31 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/31 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 3/109 variables, 1/32 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 276/385 variables, 109/141 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 122/263 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 7/270 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/270 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 2/387 variables, 1/271 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 5/276 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/276 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/276 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 276 constraints, problems are : Problem set: 8 solved, 12 unsolved in 3094 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 110/110 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 12/20 constraints, Known Traps: 9/9 constraints]
After SMT, in 4255ms problems are : Problem set: 8 solved, 12 unsolved
Parikh walk visited 6 properties in 6061 ms.
Support contains 16 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 545 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 100 transition count 252
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 100 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 98 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 98 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 97 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 97 transition count 237
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 1 with 2 rules applied. Total rules applied 25 place count 96 transition count 236
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 1 with 2 rules applied. Total rules applied 27 place count 95 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 95 transition count 232
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 1 with 2 rules applied. Total rules applied 37 place count 94 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 93 transition count 242
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 54 place count 93 transition count 382
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 88 place count 78 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 78 transition count 361
Applied a total of 90 rules in 163 ms. Remains 78 /110 variables (removed 32) and now considering 361/277 (removed -84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 78/110 places, 361/277 transitions.
RANDOM walk for 40000 steps (4318 resets) in 1181 ms. (33 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (786 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (769 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (780 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (783 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
[2024-06-02 21:39:49] [INFO ] Flow matrix only has 349 transitions (discarded 12 similar events)
// Phase 1: matrix 349 rows 78 cols
[2024-06-02 21:39:49] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 21:39:49] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/57 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/75 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/77 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 349/426 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 192/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/427 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/427 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 291 constraints, problems are : Problem set: 0 solved, 4 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/57 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:39:49] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:39:50] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/75 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:39:50] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/77 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 349/426 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 192/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/427 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/427 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 298 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1548 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1951ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 364 ms.
Support contains 10 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 361/361 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 76 transition count 359
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 76 transition count 359
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 76 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 74 transition count 378
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 74 transition count 378
Applied a total of 13 rules in 60 ms. Remains 74 /78 variables (removed 4) and now considering 378/361 (removed -17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 74/78 places, 378/361 transitions.
RANDOM walk for 40000 steps (4572 resets) in 448 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (918 resets) in 208 ms. (191 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (843 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (906 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
[2024-06-02 21:39:52] [INFO ] Flow matrix only has 366 transitions (discarded 12 similar events)
// Phase 1: matrix 366 rows 74 cols
[2024-06-02 21:39:52] [INFO ] Computed 21 invariants in 6 ms
[2024-06-02 21:39:52] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/53 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/71 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/73 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 366/439 variables, 73/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 192/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/440 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/440 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/53 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:39:52] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/71 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 366/439 variables, 73/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 192/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/440 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1651ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 233 ms.
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 378/378 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 377
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 73 transition count 555
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 69 transition count 555
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 68 transition count 531
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 68 transition count 531
Applied a total of 12 rules in 76 ms. Remains 68 /74 variables (removed 6) and now considering 531/378 (removed -153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 68/74 places, 531/378 transitions.
RANDOM walk for 40000 steps (5620 resets) in 737 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1074 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17789 steps, run visited all 1 properties in 182 ms. (steps per millisecond=97 )
Probabilistic random walk after 17789 steps, saw 4520 distinct states, run finished after 190 ms. (steps per millisecond=93 ) properties seen :1
FORMULA MedleyA-PT-11-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyA-PT-11-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 111 stable transitions
Graph (complete) has 719 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
FORMULA MedleyA-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 97 transition count 245
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 97 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 94 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 94 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 93 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 93 transition count 224
Applied a total of 31 rules in 17 ms. Remains 93 /110 variables (removed 17) and now considering 224/277 (removed 53) transitions.
// Phase 1: matrix 224 rows 93 cols
[2024-06-02 21:39:54] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:39:55] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-02 21:39:55] [INFO ] Invariant cache hit.
[2024-06-02 21:39:55] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:39:55] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-02 21:39:55] [INFO ] Invariant cache hit.
[2024-06-02 21:39:55] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 21:39:58] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-02 21:39:59] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:39:59] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:39:59] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 21:40:01] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/317 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 108/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 226 constraints, problems are : Problem set: 0 solved, 223 unsolved in 14529 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 21:40:12] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/317 variables, 93/119 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 108/227 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 223/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 450 constraints, problems are : Problem set: 0 solved, 223 unsolved in 15814 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
After SMT, in 30640ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 30646ms
Starting structural reductions in LTL mode, iteration 1 : 93/110 places, 224/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31152 ms. Remains : 93/110 places, 224/277 transitions.
Stuttering acceptance computed with spot in 346 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-00 finished in 31607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 96 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 96 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 92 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 92 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 91 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 91 transition count 215
Applied a total of 35 rules in 9 ms. Remains 91 /110 variables (removed 19) and now considering 215/277 (removed 62) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 21:40:26] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:40:26] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:40:26] [INFO ] Invariant cache hit.
[2024-06-02 21:40:26] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 21:40:26] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 21:40:26] [INFO ] Invariant cache hit.
[2024-06-02 21:40:26] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:40:29] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:40:29] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8558 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 432 constraints, problems are : Problem set: 0 solved, 214 unsolved in 11839 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 20562ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 20565ms
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 215/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20901 ms. Remains : 91/110 places, 215/277 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-05
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-05 finished in 21018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 97 transition count 245
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 97 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 94 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 94 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 93 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 93 transition count 224
Applied a total of 31 rules in 11 ms. Remains 93 /110 variables (removed 17) and now considering 224/277 (removed 53) transitions.
// Phase 1: matrix 224 rows 93 cols
[2024-06-02 21:40:47] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:40:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:40:47] [INFO ] Invariant cache hit.
[2024-06-02 21:40:47] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:40:47] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-02 21:40:47] [INFO ] Invariant cache hit.
[2024-06-02 21:40:47] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 21:40:50] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:40:50] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-06-02 21:40:50] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:40:51] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 21:40:52] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/317 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 108/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 226 constraints, problems are : Problem set: 0 solved, 223 unsolved in 13394 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 21:41:03] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/317 variables, 93/119 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 108/227 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 223/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 450 constraints, problems are : Problem set: 0 solved, 223 unsolved in 15232 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
After SMT, in 28929ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 28934ms
Starting structural reductions in LTL mode, iteration 1 : 93/110 places, 224/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29258 ms. Remains : 93/110 places, 224/277 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-06
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-06 finished in 29460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 719 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 95 transition count 239
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 95 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 27 place count 91 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 91 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 90 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 90 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 89 transition count 213
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 84 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 65 place count 84 transition count 222
Applied a total of 65 rules in 39 ms. Remains 84 /110 variables (removed 26) and now considering 222/277 (removed 55) transitions.
// Phase 1: matrix 222 rows 84 cols
[2024-06-02 21:41:17] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:41:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:41:17] [INFO ] Invariant cache hit.
[2024-06-02 21:41:17] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-02 21:41:17] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-02 21:41:17] [INFO ] Redundant transitions in 18 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-02 21:41:17] [INFO ] Invariant cache hit.
[2024-06-02 21:41:17] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-02 21:41:19] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:41:20] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:41:20] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 222/306 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 113/220 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 220 constraints, problems are : Problem set: 0 solved, 218 unsolved in 11136 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 222/306 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 113/220 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 218/438 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 438 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14366 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 3/3 constraints]
After SMT, in 25811ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 25815ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/110 places, 222/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26200 ms. Remains : 84/110 places, 222/277 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-07 finished in 26262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U G(p1)))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 719 edges and 110 vertex of which 109 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
Ensure Unique test removed 3 places
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 96 transition count 245
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 96 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 92 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 92 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 91 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 91 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 90 transition count 219
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 41 place count 86 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 57 place count 86 transition count 230
Applied a total of 57 rules in 25 ms. Remains 86 /110 variables (removed 24) and now considering 230/277 (removed 47) transitions.
// Phase 1: matrix 230 rows 86 cols
[2024-06-02 21:41:43] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:41:43] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 21:41:43] [INFO ] Invariant cache hit.
[2024-06-02 21:41:43] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-02 21:41:43] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-06-02 21:41:43] [INFO ] Redundant transitions in 12 ms returned []
Running 226 sub problems to find dead transitions.
[2024-06-02 21:41:43] [INFO ] Invariant cache hit.
[2024-06-02 21:41:43] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 21:41:45] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-02 21:41:46] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:41:46] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 230/316 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 115/224 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 224 constraints, problems are : Problem set: 0 solved, 226 unsolved in 11252 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 230/316 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 115/224 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 226/450 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/316 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 450 constraints, problems are : Problem set: 0 solved, 226 unsolved in 17456 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 3/3 constraints]
After SMT, in 28916ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 28918ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/110 places, 230/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29335 ms. Remains : 86/110 places, 230/277 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), p0]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-10
Stuttering criterion allowed to conclude after 32 steps with 8 reset in 2 ms.
FORMULA MedleyA-PT-11-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-10 finished in 29453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U X(p1))||F(p2))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 99 transition count 251
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 99 transition count 251
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 95 transition count 230
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 95 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 94 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 94 transition count 226
Applied a total of 29 rules in 9 ms. Remains 94 /110 variables (removed 16) and now considering 226/277 (removed 51) transitions.
// Phase 1: matrix 226 rows 94 cols
[2024-06-02 21:42:12] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:42:12] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 21:42:12] [INFO ] Invariant cache hit.
[2024-06-02 21:42:13] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:42:13] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 21:42:13] [INFO ] Invariant cache hit.
[2024-06-02 21:42:13] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:42:15] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:42:15] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:42:15] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:42:16] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:42:16] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:42:18] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:42:18] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/320 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 108/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 229 constraints, problems are : Problem set: 0 solved, 225 unsolved in 13960 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/320 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 108/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 225/454 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 454 constraints, problems are : Problem set: 0 solved, 225 unsolved in 16782 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 7/7 constraints]
After SMT, in 31024ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 31030ms
Starting structural reductions in LTL mode, iteration 1 : 94/110 places, 226/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31587 ms. Remains : 94/110 places, 226/277 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-13
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-13 finished in 31870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 96 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 96 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 92 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 92 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 91 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 91 transition count 215
Applied a total of 35 rules in 6 ms. Remains 91 /110 variables (removed 19) and now considering 215/277 (removed 62) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 21:42:44] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:42:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 21:42:44] [INFO ] Invariant cache hit.
[2024-06-02 21:42:44] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 21:42:44] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 21:42:44] [INFO ] Invariant cache hit.
[2024-06-02 21:42:44] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:42:47] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:42:47] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9925 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 432 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12242 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 22430ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 22434ms
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 215/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22748 ms. Remains : 91/110 places, 215/277 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-14
Product exploration explored 100000 steps with 7830 reset in 481 ms.
Product exploration explored 100000 steps with 7844 reset in 406 ms.
Computed a total of 12 stabilizing places and 92 stable transitions
Graph (complete) has 523 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3132 resets) in 648 ms. (61 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (605 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (544 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (96 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
[2024-06-02 21:43:09] [INFO ] Invariant cache hit.
[2024-06-02 21:43:09] [INFO ] State equation strengthened by 105 read => feed constraints.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/306 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 216 constraints, problems are : Problem set: 0 solved, 3 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/306 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 219 constraints, problems are : Problem set: 0 solved, 3 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1035ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 112 ms.
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 215/215 transitions.
Graph (complete) has 405 edges and 91 vertex of which 90 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
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 223
Free-agglomeration rule (complex) applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 48 place count 85 transition count 370
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 87 place count 68 transition count 348
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 68 transition count 348
Applied a total of 88 rules in 45 ms. Remains 68 /91 variables (removed 23) and now considering 348/215 (removed -133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 68/91 places, 348/215 transitions.
RANDOM walk for 40000 steps (4949 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (61 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1096508 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :0 out of 1
Probabilistic random walk after 1096508 steps, saw 204255 distinct states, run finished after 3006 ms. (steps per millisecond=364 ) properties seen :0
// Phase 1: matrix 348 rows 68 cols
[2024-06-02 21:43:13] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:43:13] [INFO ] State equation strengthened by 171 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 68/68 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-06-02 21:43:14] [INFO ] Invariant cache hit.
[2024-06-02 21:43:14] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 21:43:14] [INFO ] Invariant cache hit.
[2024-06-02 21:43:14] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 21:43:14] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-06-02 21:43:14] [INFO ] Redundant transitions in 11 ms returned []
Running 344 sub problems to find dead transitions.
[2024-06-02 21:43:14] [INFO ] Invariant cache hit.
[2024-06-02 21:43:14] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 21:43:17] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 3 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-02 21:43:18] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:43:19] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 348/416 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 171/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 267 constraints, problems are : Problem set: 0 solved, 344 unsolved in 17645 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 21:43:35] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 348/416 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 171/268 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 344/612 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 21:43:46] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-06-02 21:43:47] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 614 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 11/11 constraints]
After SMT, in 48493ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 48501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49122 ms. Remains : 68/68 places, 348/348 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 403 edges and 68 vertex of which 60 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 60 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 60 transition count 289
Free-agglomeration rule (complex) applied 2 times with reduction of 30 identical transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 60 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 58 transition count 315
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 58 transition count 315
Applied a total of 69 rules in 31 ms. Remains 58 /68 variables (removed 10) and now considering 315/348 (removed 33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 315 rows 58 cols
[2024-06-02 21:44:03] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:44:03] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:44:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 21:44:03] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 21:44:03] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:44:03] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:44:03] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 294 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 253 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 215/215 transitions.
Applied a total of 0 rules in 0 ms. Remains 91 /91 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 21:44:04] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:44:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:44:04] [INFO ] Invariant cache hit.
[2024-06-02 21:44:04] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 21:44:04] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 21:44:04] [INFO ] Invariant cache hit.
[2024-06-02 21:44:04] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:44:07] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-02 21:44:07] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8474 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 432 constraints, problems are : Problem set: 0 solved, 214 unsolved in 13330 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 22088ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 22092ms
Finished structural reductions in LTL mode , in 1 iterations and 22433 ms. Remains : 91/91 places, 215/215 transitions.
Computed a total of 12 stabilizing places and 92 stable transitions
Graph (complete) has 523 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 12 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3146 resets) in 203 ms. (196 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (601 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (542 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (72 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
[2024-06-02 21:44:27] [INFO ] Invariant cache hit.
[2024-06-02 21:44:27] [INFO ] State equation strengthened by 105 read => feed constraints.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/306 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 216 constraints, problems are : Problem set: 0 solved, 3 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/306 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 219 constraints, problems are : Problem set: 0 solved, 3 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1061ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 302 ms.
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 215/215 transitions.
Graph (complete) has 405 edges and 91 vertex of which 90 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
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 223
Free-agglomeration rule (complex) applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 48 place count 85 transition count 370
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 87 place count 68 transition count 348
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 68 transition count 348
Applied a total of 88 rules in 59 ms. Remains 68 /91 variables (removed 23) and now considering 348/215 (removed -133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 68/91 places, 348/215 transitions.
RANDOM walk for 40000 steps (4997 resets) in 540 ms. (73 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (49 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
// Phase 1: matrix 348 rows 68 cols
[2024-06-02 21:44:28] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:44:28] [INFO ] State equation strengthened by 171 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 602ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 68/68 places, 348/348 transitions.
RANDOM walk for 40000 steps (4978 resets) in 325 ms. (122 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1208905 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :0 out of 1
Probabilistic random walk after 1208905 steps, saw 227558 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :0
[2024-06-02 21:44:32] [INFO ] Invariant cache hit.
[2024-06-02 21:44:32] [INFO ] State equation strengthened by 171 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 470ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 68/68 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-06-02 21:44:33] [INFO ] Invariant cache hit.
[2024-06-02 21:44:33] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 21:44:33] [INFO ] Invariant cache hit.
[2024-06-02 21:44:33] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 21:44:33] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-06-02 21:44:33] [INFO ] Redundant transitions in 6 ms returned []
Running 344 sub problems to find dead transitions.
[2024-06-02 21:44:33] [INFO ] Invariant cache hit.
[2024-06-02 21:44:33] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 21:44:36] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:44:36] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:44:36] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:44:36] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:44:36] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:44:36] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:44:36] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:44:37] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 348/416 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 171/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 267 constraints, problems are : Problem set: 0 solved, 344 unsolved in 18413 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 21:44:54] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 348/416 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 171/268 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 344/612 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 21:45:06] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:45:07] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 614 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 11/11 constraints]
After SMT, in 49113ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 49117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49606 ms. Remains : 68/68 places, 348/348 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 403 edges and 68 vertex of which 60 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 60 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 60 transition count 289
Free-agglomeration rule (complex) applied 2 times with reduction of 30 identical transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 60 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 58 transition count 315
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 58 transition count 315
Applied a total of 69 rules in 27 ms. Remains 58 /68 variables (removed 10) and now considering 315/348 (removed 33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 315 rows 58 cols
[2024-06-02 21:45:22] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:45:22] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:45:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 21:45:22] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 21:45:22] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:45:22] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:45:22] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 86957 steps with 6805 reset in 232 ms.
FORMULA MedleyA-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-14 finished in 159704 ms.
All properties solved by simple procedures.
Total runtime 410797 ms.

BK_STOP 1717364724338

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-11, 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 r576-smll-171734920000084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-11.tgz
mv MedleyA-PT-11 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;