Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446600218.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446600218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K May 18 16:43 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 PolyORBLF-PT-S02J04T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717251965826

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:26:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:26:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:26:07] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-06-01 14:26:07] [INFO ] Transformed 476 places.
[2024-06-01 14:26:07] [INFO ] Transformed 920 transitions.
[2024-06-01 14:26:07] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
[2024-06-01 14:26:07] [INFO ] Reduced 66 identical enabling conditions.
[2024-06-01 14:26:07] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 14:26:07] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 14:26:07] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 14:26:07] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 14:26:07] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 381 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Applied a total of 14 rules in 57 ms. Remains 468 /476 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 14:26:07] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 468 cols
[2024-06-01 14:26:07] [INFO ] Computed 44 invariants in 58 ms
[2024-06-01 14:26:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:26:14] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 18 ms to minimize.
[2024-06-01 14:26:14] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:26:14] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 40 ms to minimize.
[2024-06-01 14:26:15] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:26:15] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:26:15] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:26:15] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:26:16] [INFO ] Deduced a trap composed of 127 places in 225 ms of which 4 ms to minimize.
[2024-06-01 14:26:16] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-06-01 14:26:16] [INFO ] Deduced a trap composed of 235 places in 228 ms of which 4 ms to minimize.
[2024-06-01 14:26:16] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 4 ms to minimize.
[2024-06-01 14:26:16] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:26:17] [INFO ] Deduced a trap composed of 223 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:26:19] [INFO ] Deduced a trap composed of 228 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:26:20] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 4 ms to minimize.
[2024-06-01 14:26:20] [INFO ] Deduced a trap composed of 249 places in 217 ms of which 4 ms to minimize.
[2024-06-01 14:26:21] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:26:21] [INFO ] Deduced a trap composed of 294 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1274 variables, and 59 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20087 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:26:37] [INFO ] Deduced a trap composed of 252 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:26:38] [INFO ] Deduced a trap composed of 214 places in 262 ms of which 4 ms to minimize.
[2024-06-01 14:26:42] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:26:46] [INFO ] Deduced a trap composed of 312 places in 177 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1274 variables, and 63 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 22/22 constraints]
After SMT, in 41064ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41105ms
[2024-06-01 14:26:48] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 14:26:48] [INFO ] Invariant cache hit.
[2024-06-01 14:26:48] [INFO ] Implicit Places using invariants in 116 ms returned [112, 238, 275, 278, 416, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 123 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/476 places, 818/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41338 ms. Remains : 462/476 places, 818/824 transitions.
Support contains 381 out of 462 places after structural reductions.
[2024-06-01 14:26:49] [INFO ] Flatten gal took : 99 ms
[2024-06-01 14:26:49] [INFO ] Flatten gal took : 86 ms
[2024-06-01 14:26:49] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 40001 steps (13 resets) in 1822 ms. (21 steps per ms) remains 14/68 properties
BEST_FIRST walk for 40002 steps (9 resets) in 602 ms. (66 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (10 resets) in 758 ms. (52 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 528 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (22 resets) in 762 ms. (52 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 332 ms. (120 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (9 resets) in 324 ms. (123 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 397 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (11 resets) in 320 ms. (124 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 359 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (10 resets) in 314 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (10 resets) in 307 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 307 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 353 ms. (113 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 301 ms. (132 steps per ms) remains 14/14 properties
[2024-06-01 14:26:52] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-06-01 14:26:52] [INFO ] Computed 38 invariants in 12 ms
[2024-06-01 14:26:52] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp48 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 85/203 variables, 7/9 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 4/207 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 7 (OVERLAPS) 242/449 variables, 17/29 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/29 constraints. Problems are: Problem set: 11 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/451 variables, 2/31 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/460 variables, 6/37 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/37 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 806/1266 variables, 460/497 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1266 variables, 72/569 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1266 variables, 0/569 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1268 variables, 2/571 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1268 variables, 1/572 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 11 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1268/1268 variables, and 572 constraints, problems are : Problem set: 11 solved, 3 unsolved in 2225 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 462/462 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 309/317 variables, 5/5 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 47/364 variables, 11/16 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/16 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 93/457 variables, 18/34 constraints. Problems are: Problem set: 11 solved, 3 unsolved
[2024-06-01 14:26:55] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:26:55] [INFO ] Deduced a trap composed of 65 places in 318 ms of which 1 ms to minimize.
[2024-06-01 14:26:55] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 3/37 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/37 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/459 variables, 2/39 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/39 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/460 variables, 1/40 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/40 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 806/1266 variables, 460/500 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1266 variables, 72/572 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1266 variables, 3/575 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1266 variables, 0/575 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1268 variables, 2/577 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1268 variables, 1/578 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1268 variables, 0/578 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1268 variables, 0/578 constraints. Problems are: Problem set: 11 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1268/1268 variables, and 578 constraints, problems are : Problem set: 11 solved, 3 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 462/462 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/14 constraints, Known Traps: 3/3 constraints]
After SMT, in 7412ms problems are : Problem set: 11 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 462 transition count 788
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 432 transition count 782
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 426 transition count 782
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 72 place count 426 transition count 734
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 168 place count 378 transition count 734
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 276 place count 324 transition count 680
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 280 place count 320 transition count 676
Iterating global reduction 3 with 4 rules applied. Total rules applied 284 place count 320 transition count 676
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 296 place count 320 transition count 664
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 308 place count 308 transition count 664
Applied a total of 308 rules in 219 ms. Remains 308 /462 variables (removed 154) and now considering 664/818 (removed 154) transitions.
Running 662 sub problems to find dead transitions.
[2024-06-01 14:26:59] [INFO ] Flow matrix only has 652 transitions (discarded 12 similar events)
// Phase 1: matrix 652 rows 308 cols
[2024-06-01 14:27:00] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 14:27:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-06-01 14:27:03] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:27:03] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:27:04] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:27:04] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:27:04] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:27:04] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:27:04] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 6 ms to minimize.
[2024-06-01 14:27:04] [INFO ] Deduced a trap composed of 102 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:27:05] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:27:05] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 9 ms to minimize.
[2024-06-01 14:27:06] [INFO ] Deduced a trap composed of 110 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:27:07] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 4 ms to minimize.
[2024-06-01 14:27:07] [INFO ] Deduced a trap composed of 172 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:27:08] [INFO ] Deduced a trap composed of 122 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:27:08] [INFO ] Deduced a trap composed of 100 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:27:09] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/308 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 596 unsolved
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 101 places in 192 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/960 variables, and 57 constraints, problems are : Problem set: 66 solved, 596 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 66 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 17/17 constraints. Problems are: Problem set: 66 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 19/36 constraints. Problems are: Problem set: 66 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 16/52 constraints. Problems are: Problem set: 66 solved, 596 unsolved
[2024-06-01 14:27:26] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 596 unsolved
[2024-06-01 14:27:33] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 1/54 constraints. Problems are: Problem set: 66 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/960 variables, and 54 constraints, problems are : Problem set: 66 solved, 596 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/662 constraints, Known Traps: 18/21 constraints]
After SMT, in 40961ms problems are : Problem set: 66 solved, 596 unsolved
Search for dead transitions found 66 dead transitions in 40970ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 308/462 places, 598/818 transitions.
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 296 transition count 574
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 12 rules in 25 ms. Remains 296 /308 variables (removed 12) and now considering 574/598 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41218 ms. Remains : 296/462 places, 574/818 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S02J04T06-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:27:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:27:41] [INFO ] Flatten gal took : 87 ms
FORMULA PolyORBLF-PT-S02J04T06-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:27:41] [INFO ] Flatten gal took : 64 ms
[2024-06-01 14:27:41] [INFO ] Input system was already deterministic with 818 transitions.
Support contains 349 out of 462 places (down from 351) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 23 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:27:41] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 14:27:41] [INFO ] Computed 38 invariants in 17 ms
[2024-06-01 14:27:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:27:47] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:27:48] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:27:48] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:27:48] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:27:48] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 2 ms to minimize.
[2024-06-01 14:27:48] [INFO ] Deduced a trap composed of 127 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:27:49] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:27:49] [INFO ] Deduced a trap composed of 237 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:27:49] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:27:49] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:27:49] [INFO ] Deduced a trap composed of 222 places in 222 ms of which 8 ms to minimize.
[2024-06-01 14:27:52] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 6 ms to minimize.
[2024-06-01 14:27:52] [INFO ] Deduced a trap composed of 244 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:27:52] [INFO ] Deduced a trap composed of 219 places in 198 ms of which 4 ms to minimize.
[2024-06-01 14:27:53] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:27:55] [INFO ] Deduced a trap composed of 298 places in 232 ms of which 4 ms to minimize.
[2024-06-01 14:27:57] [INFO ] Deduced a trap composed of 86 places in 246 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 253 places in 212 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:28:17] [INFO ] Deduced a trap composed of 244 places in 186 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints]
After SMT, in 40968ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40980ms
Finished structural reductions in LTL mode , in 1 iterations and 41007 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:28:22] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:28:22] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:28:22] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 16 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:28:22] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:28:22] [INFO ] Invariant cache hit.
[2024-06-01 14:28:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:28:27] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:28:28] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 4 ms to minimize.
[2024-06-01 14:28:28] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 8 ms to minimize.
[2024-06-01 14:28:28] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:28:29] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:28:29] [INFO ] Deduced a trap composed of 124 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:28:29] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:28:30] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:28:30] [INFO ] Deduced a trap composed of 225 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:28:30] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:28:31] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:28:32] [INFO ] Deduced a trap composed of 222 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:28:33] [INFO ] Deduced a trap composed of 217 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:28:34] [INFO ] Deduced a trap composed of 244 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:28:34] [INFO ] Deduced a trap composed of 263 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:28:34] [INFO ] Deduced a trap composed of 266 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:28:36] [INFO ] Deduced a trap composed of 306 places in 268 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:28:41] [INFO ] Deduced a trap composed of 227 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:28:43] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:29:02] [INFO ] Deduced a trap composed of 253 places in 257 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 40759ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40770ms
Finished structural reductions in LTL mode , in 1 iterations and 40789 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:29:03] [INFO ] Flatten gal took : 80 ms
[2024-06-01 14:29:03] [INFO ] Flatten gal took : 68 ms
[2024-06-01 14:29:03] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 27 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:29:03] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:29:03] [INFO ] Invariant cache hit.
[2024-06-01 14:29:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:29:08] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 5 ms to minimize.
[2024-06-01 14:29:09] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:29:09] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:29:09] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:29:09] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:29:09] [INFO ] Deduced a trap composed of 124 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:29:10] [INFO ] Deduced a trap composed of 64 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:29:10] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:29:10] [INFO ] Deduced a trap composed of 225 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:29:10] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:29:11] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:29:12] [INFO ] Deduced a trap composed of 222 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:29:13] [INFO ] Deduced a trap composed of 217 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:29:13] [INFO ] Deduced a trap composed of 244 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:29:13] [INFO ] Deduced a trap composed of 263 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:29:13] [INFO ] Deduced a trap composed of 266 places in 192 ms of which 5 ms to minimize.
[2024-06-01 14:29:15] [INFO ] Deduced a trap composed of 306 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:29:20] [INFO ] Deduced a trap composed of 227 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:29:21] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:29:42] [INFO ] Deduced a trap composed of 253 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 40775ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40785ms
Finished structural reductions in LTL mode , in 1 iterations and 40816 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:29:44] [INFO ] Flatten gal took : 47 ms
[2024-06-01 14:29:44] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:29:44] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 12 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:29:44] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:29:44] [INFO ] Invariant cache hit.
[2024-06-01 14:29:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:29:50] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:29:50] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:29:51] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:29:51] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:29:51] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:29:51] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:29:52] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:29:52] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:29:52] [INFO ] Deduced a trap composed of 225 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:29:52] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:29:53] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:29:54] [INFO ] Deduced a trap composed of 222 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:29:55] [INFO ] Deduced a trap composed of 217 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:29:55] [INFO ] Deduced a trap composed of 244 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:29:55] [INFO ] Deduced a trap composed of 263 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:29:56] [INFO ] Deduced a trap composed of 266 places in 223 ms of which 4 ms to minimize.
[2024-06-01 14:29:58] [INFO ] Deduced a trap composed of 306 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:30:03] [INFO ] Deduced a trap composed of 227 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:30:04] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 10.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:30:24] [INFO ] Deduced a trap composed of 253 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 40896ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40907ms
Finished structural reductions in LTL mode , in 1 iterations and 40921 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:30:25] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:30:25] [INFO ] Flatten gal took : 40 ms
[2024-06-01 14:30:25] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 8 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:30:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:30:25] [INFO ] Invariant cache hit.
[2024-06-01 14:30:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 21 ms to minimize.
[2024-06-01 14:30:32] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:30:32] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:30:32] [INFO ] Deduced a trap composed of 124 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:30:32] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:30:32] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:30:33] [INFO ] Deduced a trap composed of 225 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:30:33] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:30:34] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:30:34] [INFO ] Deduced a trap composed of 222 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:30:35] [INFO ] Deduced a trap composed of 217 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:30:36] [INFO ] Deduced a trap composed of 244 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:30:36] [INFO ] Deduced a trap composed of 263 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:30:36] [INFO ] Deduced a trap composed of 266 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:30:38] [INFO ] Deduced a trap composed of 306 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:30:43] [INFO ] Deduced a trap composed of 227 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:30:44] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:31:05] [INFO ] Deduced a trap composed of 253 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 40800ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40821ms
Finished structural reductions in LTL mode , in 1 iterations and 40832 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:31:06] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:31:06] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:31:06] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 22 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:31:06] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:31:06] [INFO ] Invariant cache hit.
[2024-06-01 14:31:06] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 124 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 225 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:31:14] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:31:14] [INFO ] Deduced a trap composed of 222 places in 185 ms of which 7 ms to minimize.
[2024-06-01 14:31:15] [INFO ] Deduced a trap composed of 217 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:31:16] [INFO ] Deduced a trap composed of 244 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:31:16] [INFO ] Deduced a trap composed of 263 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:31:16] [INFO ] Deduced a trap composed of 266 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:31:19] [INFO ] Deduced a trap composed of 306 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:31:23] [INFO ] Deduced a trap composed of 227 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:31:25] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:31:46] [INFO ] Deduced a trap composed of 253 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 40626ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40635ms
Finished structural reductions in LTL mode , in 1 iterations and 40662 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:31:47] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:31:47] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:31:47] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Applied a total of 0 rules in 5 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 14:31:47] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-06-01 14:31:47] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 14:31:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:31:52] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:31:52] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:31:53] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:31:53] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:31:53] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:31:53] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:31:53] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:31:53] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:31:54] [INFO ] Deduced a trap composed of 243 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:31:54] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:31:54] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:31:54] [INFO ] Deduced a trap composed of 223 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:31:56] [INFO ] Deduced a trap composed of 234 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:31:56] [INFO ] Deduced a trap composed of 225 places in 161 ms of which 3 ms to minimize.
[2024-06-01 14:31:57] [INFO ] Deduced a trap composed of 241 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:31:57] [INFO ] Deduced a trap composed of 312 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:31:57] [INFO ] Deduced a trap composed of 222 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:31:57] [INFO ] Deduced a trap composed of 233 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:31:58] [INFO ] Deduced a trap composed of 228 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:31:58] [INFO ] Deduced a trap composed of 239 places in 164 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 290 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:32:02] [INFO ] Deduced a trap composed of 304 places in 159 ms of which 3 ms to minimize.
(s294 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 (/ 39.0 4.0))
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 (/ 3.0 4.0))
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 (/ 1.0 4.0))
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 (/ 3.0 4.0))
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 58 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 14:32:27] [INFO ] Deduced a trap composed of 259 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 134 places in 191 ms of which 2 ms to minimize.
SMT process timed out in 40898ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40908ms
Finished structural reductions in LTL mode , in 1 iterations and 40931 ms. Remains : 462/462 places, 818/818 transitions.
[2024-06-01 14:32:28] [INFO ] Flatten gal took : 21 ms
[2024-06-01 14:32:28] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:32:28] [INFO ] Input system was already deterministic with 818 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 84 place count 420 transition count 729
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 178 place count 373 transition count 729
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 286 place count 319 transition count 675
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 290 place count 315 transition count 671
Iterating global reduction 2 with 4 rules applied. Total rules applied 294 place count 315 transition count 671
Applied a total of 294 rules in 42 ms. Remains 315 /462 variables (removed 147) and now considering 671/818 (removed 147) transitions.
Running 669 sub problems to find dead transitions.
[2024-06-01 14:32:28] [INFO ] Flow matrix only has 659 transitions (discarded 12 similar events)
// Phase 1: matrix 659 rows 315 cols
[2024-06-01 14:32:28] [INFO ] Computed 38 invariants in 9 ms
[2024-06-01 14:32:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 0 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:32:34] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-01 14:32:40] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-01 14:32:45] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/974 variables, and 44 constraints, problems are : Problem set: 0 solved, 669 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/22 constraints, State Equation: 0/315 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-01 14:32:50] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:32:50] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:32:50] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:32:51] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:32:52] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/315 variables, 3/52 constraints. Problems are: Problem set: 66 solved, 603 unsolved
[2024-06-01 14:33:03] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:33:04] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 1 ms to minimize.
[2024-06-01 14:33:04] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:33:06] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:33:06] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 1 ms to minimize.
[2024-06-01 14:33:06] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:33:06] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:33:07] [INFO ] Deduced a trap composed of 162 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/974 variables, and 62 constraints, problems are : Problem set: 66 solved, 603 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/315 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/669 constraints, Known Traps: 24/24 constraints]
After SMT, in 40623ms problems are : Problem set: 66 solved, 603 unsolved
Search for dead transitions found 66 dead transitions in 40630ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 315/462 places, 605/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 301 transition count 581
Applied a total of 12 rules in 19 ms. Remains 301 /315 variables (removed 14) and now considering 581/605 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 40693 ms. Remains : 301/462 places, 581/818 transitions.
[2024-06-01 14:33:09] [INFO ] Flatten gal took : 14 ms
[2024-06-01 14:33:09] [INFO ] Flatten gal took : 15 ms
[2024-06-01 14:33:09] [INFO ] Input system was already deterministic with 581 transitions.
RANDOM walk for 6485 steps (4 resets) in 22 ms. (281 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 462 transition count 777
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 421 transition count 776
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 292 place count 314 transition count 670
Iterating global reduction 3 with 4 rules applied. Total rules applied 296 place count 314 transition count 670
Applied a total of 296 rules in 44 ms. Remains 314 /462 variables (removed 148) and now considering 670/818 (removed 148) transitions.
Running 668 sub problems to find dead transitions.
[2024-06-01 14:33:09] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
// Phase 1: matrix 658 rows 314 cols
[2024-06-01 14:33:09] [INFO ] Computed 38 invariants in 5 ms
[2024-06-01 14:33:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:33:12] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 1 ms to minimize.
[2024-06-01 14:33:14] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:33:14] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:33:15] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:33:15] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:33:16] [INFO ] Deduced a trap composed of 114 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:33:17] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:33:17] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2024-06-01 14:33:17] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:33:19] [INFO ] Deduced a trap composed of 178 places in 111 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 3 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/972 variables, and 56 constraints, problems are : Problem set: 0 solved, 668 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/314 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/314 variables, 2/58 constraints. Problems are: Problem set: 66 solved, 602 unsolved
[2024-06-01 14:33:47] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/972 variables, and 59 constraints, problems are : Problem set: 66 solved, 602 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/314 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 21/21 constraints]
After SMT, in 40599ms problems are : Problem set: 66 solved, 602 unsolved
Search for dead transitions found 66 dead transitions in 40606ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 314/462 places, 604/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 300 transition count 580
Applied a total of 12 rules in 15 ms. Remains 300 /314 variables (removed 14) and now considering 580/604 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 40666 ms. Remains : 300/462 places, 580/818 transitions.
[2024-06-01 14:33:50] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:33:50] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:33:50] [INFO ] Input system was already deterministic with 580 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 84 place count 420 transition count 729
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 178 place count 373 transition count 729
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 286 place count 319 transition count 675
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 290 place count 315 transition count 671
Iterating global reduction 2 with 4 rules applied. Total rules applied 294 place count 315 transition count 671
Applied a total of 294 rules in 47 ms. Remains 315 /462 variables (removed 147) and now considering 671/818 (removed 147) transitions.
Running 669 sub problems to find dead transitions.
[2024-06-01 14:33:50] [INFO ] Flow matrix only has 659 transitions (discarded 12 similar events)
// Phase 1: matrix 659 rows 315 cols
[2024-06-01 14:33:50] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 14:33:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-01 14:33:54] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:33:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-06-01 14:33:55] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:33:55] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:33:55] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:33:56] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:33:57] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:33:58] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/315 variables, 3/46 constraints. Problems are: Problem set: 66 solved, 603 unsolved
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-06-01 14:34:06] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 1 ms to minimize.
[2024-06-01 14:34:08] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:34:08] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:34:09] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:34:09] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:34:09] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 13/59 constraints. Problems are: Problem set: 66 solved, 603 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 10.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 3.0)
(s232 9.0)
(s233 9.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/974 variables, and 59 constraints, problems are : Problem set: 66 solved, 603 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/315 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 66 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 66 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 20/35 constraints. Problems are: Problem set: 66 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 16/51 constraints. Problems are: Problem set: 66 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/51 constraints. Problems are: Problem set: 66 solved, 603 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 3/54 constraints. Problems are: Problem set: 66 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 5/59 constraints. Problems are: Problem set: 66 solved, 603 unsolved
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 4 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 2/61 constraints. Problems are: Problem set: 66 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/974 variables, and 61 constraints, problems are : Problem set: 66 solved, 603 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/315 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/669 constraints, Known Traps: 23/23 constraints]
After SMT, in 40750ms problems are : Problem set: 66 solved, 603 unsolved
Search for dead transitions found 66 dead transitions in 40758ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 315/462 places, 605/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 301 transition count 581
Applied a total of 12 rules in 24 ms. Remains 301 /315 variables (removed 14) and now considering 581/605 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 40830 ms. Remains : 301/462 places, 581/818 transitions.
[2024-06-01 14:34:31] [INFO ] Flatten gal took : 16 ms
[2024-06-01 14:34:31] [INFO ] Flatten gal took : 18 ms
[2024-06-01 14:34:31] [INFO ] Input system was already deterministic with 581 transitions.
RANDOM walk for 6335 steps (4 resets) in 25 ms. (243 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T06-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 292 place count 314 transition count 670
Iterating global reduction 2 with 4 rules applied. Total rules applied 296 place count 314 transition count 670
Applied a total of 296 rules in 58 ms. Remains 314 /462 variables (removed 148) and now considering 670/818 (removed 148) transitions.
Running 668 sub problems to find dead transitions.
[2024-06-01 14:34:31] [INFO ] Flow matrix only has 658 transitions (discarded 12 similar events)
// Phase 1: matrix 658 rows 314 cols
[2024-06-01 14:34:31] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 14:34:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:34:36] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:34:36] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:34:36] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:34:36] [INFO ] Deduced a trap composed of 174 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:34:38] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:34:39] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 1 ms to minimize.
[2024-06-01 14:34:39] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 1 ms to minimize.
[2024-06-01 14:34:39] [INFO ] Deduced a trap composed of 129 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:34:40] [INFO ] Deduced a trap composed of 127 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:34:40] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:34:42] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:34:42] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:34:48] [INFO ] Deduced a trap composed of 178 places in 123 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/972 variables, and 56 constraints, problems are : Problem set: 0 solved, 668 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/314 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/972 variables, and 57 constraints, problems are : Problem set: 0 solved, 668 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/314 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 21/21 constraints]
After SMT, in 40828ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 40834ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40894 ms. Remains : 314/462 places, 670/818 transitions.
[2024-06-01 14:35:12] [INFO ] Flatten gal took : 18 ms
[2024-06-01 14:35:12] [INFO ] Flatten gal took : 18 ms
[2024-06-01 14:35:12] [INFO ] Input system was already deterministic with 670 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 9 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:35:12] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 14:35:12] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:35:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 237 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 222 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:35:20] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:35:20] [INFO ] Deduced a trap composed of 244 places in 150 ms of which 3 ms to minimize.
[2024-06-01 14:35:21] [INFO ] Deduced a trap composed of 219 places in 151 ms of which 3 ms to minimize.
[2024-06-01 14:35:21] [INFO ] Deduced a trap composed of 228 places in 145 ms of which 3 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 298 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:35:24] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 253 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:35:49] [INFO ] Deduced a trap composed of 244 places in 188 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints]
After SMT, in 40695ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40702ms
Finished structural reductions in LTL mode , in 1 iterations and 40713 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:35:52] [INFO ] Flatten gal took : 19 ms
[2024-06-01 14:35:52] [INFO ] Flatten gal took : 20 ms
[2024-06-01 14:35:53] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 8 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:35:53] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:35:53] [INFO ] Invariant cache hit.
[2024-06-01 14:35:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:35:58] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:35:58] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:35:58] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:35:58] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:35:58] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:35:58] [INFO ] Deduced a trap composed of 124 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:35:59] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:35:59] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:35:59] [INFO ] Deduced a trap composed of 225 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:35:59] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:36:00] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:36:00] [INFO ] Deduced a trap composed of 222 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:36:01] [INFO ] Deduced a trap composed of 217 places in 157 ms of which 3 ms to minimize.
[2024-06-01 14:36:02] [INFO ] Deduced a trap composed of 244 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:36:02] [INFO ] Deduced a trap composed of 263 places in 159 ms of which 3 ms to minimize.
[2024-06-01 14:36:02] [INFO ] Deduced a trap composed of 266 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:36:04] [INFO ] Deduced a trap composed of 306 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:36:09] [INFO ] Deduced a trap composed of 227 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:36:10] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:36:31] [INFO ] Deduced a trap composed of 253 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 40652ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40659ms
Finished structural reductions in LTL mode , in 1 iterations and 40669 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:36:33] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:36:33] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:36:33] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 8 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:36:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 14:36:33] [INFO ] Invariant cache hit.
[2024-06-01 14:36:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 124 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:36:40] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:36:40] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:36:40] [INFO ] Deduced a trap composed of 225 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:36:40] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 222 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 217 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 244 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 263 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 266 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:36:46] [INFO ] Deduced a trap composed of 306 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 227 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:36:52] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:37:12] [INFO ] Deduced a trap composed of 253 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 20/20 constraints]
After SMT, in 40616ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40623ms
Finished structural reductions in LTL mode , in 1 iterations and 40632 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 14:37:14] [INFO ] Flatten gal took : 20 ms
[2024-06-01 14:37:14] [INFO ] Flatten gal took : 22 ms
[2024-06-01 14:37:14] [INFO ] Input system was already deterministic with 812 transitions.
[2024-06-01 14:37:14] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:37:14] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:37:14] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 33 ms.
[2024-06-01 14:37:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 462 places, 818 transitions and 3532 arcs took 5 ms.
Total runtime 667622 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-CTLFireability-2024-15

BK_STOP 1717252635055

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1678/ctl_0_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1678/ctl_1_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1678/ctl_2_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1678/ctl_3_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1678/ctl_4_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1678/ctl_5_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1678/ctl_6_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1678/ctl_7_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1678/ctl_8_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1678/ctl_9_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1678/ctl_10_
ctl formula name PolyORBLF-PT-S02J04T06-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1678/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S02J04T06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446600218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;