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-171654446400106.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-COL-S02J06T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 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 4.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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-COL-S02J06T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717249025493

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:37:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:37:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:37:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:37:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:37:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 719 ms
[2024-06-01 13:37:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2024-06-01 13:37:07] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:37:07] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 58 to 55
RANDOM walk for 40000 steps (18 resets) in 1776 ms. (22 steps per ms) remains 13/55 properties
BEST_FIRST walk for 40001 steps (18 resets) in 281 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (13 resets) in 215 ms. (185 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (12 resets) in 250 ms. (159 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (13 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (10 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (10 resets) in 254 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (67 resets) in 282 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (10 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (13 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (11 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (31 resets) in 284 ms. (140 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (11 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (14 resets) in 210 ms. (189 steps per ms) remains 13/13 properties
[2024-06-01 13:37:09] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:37:09] [INFO ] Computed 26 invariants in 7 ms
[2024-06-01 13:37:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 2 (OVERLAPS) 24/59 variables, 7/9 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/63 variables, 3/14 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/15 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 8 (OVERLAPS) 16/79 variables, 10/25 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 2 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 2/27 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/80 variables, 1/28 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/28 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/81 variables, 1/29 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 0/29 constraints. Problems are: Problem set: 9 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 64/145 variables, 81/110 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 8/118 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 118 constraints, problems are : Problem set: 9 solved, 4 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 1/27 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/79 variables, 1/28 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 0/28 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 64/143 variables, 79/107 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 8/115 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 4/119 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/143 variables, 0/119 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/145 variables, 2/121 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 1/122 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/145 variables, 0/122 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/145 variables, 0/122 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 122 constraints, problems are : Problem set: 9 solved, 4 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 1032ms problems are : Problem set: 9 solved, 4 unsolved
Parikh walk visited 0 properties in 2086 ms.
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 52 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-06-01 13:37:12] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-06-01 13:37:12] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 13:37:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 13:37:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/93 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 103 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1395 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 5/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 5/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 150 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 15/15 constraints]
After SMT, in 2772ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 2773ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 0 places and 2 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2852 ms. Remains : 60/81 places, 39/65 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 14 atomic propositions for a total of 13 simplifications.
[2024-06-01 13:37:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 13:37:15] [INFO ] Flatten gal took : 34 ms
FORMULA PolyORBLF-COL-S02J06T08-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:37:15] [INFO ] Flatten gal took : 10 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:37:15] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 41 ms.
[2024-06-01 13:37:15] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2024-06-01 13:37:15] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 13:37:15] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 13:37:15] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 13:37:15] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 13:37:15] [INFO ] Reduced 32 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 636 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 14 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2024-06-01 13:37:15] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-06-01 13:37:15] [INFO ] Computed 54 invariants in 71 ms
[2024-06-01 13:37:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 4 ms to minimize.
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 3 ms to minimize.
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:37:30] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:37:30] [INFO ] Deduced a trap composed of 370 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:37:31] [INFO ] Deduced a trap composed of 210 places in 329 ms of which 5 ms to minimize.
[2024-06-01 13:37:31] [INFO ] Deduced a trap composed of 188 places in 284 ms of which 3 ms to minimize.
[2024-06-01 13:37:32] [INFO ] Deduced a trap composed of 353 places in 312 ms of which 5 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 373 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 453 places in 303 ms of which 5 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 361 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 65 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:37:40] [INFO ] Deduced a trap composed of 356 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 5 ms to minimize.
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 346 places in 319 ms of which 5 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 354 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 327 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 49 places in 310 ms of which 3 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 379 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 372 places in 306 ms of which 7 ms to minimize.
SMT process timed out in 42188ms, After SMT, problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 42211ms
[2024-06-01 13:37:58] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 13:37:58] [INFO ] Invariant cache hit.
[2024-06-01 13:37:58] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 13:37:58] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 13:37:58] [INFO ] Invariant cache hit.
[2024-06-01 13:37:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:38:01] [INFO ] Implicit Places using invariants and state equation in 3039 ms returned []
Implicit Place search using SMT with State Equation took 3227 ms to find 0 implicit places.
Running 1304 sub problems to find dead transitions.
[2024-06-01 13:38:01] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 13:38:01] [INFO ] Invariant cache hit.
[2024-06-01 13:38:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 5 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 361 places in 387 ms of which 5 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 340 places in 395 ms of which 5 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 206 places in 380 ms of which 4 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 382 places in 398 ms of which 6 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 378 places in 360 ms of which 4 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 372 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 387 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 379 places in 302 ms of which 5 ms to minimize.
[2024-06-01 13:38:21] [INFO ] Deduced a trap composed of 379 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 489 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 462 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 463 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:38:31] [INFO ] Deduced a trap composed of 343 places in 318 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 71 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 351 places in 374 ms of which 5 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 360 places in 326 ms of which 5 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 355 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 350 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 195 places in 345 ms of which 5 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 203 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 5 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 497 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 425 places in 319 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 83 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 33/33 constraints]
After SMT, in 61696ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 61724ms
Finished structural reductions in LTL mode , in 1 iterations and 107193 ms. Remains : 690/690 places, 1306/1306 transitions.
Support contains 636 out of 690 places after structural reductions.
[2024-06-01 13:39:03] [INFO ] Flatten gal took : 122 ms
[2024-06-01 13:39:03] [INFO ] Flatten gal took : 137 ms
[2024-06-01 13:39:03] [INFO ] Input system was already deterministic with 1306 transitions.
Reduction of identical properties reduced properties to check from 63 to 62
RANDOM walk for 40000 steps (10 resets) in 1484 ms. (26 steps per ms) remains 15/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 103 ms. (38 steps per ms) remains 15/15 properties
[2024-06-01 13:39:04] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 13:39:04] [INFO ] Invariant cache hit.
[2024-06-01 13:39:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 2 (OVERLAPS) 138/461 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 14/475 variables, 7/17 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 7 (OVERLAPS) 195/670 variables, 26/43 constraints. Problems are: Problem set: 11 solved, 4 unsolved
[2024-06-01 13:39:06] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:39:06] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:39:06] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:39:06] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 8/51 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 0/51 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/680 variables, 2/53 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/680 variables, 0/53 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/688 variables, 8/61 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1290/1978 variables, 688/749 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1978 variables, 96/845 constraints. Problems are: Problem set: 11 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1978/1980 variables, and 845 constraints, problems are : Problem set: 11 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 688/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 11 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 198/224 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/3 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 42/266 variables, 2/5 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/280 variables, 7/12 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/12 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 385/665 variables, 26/38 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 8/46 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/665 variables, 0/46 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/677 variables, 4/50 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/677 variables, 0/50 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 11/688 variables, 11/61 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/688 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1290/1978 variables, 688/749 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1978 variables, 96/845 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1978 variables, 4/849 constraints. Problems are: Problem set: 11 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1978/1980 variables, and 849 constraints, problems are : Problem set: 11 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 688/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/15 constraints, Known Traps: 8/8 constraints]
After SMT, in 10309ms problems are : Problem set: 11 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1210 ms.
Support contains 26 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 688 transition count 1250
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 122 place count 632 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 130 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 290 place count 544 transition count 1162
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 418 place count 480 transition count 1098
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 434 place count 480 transition count 1082
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 450 place count 464 transition count 1082
Applied a total of 450 rules in 173 ms. Remains 464 /690 variables (removed 226) and now considering 1082/1306 (removed 224) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 13:39:16] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 464 cols
[2024-06-01 13:39:16] [INFO ] Computed 52 invariants in 37 ms
[2024-06-01 13:39:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:39:25] [INFO ] Deduced a trap composed of 168 places in 318 ms of which 3 ms to minimize.
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 158 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 276 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 150 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 137 places in 291 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 167 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:39:44] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1530 variables, and 67 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 17/17 constraints]
After SMT, in 41916ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41931ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42108 ms. Remains : 464/690 places, 1082/1306 transitions.
RANDOM walk for 40000 steps (20 resets) in 636 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 134952 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 4
Probabilistic random walk after 134952 steps, saw 82638 distinct states, run finished after 3010 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 13:40:01] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:40:01] [INFO ] Invariant cache hit.
[2024-06-01 13:40:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/209 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/223 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 216/439 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/442 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 19/461 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/462 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1066/1528 variables, 462/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1528 variables, 96/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1528 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/1530 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1530 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1530 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1530 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 619 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3514 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/209 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/223 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 216/439 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 178 places in 252 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/442 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 19/461 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/462 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1066/1528 variables, 462/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1528 variables, 96/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1528 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1528 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/1530 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1530 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1530 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1530 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 625 constraints, problems are : Problem set: 0 solved, 4 unsolved in 16223 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 464/464 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 19755ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 11783 ms.
Support contains 26 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 26 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 464/464 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 23 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2024-06-01 13:40:33] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:40:33] [INFO ] Invariant cache hit.
[2024-06-01 13:40:33] [INFO ] Implicit Places using invariants in 337 ms returned [418, 419, 420, 421, 422, 423, 424, 425]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 343 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 456/464 places, 1082/1082 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 1074
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 1074
Applied a total of 16 rules in 39 ms. Remains 448 /456 variables (removed 8) and now considering 1074/1082 (removed 8) transitions.
[2024-06-01 13:40:33] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2024-06-01 13:40:33] [INFO ] Computed 44 invariants in 23 ms
[2024-06-01 13:40:34] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-06-01 13:40:34] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:40:34] [INFO ] Invariant cache hit.
[2024-06-01 13:40:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:40:41] [INFO ] Implicit Places using invariants and state equation in 7067 ms returned []
Implicit Place search using SMT with State Equation took 7419 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 448/464 places, 1074/1082 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7825 ms. Remains : 448/464 places, 1074/1082 transitions.
RANDOM walk for 40000 steps (15 resets) in 845 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (13 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 153623 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 153623 steps, saw 87639 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 13:40:44] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:40:44] [INFO ] Invariant cache hit.
[2024-06-01 13:40:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/209 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/223 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 216/439 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1504 variables, 446/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 96/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 2/1506 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1506 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1506 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1506 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1506/1506 variables, and 594 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3726 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/209 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/223 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 216/439 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1504 variables, 446/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1504 variables, 96/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1504 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 13:40:51] [INFO ] Deduced a trap composed of 188 places in 299 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1504 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1504 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/1506 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1506 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1506 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1506 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1506/1506 variables, and 599 constraints, problems are : Problem set: 0 solved, 4 unsolved in 12819 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 16560ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 22817 ms.
Support contains 26 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 27 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 18 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-06-01 13:41:24] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:41:24] [INFO ] Invariant cache hit.
[2024-06-01 13:41:24] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 13:41:24] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:41:24] [INFO ] Invariant cache hit.
[2024-06-01 13:41:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:41:31] [INFO ] Implicit Places using invariants and state equation in 6758 ms returned []
Implicit Place search using SMT with State Equation took 7122 ms to find 0 implicit places.
[2024-06-01 13:41:31] [INFO ] Redundant transitions in 67 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-06-01 13:41:31] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-06-01 13:41:31] [INFO ] Invariant cache hit.
[2024-06-01 13:41:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 2 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 167 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 165 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 171 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:41:48] [INFO ] Deduced a trap composed of 150 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:41:48] [INFO ] Deduced a trap composed of 288 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:41:48] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:41:58] [INFO ] Deduced a trap composed of 179 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:41:58] [INFO ] Deduced a trap composed of 173 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 58 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:42:08] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:42:08] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:42:14] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-06-01 13:42:21] [INFO ] Deduced a trap composed of 177 places in 244 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1506 variables, and 62 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 20/20 constraints]
After SMT, in 62077ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 62096ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69317 ms. Remains : 448/448 places, 1074/1074 transitions.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
[2024-06-01 13:42:33] [INFO ] Flatten gal took : 93 ms
[2024-06-01 13:42:33] [INFO ] Flatten gal took : 93 ms
[2024-06-01 13:42:34] [INFO ] Input system was already deterministic with 1306 transitions.
Support contains 488 out of 690 places (down from 497) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Applied a total of 18 rules in 21 ms. Remains 680 /690 variables (removed 10) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-06-01 13:42:34] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 680 cols
[2024-06-01 13:42:34] [INFO ] Computed 52 invariants in 36 ms
[2024-06-01 13:42:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 96 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 73 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 74 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 69 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 2 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 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 Real declared 678/1962 variables, and 60 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 192 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 199 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:42:59] [INFO ] Deduced a trap composed of 338 places in 362 ms of which 5 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 326 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 353 places in 317 ms of which 5 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 353 places in 331 ms of which 6 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 353 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 417 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 353 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 327 places in 315 ms of which 5 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:43:16] [INFO ] Deduced a trap composed of 363 places in 393 ms of which 6 ms to minimize.
[2024-06-01 13:43:16] [INFO ] Deduced a trap composed of 362 places in 346 ms of which 21 ms to minimize.
SMT process timed out in 42245ms, After SMT, problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 42264ms
Finished structural reductions in LTL mode , in 1 iterations and 42291 ms. Remains : 680/690 places, 1298/1306 transitions.
[2024-06-01 13:43:16] [INFO ] Flatten gal took : 51 ms
[2024-06-01 13:43:16] [INFO ] Flatten gal took : 51 ms
[2024-06-01 13:43:16] [INFO ] Input system was already deterministic with 1298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 29 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:43:16] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 13:43:16] [INFO ] Computed 52 invariants in 32 ms
[2024-06-01 13:43:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 58 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:43:41] [INFO ] Deduced a trap composed of 154 places in 285 ms of which 6 ms to minimize.
[2024-06-01 13:43:41] [INFO ] Deduced a trap composed of 174 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:43:41] [INFO ] Deduced a trap composed of 315 places in 343 ms of which 5 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 327 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 390 places in 322 ms of which 4 ms to minimize.
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 336 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 372 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 343 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 375 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:43:45] [INFO ] Deduced a trap composed of 348 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 326 places in 339 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 70 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 20/20 constraints]
After SMT, in 42194ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42212ms
Finished structural reductions in LTL mode , in 1 iterations and 42254 ms. Remains : 672/690 places, 1290/1306 transitions.
[2024-06-01 13:43:59] [INFO ] Flatten gal took : 64 ms
[2024-06-01 13:43:59] [INFO ] Flatten gal took : 77 ms
[2024-06-01 13:43:59] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 674 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 674 transition count 1290
Applied a total of 32 rules in 29 ms. Remains 674 /690 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:43:59] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 674 cols
[2024-06-01 13:43:59] [INFO ] Computed 54 invariants in 27 ms
[2024-06-01 13:43:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:44:11] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 349 places in 378 ms of which 5 ms to minimize.
[2024-06-01 13:44:13] [INFO ] Deduced a trap composed of 162 places in 324 ms of which 5 ms to minimize.
[2024-06-01 13:44:13] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:44:14] [INFO ] Deduced a trap composed of 384 places in 384 ms of which 5 ms to minimize.
[2024-06-01 13:44:14] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:44:15] [INFO ] Deduced a trap composed of 336 places in 373 ms of which 5 ms to minimize.
[2024-06-01 13:44:15] [INFO ] Deduced a trap composed of 319 places in 377 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 64 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:44:32] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:44:36] [INFO ] Deduced a trap composed of 351 places in 339 ms of which 5 ms to minimize.
[2024-06-01 13:44:36] [INFO ] Deduced a trap composed of 346 places in 328 ms of which 5 ms to minimize.
[2024-06-01 13:44:36] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:44:38] [INFO ] Deduced a trap composed of 374 places in 322 ms of which 5 ms to minimize.
[2024-06-01 13:44:38] [INFO ] Deduced a trap composed of 59 places in 335 ms of which 5 ms to minimize.
[2024-06-01 13:44:41] [INFO ] Deduced a trap composed of 391 places in 326 ms of which 5 ms to minimize.
SMT process timed out in 41927ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41945ms
Finished structural reductions in LTL mode , in 1 iterations and 41978 ms. Remains : 674/690 places, 1290/1306 transitions.
[2024-06-01 13:44:41] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:44:41] [INFO ] Flatten gal took : 83 ms
[2024-06-01 13:44:41] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 27 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:44:41] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 13:44:41] [INFO ] Computed 52 invariants in 36 ms
[2024-06-01 13:44:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:44:55] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 2 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:45:00] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:45:02] [INFO ] Deduced a trap composed of 382 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:45:02] [INFO ] Deduced a trap composed of 355 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:45:03] [INFO ] Deduced a trap composed of 361 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:45:03] [INFO ] Deduced a trap composed of 386 places in 372 ms of which 5 ms to minimize.
SMT process timed out in 22019ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22034ms
Finished structural reductions in LTL mode , in 1 iterations and 22064 ms. Remains : 672/690 places, 1290/1306 transitions.
[2024-06-01 13:45:03] [INFO ] Flatten gal took : 90 ms
[2024-06-01 13:45:03] [INFO ] Flatten gal took : 62 ms
[2024-06-01 13:45:03] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 688 transition count 1258
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 640 transition count 1250
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 632 transition count 1250
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 112 place count 632 transition count 1162
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 288 place count 544 transition count 1162
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
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 384 place count 496 transition count 1114
Applied a total of 384 rules in 88 ms. Remains 496 /690 variables (removed 194) and now considering 1114/1306 (removed 192) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 13:45:04] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 496 cols
[2024-06-01 13:45:04] [INFO ] Computed 52 invariants in 31 ms
[2024-06-01 13:45:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 202 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 191 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:45:15] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:45:24] [INFO ] Deduced a trap composed of 167 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:45:25] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1594 variables, and 62 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 308 places in 263 ms of which 3 ms to minimize.
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:45:38] [INFO ] Deduced a trap composed of 270 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:45:39] [INFO ] Deduced a trap composed of 221 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:45:39] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:45:40] [INFO ] Deduced a trap composed of 68 places in 286 ms of which 3 ms to minimize.
[2024-06-01 13:45:40] [INFO ] Deduced a trap composed of 93 places in 245 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1594 variables, and 69 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 19/19 constraints]
After SMT, in 41989ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 42005ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42097 ms. Remains : 496/690 places, 1114/1306 transitions.
[2024-06-01 13:45:46] [INFO ] Flatten gal took : 70 ms
[2024-06-01 13:45:46] [INFO ] Flatten gal took : 53 ms
[2024-06-01 13:45:46] [INFO ] Input system was already deterministic with 1114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 27 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:45:46] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 13:45:46] [INFO ] Computed 52 invariants in 41 ms
[2024-06-01 13:45:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:46:00] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:46:05] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:46:06] [INFO ] Deduced a trap composed of 382 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:46:07] [INFO ] Deduced a trap composed of 355 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:46:07] [INFO ] Deduced a trap composed of 361 places in 318 ms of which 5 ms to minimize.
[2024-06-01 13:46:07] [INFO ] Deduced a trap composed of 386 places in 292 ms of which 5 ms to minimize.
[2024-06-01 13:46:07] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:46:08] [INFO ] Deduced a trap composed of 398 places in 339 ms of which 5 ms to minimize.
SMT process timed out in 22080ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22096ms
Finished structural reductions in LTL mode , in 1 iterations and 22126 ms. Remains : 672/690 places, 1290/1306 transitions.
[2024-06-01 13:46:08] [INFO ] Flatten gal took : 32 ms
[2024-06-01 13:46:08] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:46:08] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 23 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:46:08] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:46:08] [INFO ] Invariant cache hit.
[2024-06-01 13:46:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 3 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:46:21] [INFO ] Deduced a trap composed of 380 places in 299 ms of which 5 ms to minimize.
[2024-06-01 13:46:21] [INFO ] Deduced a trap composed of 364 places in 293 ms of which 5 ms to minimize.
[2024-06-01 13:46:21] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:46:22] [INFO ] Deduced a trap composed of 367 places in 337 ms of which 5 ms to minimize.
[2024-06-01 13:46:22] [INFO ] Deduced a trap composed of 184 places in 282 ms of which 5 ms to minimize.
[2024-06-01 13:46:23] [INFO ] Deduced a trap composed of 366 places in 331 ms of which 5 ms to minimize.
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 382 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 395 places in 348 ms of which 4 ms to minimize.
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 356 places in 333 ms of which 5 ms to minimize.
[2024-06-01 13:46:25] [INFO ] Deduced a trap composed of 402 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:46:25] [INFO ] Deduced a trap composed of 353 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:46:25] [INFO ] Deduced a trap composed of 346 places in 262 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:46:32] [INFO ] Deduced a trap composed of 341 places in 341 ms of which 5 ms to minimize.
[2024-06-01 13:46:33] [INFO ] Deduced a trap composed of 380 places in 365 ms of which 5 ms to minimize.
[2024-06-01 13:46:41] [INFO ] Deduced a trap composed of 461 places in 324 ms of which 5 ms to minimize.
[2024-06-01 13:46:43] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:46:47] [INFO ] Deduced a trap composed of 350 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:46:48] [INFO ] Deduced a trap composed of 69 places in 252 ms of which 3 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 670/1946 variables, and 75 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 25/25 constraints]
After SMT, in 41839ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41850ms
Finished structural reductions in LTL mode , in 1 iterations and 41876 ms. Remains : 672/690 places, 1290/1306 transitions.
[2024-06-01 13:46:50] [INFO ] Flatten gal took : 55 ms
[2024-06-01 13:46:50] [INFO ] Flatten gal took : 81 ms
[2024-06-01 13:46:50] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 45 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:46:50] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:46:50] [INFO ] Invariant cache hit.
[2024-06-01 13:46:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:47:03] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:47:03] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:47:03] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:47:03] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 380 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 364 places in 306 ms of which 5 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 367 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 184 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 366 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:47:07] [INFO ] Deduced a trap composed of 382 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:47:07] [INFO ] Deduced a trap composed of 395 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:47:07] [INFO ] Deduced a trap composed of 356 places in 324 ms of which 4 ms to minimize.
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 402 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 353 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 346 places in 280 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 1.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 1.0)
(s15 3.0)
(s16 1.0)
(s17 1.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 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 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 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.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 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 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.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 9.0)
(s195 0.0)
(s196 1.0)
(s197 1.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 0.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 1.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 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 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.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 4.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 3.0)
(s536 1.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 2.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:47:15] [INFO ] Deduced a trap composed of 341 places in 359 ms of which 5 ms to minimize.
[2024-06-01 13:47:16] [INFO ] Deduced a trap composed of 380 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 461 places in 295 ms of which 5 ms to minimize.
[2024-06-01 13:47:26] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:47:30] [INFO ] Deduced a trap composed of 350 places in 325 ms of which 4 ms to minimize.
[2024-06-01 13:47:31] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 75 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 25/25 constraints]
After SMT, in 42117ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42141ms
Finished structural reductions in LTL mode , in 1 iterations and 42191 ms. Remains : 672/690 places, 1290/1306 transitions.
[2024-06-01 13:47:32] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:47:32] [INFO ] Flatten gal took : 42 ms
[2024-06-01 13:47:33] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Applied a total of 18 rules in 14 ms. Remains 680 /690 variables (removed 10) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-06-01 13:47:33] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 680 cols
[2024-06-01 13:47:33] [INFO ] Computed 52 invariants in 29 ms
[2024-06-01 13:47:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 13:47:47] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:47:49] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:47:49] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:47:49] [INFO ] Deduced a trap composed of 72 places in 243 ms of which 2 ms to minimize.
[2024-06-01 13:47:49] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/1962 variables, and 59 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 13:47:55] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:47:56] [INFO ] Deduced a trap composed of 142 places in 313 ms of which 3 ms to minimize.
[2024-06-01 13:47:56] [INFO ] Deduced a trap composed of 186 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:47:57] [INFO ] Deduced a trap composed of 338 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 350 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 362 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 351 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:48:10] [INFO ] Deduced a trap composed of 407 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:48:10] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:48:11] [INFO ] Deduced a trap composed of 364 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:48:11] [INFO ] Deduced a trap composed of 364 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:48:14] [INFO ] Deduced a trap composed of 421 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:48:14] [INFO ] Deduced a trap composed of 397 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:48:14] [INFO ] Deduced a trap composed of 396 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:48:14] [INFO ] Deduced a trap composed of 398 places in 258 ms of which 3 ms to minimize.
SMT process timed out in 41911ms, After SMT, problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 41923ms
Finished structural reductions in LTL mode , in 1 iterations and 41940 ms. Remains : 680/690 places, 1298/1306 transitions.
[2024-06-01 13:48:15] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:48:15] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:48:15] [INFO ] Input system was already deterministic with 1298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 23 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:48:15] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 13:48:15] [INFO ] Computed 52 invariants in 25 ms
[2024-06-01 13:48:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 3 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:48:37] [INFO ] Deduced a trap composed of 382 places in 260 ms of which 3 ms to minimize.
SMT process timed out in 22046ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22058ms
Finished structural reductions in LTL mode , in 1 iterations and 22083 ms. Remains : 672/690 places, 1290/1306 transitions.
[2024-06-01 13:48:37] [INFO ] Flatten gal took : 58 ms
[2024-06-01 13:48:37] [INFO ] Flatten gal took : 53 ms
[2024-06-01 13:48:37] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 31 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:48:37] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:48:37] [INFO ] Invariant cache hit.
[2024-06-01 13:48:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:48:51] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:48:51] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:48:52] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:48:52] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:48:52] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:48:52] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:48:52] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 380 places in 344 ms of which 5 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 364 places in 372 ms of which 6 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 367 places in 320 ms of which 3 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 184 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:48:55] [INFO ] Deduced a trap composed of 366 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:48:55] [INFO ] Deduced a trap composed of 382 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:48:55] [INFO ] Deduced a trap composed of 395 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 356 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 402 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 353 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 346 places in 232 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:49:01] [INFO ] Deduced a trap composed of 341 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:49:02] [INFO ] Deduced a trap composed of 380 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:49:08] [INFO ] Deduced a trap composed of 461 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:49:13] [INFO ] Deduced a trap composed of 350 places in 252 ms of which 5 ms to minimize.
[2024-06-01 13:49:14] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 396 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:49:17] [INFO ] Deduced a trap composed of 371 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 77 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 27/27 constraints]
After SMT, in 41863ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41881ms
Finished structural reductions in LTL mode , in 1 iterations and 41918 ms. Remains : 672/690 places, 1290/1306 transitions.
[2024-06-01 13:49:19] [INFO ] Flatten gal took : 32 ms
[2024-06-01 13:49:19] [INFO ] Flatten gal took : 35 ms
[2024-06-01 13:49:19] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 672 transition count 1290
Applied a total of 34 rules in 20 ms. Remains 672 /690 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:49:19] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:49:19] [INFO ] Invariant cache hit.
[2024-06-01 13:49:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 380 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 364 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 367 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 184 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 366 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 382 places in 302 ms of which 3 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 395 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:49:35] [INFO ] Deduced a trap composed of 356 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:49:35] [INFO ] Deduced a trap composed of 402 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:49:35] [INFO ] Deduced a trap composed of 353 places in 266 ms of which 3 ms to minimize.
[2024-06-01 13:49:35] [INFO ] Deduced a trap composed of 346 places in 252 ms of which 3 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 Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:49:43] [INFO ] Deduced a trap composed of 341 places in 338 ms of which 6 ms to minimize.
[2024-06-01 13:49:44] [INFO ] Deduced a trap composed of 380 places in 361 ms of which 5 ms to minimize.
[2024-06-01 13:49:52] [INFO ] Deduced a trap composed of 461 places in 317 ms of which 5 ms to minimize.
[2024-06-01 13:49:54] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:49:58] [INFO ] Deduced a trap composed of 350 places in 338 ms of which 5 ms to minimize.
[2024-06-01 13:49:59] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 75 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 25/25 constraints]
After SMT, in 41391ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41404ms
Finished structural reductions in LTL mode , in 1 iterations and 41426 ms. Remains : 672/690 places, 1290/1306 transitions.
[2024-06-01 13:50:01] [INFO ] Flatten gal took : 46 ms
[2024-06-01 13:50:01] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:50:01] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 7 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2024-06-01 13:50:01] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-06-01 13:50:01] [INFO ] Computed 54 invariants in 15 ms
[2024-06-01 13:50:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:50:15] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:50:15] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:50:15] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:50:15] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:50:15] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:50:15] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:50:15] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:50:16] [INFO ] Deduced a trap composed of 370 places in 334 ms of which 5 ms to minimize.
[2024-06-01 13:50:16] [INFO ] Deduced a trap composed of 210 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:50:16] [INFO ] Deduced a trap composed of 188 places in 267 ms of which 5 ms to minimize.
[2024-06-01 13:50:18] [INFO ] Deduced a trap composed of 353 places in 351 ms of which 5 ms to minimize.
[2024-06-01 13:50:18] [INFO ] Deduced a trap composed of 373 places in 336 ms of which 4 ms to minimize.
[2024-06-01 13:50:18] [INFO ] Deduced a trap composed of 453 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 361 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 65 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
[2024-06-01 13:50:25] [INFO ] Deduced a trap composed of 356 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 346 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 354 places in 352 ms of which 5 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 327 places in 241 ms of which 4 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 379 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 372 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 369 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 361 places in 333 ms of which 5 ms to minimize.
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 349 places in 321 ms of which 5 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 686/1980 variables, and 77 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 27/27 constraints]
After SMT, in 42173ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 42189ms
Finished structural reductions in LTL mode , in 1 iterations and 42200 ms. Remains : 690/690 places, 1306/1306 transitions.
[2024-06-01 13:50:43] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:50:43] [INFO ] Flatten gal took : 42 ms
[2024-06-01 13:50:43] [INFO ] Input system was already deterministic with 1306 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Applied a total of 18 rules in 14 ms. Remains 680 /690 variables (removed 10) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-06-01 13:50:43] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 680 cols
[2024-06-01 13:50:43] [INFO ] Computed 52 invariants in 35 ms
[2024-06-01 13:50:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 13:50:57] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 69 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 0 ms to minimize.
(s36 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0timeout
)
(s37 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/1962 variables, and 59 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 13:51:06] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:51:07] [INFO ] Deduced a trap composed of 142 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:51:07] [INFO ] Deduced a trap composed of 186 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:51:08] [INFO ] Deduced a trap composed of 338 places in 323 ms of which 5 ms to minimize.
[2024-06-01 13:51:15] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:51:21] [INFO ] Deduced a trap composed of 350 places in 344 ms of which 5 ms to minimize.
[2024-06-01 13:51:21] [INFO ] Deduced a trap composed of 362 places in 331 ms of which 5 ms to minimize.
[2024-06-01 13:51:21] [INFO ] Deduced a trap composed of 351 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:51:22] [INFO ] Deduced a trap composed of 407 places in 360 ms of which 5 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 69 places in 347 ms of which 4 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 364 places in 347 ms of which 5 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 364 places in 333 ms of which 5 ms to minimize.
[2024-06-01 13:51:25] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/1962 variables, and 72 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1296 constraints, Known Traps: 22/22 constraints]
After SMT, in 41706ms problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 41716ms
Finished structural reductions in LTL mode , in 1 iterations and 41733 ms. Remains : 680/690 places, 1298/1306 transitions.
[2024-06-01 13:51:25] [INFO ] Flatten gal took : 35 ms
[2024-06-01 13:51:25] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:51:25] [INFO ] Input system was already deterministic with 1298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Applied a total of 18 rules in 18 ms. Remains 680 /690 variables (removed 10) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-06-01 13:51:25] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-06-01 13:51:25] [INFO ] Invariant cache hit.
[2024-06-01 13:51:25] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 13:51:38] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 2 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:51:44] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:51:46] [INFO ] Deduced a trap composed of 355 places in 352 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/1962 variables, and 59 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 13:51:49] [INFO ] Deduced a trap composed of 142 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:51:49] [INFO ] Deduced a trap composed of 189 places in 303 ms of which 5 ms to minimize.
[2024-06-01 13:51:50] [INFO ] Deduced a trap composed of 185 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:51:50] [INFO ] Deduced a trap composed of 173 places in 315 ms of which 5 ms to minimize.
[2024-06-01 13:51:51] [INFO ] Deduced a trap composed of 347 places in 370 ms of which 5 ms to minimize.
[2024-06-01 13:51:51] [INFO ] Deduced a trap composed of 398 places in 351 ms of which 5 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:51:59] [INFO ] Deduced a trap composed of 368 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:52:05] [INFO ] Deduced a trap composed of 339 places in 350 ms of which 6 ms to minimize.
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 358 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 362 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 372 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:52:07] [INFO ] Deduced a trap composed of 381 places in 342 ms of which 5 ms to minimize.
[2024-06-01 13:52:07] [INFO ] Deduced a trap composed of 47 places in 331 ms of which 5 ms to minimize.
SMT process timed out in 41969ms, After SMT, problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 41988ms
Finished structural reductions in LTL mode , in 1 iterations and 42009 ms. Remains : 680/690 places, 1298/1306 transitions.
[2024-06-01 13:52:07] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:52:07] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:52:07] [INFO ] Input system was already deterministic with 1298 transitions.
[2024-06-01 13:52:07] [INFO ] Flatten gal took : 49 ms
[2024-06-01 13:52:07] [INFO ] Flatten gal took : 53 ms
[2024-06-01 13:52:07] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 15 ms.
[2024-06-01 13:52:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 690 places, 1306 transitions and 5668 arcs took 7 ms.
Total runtime 901200 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-COL-S02J06T08-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-CTLFireability-2024-15

BK_STOP 1717249928373

--------------------
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-COL-S02J06T08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/2152/ctl_0_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/2152/ctl_1_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/2152/ctl_2_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/2152/ctl_3_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/2152/ctl_4_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/2152/ctl_5_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/2152/ctl_6_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/2152/ctl_7_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/2152/ctl_8_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/2152/ctl_9_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/2152/ctl_10_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/2152/ctl_11_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/2152/ctl_12_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/2152/ctl_13_
ctl formula name PolyORBLF-COL-S02J06T08-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/2152/ctl_14_
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-COL-S02J06T08"
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-COL-S02J06T08, 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-171654446400106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 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 ;